Accelerated sensor position selection using graph localization operator

This paper addresses the problem of finding optimal sensor placement, i.e., determining F sensor positions from N possible locations. We propose a sensor selection method based on the localization operator of graph signal processing. This method can select sensors while considering the localizations both in graph vertex domain and graph spectral domain and is fast, since eigendecomposition of graph Laplacian matrix is not required. We also propose an interpretation of the conventional node selection based on graph sampling theory by using the graph localization operators. Experiments on selected sensor location, execution time and prediction error comparisons are conducted to show the effectiveness of our approach.

[1]  Andreas Krause,et al.  Efficient Planning of Informative Paths for Multiple Robots , 2006, IJCAI.

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

[3]  W. Dunsmuir,et al.  Estimation of nonstationary spatial covariance structure , 2002 .

[4]  C. Guestrin,et al.  Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[5]  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).

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

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

[8]  Toshihisa Tanaka,et al.  Nested performance bounds and approximate solutions for the sensor placement problem , 2014, APSIPA Transactions on Signal and Information Processing.

[9]  Wei Hong,et al.  Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.

[10]  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).

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

[12]  Pierre Vandergheynst,et al.  Wavelets on Graphs via Spectral Graph Theory , 2009, ArXiv.

[13]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..

[14]  Alessandro Nordio,et al.  Sensor Selection and Precoding Strategies for Wireless Sensor Networks , 2015, IEEE Transactions on Signal Processing.

[15]  W. F. Caselton,et al.  Optimal monitoring network designs , 1984 .

[16]  Héctor H. González-Baños,et al.  A randomized art-gallery algorithm for sensor placement , 2001, SCG '01.

[17]  Ilan Shomorony,et al.  Sampling large data on graphs , 2014, 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

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

[19]  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).

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

[21]  Andreas Krause,et al.  SFO: A Toolbox for Submodular Function Optimization , 2010, J. Mach. Learn. Res..

[22]  Henry P. Wynn,et al.  Maximum entropy sampling , 1987 .

[23]  Andreas Krause,et al.  Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.