Node-Adaptive Regularization for Graph Signal Reconstruction
arXiv:2010.13413 · doi:10.1109/OJSP.2021.3056897
Abstract
A critical task in graph signal processing is to estimate the true signal from noisy observations over a subset of nodes, also known as the reconstruction problem. In this paper, we propose a node-adaptive regularization for graph signal reconstruction, which surmounts the conventional Tikhonov regularization, giving rise to more degrees of freedom; hence, an improved performance. We formulate the node-adaptive graph signal denoising problem, study its bias-variance trade-off, and identify conditions under which a lower mean squared error and variance can be obtained with respect to Tikhonov regularization. Compared with existing approaches, the node-adaptive regularization enjoys more general priors on the local signal variation, which can be obtained by optimally designing the regularization weights based on Prony's method or semidefinite programming. As these approaches require additional prior knowledge, we also propose a minimax (worst-case) strategy to address instances where this extra information is unavailable. Numerical experiments with synthetic and real data corroborate the proposed regularization strategy for graph signal denoising and interpolation, and show its improved performance compared with competing alternatives.
References in corpus (13)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- The solution path of the generalized lasso
- Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
- Autoregressive Moving Average Graph Filtering
- Kernel-based Reconstruction of Graph Signals
- Signal Processing on Graphs: Causal Modeling of Unstructured Data
- Local-set-based Graph Signal Reconstruction
- Towards real-world complexity: an introduction to multiplex networks
- Random Walk Graph Laplacian based Smoothness Prior for Soft Decoding of JPEG Images
- Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies
- Advances in Distributed Graph Filtering
- A Distributed Tracking Algorithm for Reconstruction of Graph Signals
- Bias-Variance Tradeoff of Graph Laplacian Regularizer