Generalized Sampling on Graphs With A Subspace Prior

We consider a framework for generalized sampling of graph signals that extends sampling results in shift-invariant (SI) spaces to the graph setting. We assume that the input signal lies in a periodic graph spectrum subspace, which generalizes the standard SI assumption to graph signals. Sampling is performed in the graph frequency domain by an arbitrary graph filter. We show that under a mild condition on the sampling filter, perfect recovery is possible using a correction filter that can be represented as a spectral graph filter whose response depends on the prior subspace spectrum and on the sampling filter. This filter parallels the correction filter in SI sampling in standard signal processing. Since the input space and the sampling filter are almost arbitrary, our framework allows perfect recovery of many classes of input signals from a variety of different sampling patterns using a simple correction filter. For example, our method enables perfect recovery of non-bandlimited graph signals from their bandlimited measurements.

[1]  Toshihisa Tanaka,et al.  Eigendecomposition-Free Sampling Set Selection for Graph Signals , 2018, IEEE Transactions on Signal Processing.

[2]  I. Pesenson Sampling in paley-wiener spaces on combinatorial graphs , 2008, 1111.5896.

[3]  Robert Bregovic,et al.  Multirate Systems and Filter Banks , 2002 .

[4]  Pierre Vandergheynst,et al.  Graph Signal Processing: Overview, Challenges, and Applications , 2017, Proceedings of the IEEE.

[5]  Jelena Kovacevic,et al.  Discrete Signal Processing on Graphs: Sampling Theory , 2015, IEEE Transactions on Signal Processing.

[6]  Yuichi Tanaka,et al.  Spectral Domain Sampling of Graph Signals , 2017, IEEE Transactions on Signal Processing.

[7]  Yonina C. Eldar,et al.  Graph Sampling with and Without Input Priors , 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[8]  Pascal Frossard,et al.  The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.

[9]  Yonina C. Eldar Sampling Theory: Beyond Bandlimited Systems , 2015 .

[10]  Pierre Vandergheynst,et al.  Vertex-Frequency Analysis on Graphs , 2013, ArXiv.

[11]  Yonina C. Eldar,et al.  Beyond bandlimited sampling , 2009, IEEE Signal Processing Magazine.

[12]  Antonio Ortega,et al.  Submitted to Ieee Transactions on Signal Processing 1 Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies , 2022 .

[13]  Santiago Segarra,et al.  Sampling of Graph Signals With Successive Local Aggregations , 2015, IEEE Transactions on Signal Processing.