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

Fast Sampling Set Selection Algorithm for Arbitrary Graph Signals  

Kim, Yoon-Hak (Dept. Electronic Engineering, Chosun University)
Publication Information
The Journal of the Korea institute of electronic communication sciences / v.15, no.6, 2020 , pp. 1023-1030 More about this Journal
Abstract
We address the sampling set selection problem for arbitrary graph signals such that the original graph signal is reconstructed from the signal values on the nodes in the sampling set. We introduce a variation difference as a new indirect metric that measures the error of signal variations caused by sampling process without resorting to the eigen-decomposition which requires a huge computational cost. Instead of directly minimizing the reconstruction error, we propose a simple and fast greedy selection algorithm that minimizes the variation differences at each iteration and justify the proposed reasoning by showing that the principle used in the proposed process is similar to that in the previous novel technique. We run experiments to show that the proposed method yields a competitive reconstruction performance with a substantially reduced complexity for various graphs as compared with the previous selection methods.
Keywords
Graph Signal Processing; Sampling Set Selection; Greedy Algorithm; Signal Variation; Signal Reconstruction;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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 Mag., vol. 30, no. 3, 2013, pp. 83-98.   DOI
2 A. Ortega, P. Frossard, J. Kovaevic, J. M. F. Moura, and P. Vandergheynst. "Graph signal processing: overview, challenges and applications," Proc. 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 Conf. on Acoustic, Speech, and Signal Processing (ICASSP), Florence, Italy, 2014, pp. 3864-3858.
4 A. Anis, A. Gadde, and A. Ortega. "Efficient sampling set selection for bandlimited graph signals using graph spectral proxies," IEEE Trans. on Signal Processing, vol. 64, no. 14, 2016, pp. 3775-3789.   DOI
5 S. Chen, R. Varma, A. Sandryhaila, and J. Kovaevic. "Discrete signal processing on graphs: sampling theory," IEEE Trans. on Signal Processing, vol. 63, no. 24, 2015, pp. 6510-6523.   DOI
6 S. P. Chepuri and G. Leus, "Graph Sampling for covariance estimation," IEEE Trans. on Signal and Information Processing over Networks, vol. 3, no. 3, 2017, pp. 451-466.   DOI
7 F. Wang, G. Cheung, and Y. Wang, "Low-complexity graph sampling with noise and signal reconstruction via Neumann series," IEEE Trans. On Signal Processing, vol. 67, no. 21, 2019, pp. 5511-5526.   DOI
8 L.F.O. Chamon and A. Ribeiro, "Greedy sampling of graph signals," IEEE Trans. on Signal Processing, vol. 66, no. 1, 2018, pp. 34-47.   DOI
9 N. Perraudin, B. Ricaud, D. Shuman, and P. Vandergheynst. "Global and local uncertainty principles for signals on graphs," APSIPA Trans. On Signal and Information Processing, vol. 7, e3, Apr., 2018, pp. 1-26.
10 A. Sakiyama, Y. Tanaka, T. Tanaka, and A. Ortega, "Eigendecompostionfree sampling set selection for graph signals," IEEE Trans. on Signal Processing, vol. 67, no. 10, 2019, pp. 2679-2692.   DOI
11 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 e-prints arXiv:1408.5781, Aug. 2014.