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 equippedwith a data processing subsystemwith 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. © 2020 IEEE.
Original language | English |
---|---|
Article number | 9217928 |
Pages (from-to) | 1834-1838 |
Journal | IEEE Signal Processing Letters |
Volume | 27 |
Online published | 8 Oct 2020 |
DOIs | |
Publication status | Published - 2020 |
Externally published | Yes |
Research Keywords
- Gradient descent method
- Graph signal processing
- Inverse filtering
- Preconditioning
- Quasi-Newton method
- Spatially distributed network