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.