Autoregressive Moving Average Graph Filtering

Preprint English OPEN
Isufi, Elvin ; Loukas, Andreas ; Simonetto, Andrea ; Leus, Geert (2016)
  • Related identifiers: doi: 10.1109/TSP.2016.2614793
  • Subject: Statistics - Machine Learning | Computer Science - Systems and Control | Computer Science - Learning
    acm: MathematicsofComputing_DISCRETEMATHEMATICS

One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design philosophy, which allows us to design the ARMA coefficients independently from the underlying graph, renders the ARMA graph filters suitable in static and, particularly, time-varying settings. The latter occur when the graph signal and/or graph are changing over time. We show that in case of a time-varying graph signal our approach extends naturally to a two-dimensional filter, operating concurrently in the graph and regular time domains. We also derive sufficient conditions for filter stability when the graph and signal are time-varying. The analytical and numerical results presented in this paper illustrate that ARMA graph filters are practically appealing for static and time-varying settings, as predicted by theoretical derivations.
  • References (27)
    27 references, page 1 of 3

    [1] A. Loukas, A. Simonetto, and G. Leus, “Distributed Autoregressive Moving Average Graph Filters,” Signal Processing Letters, vol. 22, no. 11, pp. 1931-1935, 2015.

    [2] D. I. Shuman, S. K. 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, pp. 83-98, 2013.

    [3] A. Sandryhaila and J. M. F. Moura, “Discrete Signal Processing on Graphs,” Transactions on Signal Processing, vol. 61, no. 7, pp. 1644- 1656, 2013.

    [4] M. G. Rabbat and V. Gripon, “Towards a Spectral Characterization of Signal Supported on Small-World Networks,” in Proceedings of the 2014 IEEE International Conference on Acoustic, Speech and Signal Processing (ICASSP), Firenze, Italy, May 2014, pp. 4826 - 4830.

    [5] F. Zhang and E. R. Hancock, “Graph spectral image smoothing using the heat kernel,” Pattern Recognition, vol. 41, no. 11, pp. 3328-3342, 2008.

    [6] D. I. Shuman, P. Vandergheynst, and P. Frossard, “Chebyshev polynomial approximation for distributed signal processing,” in International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS). IEEE, 2011, pp. 1-8.

    [7] A. J. Smola and R. Kondor, “Kernels and regularization on graphs,” in Learning theory and kernel machines. Springer, 2003, pp. 144-158.

    [8] X. Zhu, Z. Ghahramani, and J. Lafferty, “Semi-supervised learning using gaussian fields and harmonic functions,” in Proceedings of the 20th International Conference on Machine Learning (ICML-2003) Volume 2, vol. 2. AIAA Press, 2003, pp. 912-919.

    [9] M. Belkin and P. Niyogi, “Semi-supervised learning on riemannian manifolds,” Machine learning, vol. 56, no. 1-3, pp. 209-239, 2004.

    [10] S. K. Narang, A. Gadde, and A. Ortega, “Signal processing techniques for interpolation in graph structured data,” in Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on. IEEE, 2013, pp. 5445-5449.

  • Metrics
    No metrics available
Share - Bookmark