Iterative reconstruction of signals on graph
arXiv:1910.00805 · doi:10.1109/LSP.2019.2956670
Abstract
We propose an iterative algorithm to interpolate graph signals from only a partial set of samples. Our method is derived from the well known Papoulis-Gerchberg algorithm by considering the optimal value of a constant involved in the iteration step. Compared with existing graph signal reconstruction algorithms, the proposed method achieves similar or better performance both in terms of convergence rate and computational efficiency.
arXiv comment8 pages, 3 figures
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
- Discrete Signal Processing on Graphs: Sampling Theory
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Signals on Graphs: Uncertainty Principle and Sampling
- Signal Recovery on Graphs: Variation Minimization
- Sampling of graph signals with successive local aggregations
- Local-set-based Graph Signal Reconstruction
- Reconstruction of Graph Signals through Percolation from Seeding Nodes