Advertisement

Accelerated Matrix Inversion Approximation-Based Graph Signal Reconstruction

  • Qian Dang
  • Yongchao WangEmail author
  • Fen Wang
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 262)

Abstract

Graph signal processing (GSP) is an emerging field which studies signals lived on graphs, like collected signals in a sensor network. One important research point in this area is graph signal reconstruction, i.e., recovering the original graph signal from its partial collections. Matrix inverse approximation (MIA)-based reconstruction has been proven more robust to large noise than the conventional least square recovery. However, this strategy requires the K-th eigenvalue of Laplacian operator \(\varvec{\mathcal {L}}\). In this paper, we propose an efficient strategy for approximating the K-th eigenvalue in this GSP filed. After that, the MIA reconstruction method is modified by this proposed substitution, and thereby accelerated. Consequently, we apply this modified strategy into artificial graph signal recovery and real-world semi-supervised learning field. Experimental results demonstrate that the proposed strategy outperforms some existed graph reconstruction methods and is comparable to the MIA reconstruction with lower numerical complexity.

Keywords

Graph signal processing Graph reconstruction Semi-supervised learning 

References

  1. 1.
    Shuman, D., Narang, S., Frossard, P., Ortega, A., Vandergheynst, P.: The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Process. Mag. 30(3), 83–98 (2013)CrossRefGoogle Scholar
  2. 2.
    Sandryhaila, A., Moura, J.: Big data analysis with signal processing on graphs: representation and processing of massive data sets with irregular structure. IEEE Signal Process. Mag. 31(5), 80–90 (2014)CrossRefGoogle Scholar
  3. 3.
    Sakiyama, A., Tanaka, Y., Tanaka, T., Ortega, A.: Efficient sensor position selection using graph signal sampling theory. In: Acoustics, Speech and Signal Processing, pp. 6225–6229 (2016)Google Scholar
  4. 4.
    Gadde, A., Anis, A., Ortega, A.: Active semi-supervised learning using sampling theory for graph signals. In: Proceedings of 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 492–501 (2014)Google Scholar
  5. 5.
    Chen, S., Sandryhaila, A., Moura, J., et al.: Adaptive graph filtering: multiresolution classification on graphs. In: Proceedings of 2013 IEEE Global Conference on Signal and Information Processing (Global SIP), pp. 427–430. IEEE (2013)Google Scholar
  6. 6.
    Chen, S., Sandryhaila, A., Kovačević, J.: Sampling theory for graph signals. In: 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2015)Google Scholar
  7. 7.
    Pesenson, I.: Sampling in paley-wiener spaces on combinatorial graphs. Trans. Am. Math. Soc. 360(10), 5603–5627 (2008)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Anis, A., Gadde, A., Ortega, A.: Towards a sampling theorem for signals on arbitrary graphs. In: 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3864–3868 (2014)Google Scholar
  9. 9.
    Narang, S.K., Gadde, A., Ortega, A.: Signal processing techniques for interpolation in graph structured data. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2013)Google Scholar
  10. 10.
    Narang, S.K., Gadde, A., Sanou, E., et al.: Localized iterative methods for interpolation in graph structured data. In: Global Conference on Signal and Information Processing (GlobalSIP), pp. 491–494. IEEE (2013)Google Scholar
  11. 11.
    Wang, X., Liu, P., Gu, Y.: Local-set-based graph signal reconstruction. IEEE Trans. Signal Process. 63(9), 2432–2444 (2015)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Wang, F., Wang, Y., Cheung, G.: A-optimal sampling and robust reconstruction for graph signals via truncated neumann series. IEEE Signal Process. Lett. 25(5), 680–684 (2018)CrossRefGoogle Scholar
  13. 13.
    Chen, S., Sandryhaila, A., Moura, J., Kovačević, J.: Signal recovery on graphs: variation minimization. IEEE Trans. Signal Process. 63(17), 4609–4624 (2015)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Anis, A., Gadde, A., Ortega, A.: Efficient sampling set selection for bandlimited graph signals using graph spectral proxies. IEEE Trans. Signal Process. 64(14), 3775–3789 (2016)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Pesenson, I.: Sampling in paley-wiener spaces on combinatorial graphs. Trans. Am. Math. Soc. 360(10), 5603–5627 (2008)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Chen, S., Sandryhaila, A., Kovačević, J.: In: (ICASSP) (ed.), pp. 3392–3396 (2015)Google Scholar
  17. 17.
    Chen, S., Varma, R., Sandryhaila, A., Kovačević, J.: Discrete signal processing on graphs: sampling theory. IEEE Trans. Signal Process. 63(24), 6510–6523 (2015)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Knyazev, A.: Toward the optimal preconditioned eigensolver: locally optimal block preconditioned conjugate gradient method. Siam J. Sci. Comput. 23(2), 517–541 (2001)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Shomorony, H., Avestimehr, A.S.: Sampling large data on graphs. In: 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) (2014)Google Scholar
  20. 20.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of small-worldnetworks. Nature 393(6684), 440–442 (1998)CrossRefGoogle Scholar
  21. 21.
    The Graph Signal Processing Toolbox. https://epfl-lts2.github.io/gspbox-html
  22. 22.
    USPS Handwritten Digits Data. https://cs.nyu.edu/~roweis/data.html

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2019

Authors and Affiliations

  1. 1.Collaborative Innovation Center of Information Sensing and Understanding, State Key Laboratory of ISNXidian UniversityXi’anChina

Personalised recommendations