Graph Signal Restoration Using Nested Deep Algorithm Unrolling
Masatoshi Nagahama, Koki Yamada, Yuichi Tanaka, Stanley H. Chan,, Yonina C. Eldar

TL;DR
This paper introduces two novel graph signal restoration methods based on deep algorithm unrolling, improving performance and interpretability over existing techniques in denoising and interpolation tasks.
Contribution
It proposes unrolled ADMM-based denoising and nested DAU structures with trainable parameters, addressing limitations of convex optimization and graph neural networks.
Findings
Improved root mean squared error in denoising tasks.
Enhanced interpolation accuracy on synthetic and real data.
Methods outperform several existing techniques.
Abstract
Graph signal processing is a ubiquitous task in many applications such as sensor, social, transportation and brain networks, point cloud processing, and graph neural networks. Often, graph signals are corrupted in the sensing process, thus requiring restoration. In this paper, we propose two graph signal restoration methods based on deep algorithm unrolling (DAU). First, we present a graph signal denoiser by unrolling iterations of the alternating direction method of multiplier (ADMM). We then suggest a general restoration method for linear degradation by unrolling iterations of Plug-and-Play ADMM (PnP-ADMM). In the second approach, the unrolled ADMM-based denoiser is incorporated as a submodule, leading to a nested DAU structure. The parameters in the proposed denoising/restoration methods are trainable in an end-to-end manner. Our approach is interpretable and keeps the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsAlternating Direction Method of Multipliers
