Sequential Sampling and Estimation of Approximately Bandlimited Graph Signals

Graph signal sampling has been widely studied in recent years, but the accurate signal models required by most of the existing sampling methods are usually unavailable prior to any observations made in a practical environment. In this paper, a sequential sampling and estimation algorithm is proposed for approximately bandlimited graph signals, in the absence of prior knowledge concerning signal properties. We approach the problem from a Bayesian perspective in which we formulate the signal prior by a multivariate Gaussian distribution with unknown hyperparameters. To overcome the interconnected problems associated with the parameter estimation, in the proposed algorithm, hyperparameter estimation and sample selection are performed in an alternating way. At each step, the unknown hyperparameters are updated by an expectation maximization procedure based on historical observations, and then the next node in the sampling operation is chosen by uncertainty sampling with the latest hyperparameters. We prove that under some specific conditions, signal estimation in the proposed algorithm is consistent. Subsequent validation of the approach through simulations shows that the proposed procedure yields performances which are significantly better than existing state-of-the-art approaches notwithstanding the additional attribute of robustness in the presence of a broad range of signal attributes.

[1]  Geert Leus,et al.  Distributed Autoregressive Moving Average Graph Filters , 2015, IEEE Signal Processing Letters.

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

[3]  Bo Hu,et al.  Design of sampling set for bandlimited graph signal estimation , 2017, 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[4]  Pierre Vandergheynst,et al.  GSPBOX: A toolbox for signal processing on graphs , 2014, ArXiv.

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

[6]  Pierre Vandergheynst,et al.  Random sampling of bandlimited signals on graphs , 2015, NIPS 2015.

[7]  Alejandro Ribeiro,et al.  A Graph Signal Processing Perspective on Functional Brain Imaging , 2018, Proceedings of the IEEE.

[8]  Pierre Vandergheynst,et al.  Global and Local Uncertainty Principles for Signals on Graphs , 2016, 1603.03030.

[9]  José M. F. Moura,et al.  Discrete Signal Processing on Graphs , 2012, IEEE Transactions on Signal Processing.

[10]  Luc Pronzato,et al.  One-step ahead adaptive D-optimal design on a finite design space is asymptotically optimal , 2010 .

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

[12]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[13]  Toshihisa Tanaka,et al.  Efficient sensor position selection using graph signal sampling theory , 2016, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[14]  Hui Feng,et al.  Bayesian Design of Sampling Set for Bandlimited Graph Signals , 2019, 2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[15]  Judith Rousseau,et al.  Bayes and empirical Bayes : Do they merge? , 2012, 1204.1470.

[16]  Sunil K. Narang,et al.  Signal processing techniques for interpolation in graph structured data , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[17]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[18]  Gene Cheung,et al.  Point Cloud Denoising via Feature Graph Laplacian Regularization , 2020, IEEE Transactions on Image Processing.

[19]  Antonio Ortega,et al.  A probabilistic interpretation of sampling theory of graph signals , 2015, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[20]  Max Welling,et al.  Semi-Supervised Classification with Graph Convolutional Networks , 2016, ICLR.

[21]  Bo Hu,et al.  Infinite Impulse Response Graph Filters in Wireless Sensor Networks , 2015, IEEE Signal Processing Letters.

[22]  Ireneusz Jabłoński,et al.  Graph Signal Processing in Applications to Sensor Networks, Smart Grids, and Smart Cities , 2017, IEEE Sensors Journal.

[23]  Jelena Kovacevic,et al.  Signal Recovery on Graphs: Fundamental Limits of Sampling Strategies , 2015, IEEE Transactions on Signal and Information Processing over Networks.

[24]  Bo Hu,et al.  Active Sampling for Approximately Bandlimited Graph Signals , 2019, ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[25]  Alan V. Oppenheim,et al.  Discrete-time signal processing (2nd ed.) , 1999 .

[26]  Pascal Frossard,et al.  Chebyshev polynomial approximation for distributed signal processing , 2011, 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS).

[27]  Antonio Ortega,et al.  Active semi-supervised learning using sampling theory for graph signals , 2014, KDD.

[28]  David Cohn,et al.  Active Learning , 2010, Encyclopedia of Machine Learning.

[29]  A. Salman Avestimehr,et al.  A Sampling Theory Perspective of Graph-Based Semi-Supervised Learning , 2017, IEEE Transactions on Information Theory.

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

[31]  J. S. Meditch,et al.  Estimation Theory , 1977, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[32]  Enrico Magli,et al.  Graph Spectral Image Processing , 2018, Proceedings of the IEEE.