A Novel Scheme for Support Identification and Iterative Sampling of Bandlimited Graph Signals
arXiv:1807.07184
Abstract
We study the problem of sampling and reconstruction of bandlimited graph signals where the objective is to select a node subset of prescribed cardinality that ensures interpolation of the original signal with the lowest reconstruction error. We propose an efficient iterative selection sampling approach and show that in the noiseless case the original signal is exactly recovered from the set of selected nodes. In the case of noisy measurements, a bound on the reconstruction error of the proposed algorithm is established. We further address the support identification of the bandlimited signal with unknown support and show that under a pragmatic sufficient condition, the proposed framework requires minimal number of samples to perfectly identify the support. The efficacy of the proposed methods are illustrated through numerical simulations on synthetic and real-world graphs.
References in corpus (12)
- 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
- Sampling of graph signals with successive local aggregations
- Graph Frequency Analysis of Brain Signals
- Kernel-based Reconstruction of Graph Signals
- Greedy Sampling of Graph Signals
- On the Graph Fourier Transform for Directed Graphs
- Spectral Projector-Based Graph Fourier Transforms
- A Directed Graph Fourier Transform with Spread Frequency Components