The Journal of the Korea institute of electronic communication sciences (한국전자통신학회논문지)

Korea Institute of Electronic Communication Science (한국전자통신학회)
권호 표지
DOI QR코드

DOI QR Code

Efficient Sampling of Graph Signals with Reduced Complexity

저 복잡도를 갖는 효율적인 그래프 신호의 샘플링 알고리즘

  • Received : 2022.03.07
  • Accepted : 2022.04.17
  • Published : 2022.04.30
Download PDF
⟨ Previous Next ⟩

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.

그래프 노드상에서 발생하는 그래프 신호의 일부를 선택해서 만든 샘플링 신호로부터 원신호를 복원하기 위해, 복원오차를 최소화하기 위한 최적의 샘플링 집합을 선택하는 알고리즘에 관해 연구한다. 복잡도 개선을 위해 복원오차를 직접적으로 최소화하는 대신에, 복원오차의 상한값을 비용함수로 사용하고, QR분해 적용을 통해 발생하는 상삼각행렬의 대각선상에 위치하는 값으로 샘플링을 결정할 수 있게 하는, 저 복잡도를 갖는 반복적 탐욕알고리즘을 제안한다. 기존의 샘플링 선택 방법과 비교하여, 제안 알고리즘이 복원 성능 저하를 평균 5%미만으로 유지하면서, 약 3.5배 빠른 실행시간을 보임을 다양한 그래프 상황에서 실험을 통해 확인한다.

Keywords

Acknowledgement

이 논문은 2021학년도 조선대학교 학술연구비의 지원을 받아 연구되었음.

References

  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 Magazine, vol. 30, no. 3, 2013, pp. 83-98. https://doi.org/10.1109/MSP.2012.2235192
  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. https://doi.org/10.1109/jproc.2018.2820126
  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. 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. https://doi.org/10.1109/TSP.2016.2546233
  5. 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. https://doi.org/10.1109/TSP.2015.2469645
  6. 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.
  7. 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. https://doi.org/10.1109/tsp.2019.2908129
  8. 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. https://doi.org/10.1109/tsp.2019.2940129
  9. 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. https://doi.org/10.13067/JKIECS.2020.15.6.1023
  10. Y. Kim, "QR factorization-based sampling set selection for bandlimited graph signals," Signal Processing, vol. 179, 2021, pp. 1-10.
  11. 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.
  12. R. A. Horn and C. R. Johnson, Matrix Anlaysis. New York: Cambridge University Press, 1985.
  13. 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.