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

Efficient Sampling of Graph Signals with Reduced Complexity  

Kim, Yoon Hak (Dept. Electronic Engineering, Chosun University)
Publication Information
The Journal of the Korea institute of electronic communication sciences / v.17, no.2, 2022 , pp. 367-374 More about this Journal
Abstract
A sampling set selection algorithm is proposed to reconstruct original graph signals from the sampled signals generated on the nodes in the sampling set. Instead of directly minimizing the reconstruction error, we focus on minimizing the upper bound on the reconstruction error to reduce the algorithm complexity. The metric is manipulated by using QR factorization to produce the upper triangular matrix and the analytic result is presented to enable a greedy selection of the next nodes at iterations by using the diagonal entries of the upper triangular matrix, leading to an efficient sampling process with reduced complexity. We run experiments for various graphs to demonstrate a competitive reconstruction performance of the proposed algorithm while offering the execution time about 3.5 times faster than one of the previous selection methods.
Keywords
Graph Signal Processing; Sampling Set Selection; Greedy Algorithm; QR Factorization;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 N. Perraudin, J. Paratte, D. Shuman, L. Martin, V. Kalofolias, P. Vandergheynst, and D. K. Hammond, "GSPBOX: A toolbox for signal processing on graphs," arXiv:1408.5781, 2014.
2 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
3 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.
4 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
5 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.
6 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
7 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
8 R. A. Horn and C. R. Johnson, Matrix Anlaysis. New York: Cambridge University Press, 1985.
9 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
10 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
11 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
12 Y. Kim, "QR factorization-based sampling set selection for bandlimited graph signals," Signal Processing, vol. 179, 2021, pp. 1-10.
13 Y. Kim, "Sampling set selection algorithm for weighted graph signals," J. of the Korea Institute of Electronic Communication Sciences, vol. 17, no. 1, Feb. 2022, pp. 1023-1030.