Graph Signal Restoration Using Nested Deep Algorithm Unrolling
arXiv:2106.15910 · doi:10.1109/TSP.2022.3180546
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 parameters small since we only tune graph-independent regularization parameters. We overcome two main challenges in existing graph signal restoration methods: 1) limited performance of convex optimization algorithms due to fixed parameters which are often determined manually. 2) large number of parameters of graph neural networks that result in difficulty of training. Several experiments for graph signal denoising and interpolation are performed on synthetic and real-world data. The proposed methods show performance improvements over several existing techniques in terms of root mean squared error in both tasks.
References in corpus (18)
- Adam: A Method for Stochastic Optimization
- PyTorch: An Imperative Style, High-Performance Deep Learning Library
- Semi-Supervised Classification with Graph Convolutional Networks
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Discrete Signal Processing on Graphs
- Deep Image Prior
- Discrete Signal Processing on Graphs: Sampling Theory
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Signal Recovery on Graphs: Variation Minimization
- Plug-and-Play Priors for Bright Field Electron Tomography and Sparse Interpolation
- Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
- Plug and play methods for magnetic resonance imaging (long version)
- Sampling Signals on Graphs: From Theory to Applications
- Graph Unrolling Networks: Interpretable Neural Networks for Graph Signal Denoising
- Generalized Sampling on Graphs With Subspace and Smoothness Priors
- Localized Spectral Graph Filter Frames: A Unifying Framework, Survey of Design Considerations, and Numerical Comparison (Extended Cut)
- Dynamically Unfolding Recurrent Restorer: A Moving Endpoint Control Method for Image Restoration
- Fast Singular Value Shrinkage with Chebyshev Polynomial Approximation Based on Signal Sparsity