Browse > Article
http://dx.doi.org/10.13067/JKIECS.2022.17.1.153

Sampling Set Selection Algorithm for Weighted Graph Signals  

Kim, Yoon Hak (Dept. Electronic Engineering, Chosun University)
Publication Information
The Journal of the Korea institute of electronic communication sciences / v.17, no.1, 2022 , pp. 153-160 More about this Journal
Abstract
A greedy algorithm is proposed to select a subset of nodes of a graph for bandlimited graph signals in which each signal value is generated with its weight. Since graph signals are weighted, we seek to minimize the weighted reconstruction error which is formulated by using the QR factorization and derive an analytic result to find iteratively the node minimizing the weighted reconstruction error, leading to a simplified iterative selection process. Experiments show that the proposed method achieves a significant performance gain for graph signals with weights on various graphs as compared with the previous novel selection techniques.
Keywords
Graph Signal Processing; Sampling Set Selection; Greedy Algorithm; Weighted Reconstruction Error;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 A. Anis, A. Gadde, and A. Ortega, "Towards a sampling theorem for signals on arbitrary graphs," IEEE International Conference on Acoustic, Speech, and Signal Processing (ICASSP), Florence, Italy, 2014, pp. 3864-3858.
2 N. Perraudin, B. Ricaud, D. Shuman, and P. Vandergheynst, "Global and local uncertainty principles for signals on graphs," APSIPA Transactions on Signal and Information Processing, vol. 7, 2018, pp. 1-26.
3 Y. Kim, "Fast sampling set selection algorithm for arbitrary graph signals," J. of the Korea Institute of Electronic Communication Sciences, vol. 15, no. 6, Dec. 2020, pp. 1023-1030.   DOI
4 A. Sakiyama, Y. Tanaka, T. Tanaka, and A. Ortega, "Eigendecompostion-free sampling set selection for graph signals," IEEE Transactions on Signal Processing, vol. 67, no. 10, 2019, pp. 2679-2692.   DOI
5 N. Perraudin, J. Paratte, D. Shuman, L. Martin, V. Kalofolias, P. Vandergheynst, and D. K. Hammond, "GSPBOX: A toolbox for signal processing on graphs," Information Theory, 2014.
6 D. Shuman, S. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, "The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains," IEEE Signal Processing Magazine, vol. 30, no. 3, 2013, pp. 83-98.   DOI
7 A. Ortega, P. Frossard, J. Kovaevic, J. M. F. Moura, and P. Vandergheynst, "Graph signal processing: overview, challenges and applications," Proceedings of the IEEE, vol. 106, no. 5, 2018, pp. 808-828.   DOI
8 S. Chen, R. Varma, A. Sandryhaila, and J. Kovaevic, "Discrete signal processing on graphs: sampling theory," IEEE Transactions on Signal Processing, vol. 63, no. 24, 2015, pp. 6510-6523.   DOI
9 F. Wang, G. Cheung, and Y. Wang, "Low-complexity graph sampling with noise and signal reconstruction via Neumann series," IEEE Transactions on Signal Processing, vol. 67, no. 21, 2019, pp. 5511-5526.   DOI
10 Y. Kim, "QR factorization-based sampling set selection for bandlimited graph signals," Signal Processing, vol. 179, 2021, pp. 1-10.
11 A. Anis, A. Gadde, and A. Ortega, "Efficient sampling set selection for bandlimited graph signals using graph spectral proxies," IEEE Transactions on Signal Processing, vol. 64, no. 14, 2016, pp. 3775-3789.   DOI