Preconditioned Gradient Descent Algorithm for Inverse Filtering on Spatially Distributed Networks
arXiv:2007.11491 · doi:10.1109/LSP.2020.3029699
Abstract
Graph filters and their inverses have been widely used in denoising, smoothing, sampling, interpolating and learning. Implementation of an inverse filtering procedure on spatially distributed networks (SDNs) is a remarkable challenge, as each agent on an SDN is equipped with a data processing subsystem with limited capacity and a communication subsystem with confined range due to engineering limitations. In this letter, we introduce a preconditioned gradient descent algorithm to implement the inverse filtering procedure associated with a graph filter having small geodesic-width. The proposed algorithm converges exponentially, and it can be implemented at vertex level and applied to time-varying inverse filtering on SDNs.
References in corpus (9)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Discrete Signal Processing on Graphs
- Signal Recovery on Graphs: Variation Minimization
- Diffusion Maps, Spectral Clustering and Eigenfunctions of Fokker-Planck operators
- GSPBOX: A toolbox for signal processing on graphs
- Autoregressive Moving Average Graph Filtering
- Forecasting Time Series with VARMA Recursions on Graphs
- Advances in Distributed Graph Filtering
- Polynomial graph filter of multiple shifts and distributed implementation of inverse filtering