Signal recovery on graphs: Random versus experimentally designed sampling

We study signal recovery on graphs based on two sampling strategies: random sampling and experimentally designed sampling. We propose a new class of smooth graph signals, called approximately bandlimited. We then propose two recovery strategies based on random sampling and experimentally designed sampling. The proposed recovery strategy based on experimentally designed sampling uses sampling scores, which is similar to the leverage scores used in the matrix approximation. We show that while both strategies are unbiased estimators for the low-frequency components, the convergence rate of experimentally designed sampling is much faster than that of random sampling when a graph is irregular1. We validate the proposed recovery strategies on three specific graphs: a ring graph, an Erdös-Rényi graph, and a star graph. The simulation results support the theoretical analysis.

[1]  José M. F. Moura,et al.  Big Data Analysis with Signal Processing on Graphs: Representation and processing of massive data sets with irregular structure , 2014, IEEE Signal Processing Magazine.

[2]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[3]  Aarti Singh,et al.  Identifying graph-structured activation patterns in networks , 2010, NIPS.

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

[5]  Jelena Kovacevic,et al.  Algebraic Signal Processing Theory: 1-D Nearest Neighbor Models , 2012, IEEE Transactions on Signal Processing.

[6]  Vivek K Goyal,et al.  Foundations of Signal Processing , 2014 .

[7]  I. Johnstone.  Minimax Bayes, Asymptotic Minimax and Sparse Wavelet Priors , 1994 .

[8]  Van H. Vu,et al.  Sparse random graphs: Eigenvalues and eigenvectors , 2010, Random Struct. Algorithms.

[9]  Jose M. F. Moura,et al.  Representation and processing of massive data sets with irregular structure ] Big Data Analysis with Signal Processing on Graphs , 2022 .

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

[11]  Antonio Ortega,et al.  Towards a sampling theorem for signals on arbitrary graphs , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[12]  David P. Woodruff,et al.  Fast approximation of matrix coherence and statistical leverage , 2011, ICML.

[13]  José M. F. Moura,et al.  Signal Recovery on Graphs , 2014, ArXiv.

[14]  Pengfei Liu,et al.  Local-Set-Based Graph Signal Reconstruction , 2014, IEEE Transactions on Signal Processing.

[15]  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.