publication . Article . Preprint . 2017

autoregressive moving average graph filtering

Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert;
Open Access
  • Published: 15 Jan 2017 Journal: IEEE Transactions on Signal Processing, volume 65, pages 274-288 (issn: 1053-587X, eissn: 1941-0476, Copyright policy)
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Abstract
One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogs of classical filters, but intended for signals defined on graphs. This paper brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which are able to approximate any desired graph frequency response, and give exact solutions for specific graph signal denoising and interpolation problems. The philosophy 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 occ...
Subjects
ACM Computing Classification System: MathematicsofComputing_DISCRETEMATHEMATICS
free text keywords: Signal Processing, Electrical and Electronic Engineering, Mathematics, Voltage graph, Integral graph, Null graph, Quartic graph, Strength of a graph, Graph bandwidth, Mathematical optimization, Graph power, Topological graph theory, Computer Science - Learning, Computer Science - Systems and Control, Statistics - Machine Learning
27 references, page 1 of 2

[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. [OpenAIRE]

[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. [OpenAIRE]

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

[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. [OpenAIRE]

[11] A. Loukas, M. A. Zu´n˜iga, I. Protonotarios, and J. Gao, “How to identify global trends from local decisions? Event Region Detection on Mobile Networks,” in International Conference on Computer Communications (INFOCOM), 2014.

[12] D. K. Hammond, P. Vandergheynst, and R. Gribonval, “Wavelets on graphs via spectral graph theory,” Applied and Computational Harmonic Analysis, vol. 30, no. 2, pp. 129-150, 2011. [OpenAIRE]

[13] X. Dong, D. Thanou, P. Frossard, and P. Vandergheynst, “Learning graphs from signal observations under smoothness prior,” arXiv preprint arXiv:1406.7842, 2014.

[14] A. Sandryhaila, S. Kar, and J. M. F. Moura, “Finite-time distributed consensus through graph filters,” in International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2014, pp. 1080-1084. [OpenAIRE]

[15] S. Safavi and U. A. Khan, “Revisiting Finite-Time Distributed Algorithms via Successive Nulling of Eigenvalues,” Signal Processing Letters, IEEE, vol. 22, no. 1, pp. 54-57, 2015.

27 references, page 1 of 2
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Article . Preprint . 2017

autoregressive moving average graph filtering

Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert;