The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Autoregressive Moving Average Graph Filtering
Open accessAbstract
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 occur when the graph signal and/or graph topology 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 domain. We also derive the graph filter behavior, as well as 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2235192 · Cited by 4,421
Semi-supervised learning using Gaussian fields and harmonic functions
Zhu, X., Zoubin Ghahramani, A., & Lafferty, J. (2003) · Cited by 3,509
Wavelets on graphs via spectral graph theory
Hammond, D. K., Vandergheynst, P., & Gribonval, R. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.04.005 · Cited by 2,171
Discrete Signal Processing on Graphs
Sandryhaila, A., & Moura, J. M. F. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2238935 · Cited by 1,531
Kernels and Regularization on Graphs
Smola, A. J., & Kondor, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_12 · Cited by 841
Semi-Supervised Learning on Riemannian Manifolds
Belkin, M., & Niyogi, P. (2004) · Machine Learning · doi:10.1023/b:mach.0000033120.25363.1e · Cited by 781
Learning Laplacian Matrix in Smooth Graph Signal Representations
Dong, X., Thanou, D., Frossard, P., & Vandergheynst, P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2602809 · Cited by 640
Statistical Digital Signal Processing and Modeling
Gruber, M. H. J. (1997) · Technometrics · doi:10.1080/00401706.1997.10485128 · Cited by 489
Signal processing techniques for interpolation in graph structured data
Narang, S. K., Gadde, A., & Ortega, A. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6638704 · Cited by 229
Cited by
CayleyNets: Graph Convolutional Neural Networks With Complex Rational Spectral Filters
Levie, R., Monti, F., Bresson, X., & Bronstein, M. M. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2879624 · Cited by 685
Graph Neural Networks with Convolutional ARMA Filters
Bianchi, F. M., Grattarola, D., Livi, L., & Alippi, C. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3054830 · Cited by 426
Li, X., Yuan, C., & Wang, Z. (2020) · Energy · doi:10.1016/j.energy.2020.117852 · Cited by 321
Li, X., Wang, Z., & Yan, J. (2019) · Journal of Power Sources · doi:10.1016/j.jpowsour.2019.03.008 · Cited by 320
Metadata
- Authors
- Isufi, E., Loukas, A., Simonetto, A., & Leus, G.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2017-01-15
- Volume
- 65
- Issue
- 2
- Pages
- 274-288
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2521050763
- Cited by
- 264
- References
- 24
- FWCI
- 22.41
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Autoregressive Moving Average Graph Filtering. https://app.cochat.ai/papers/10.1109/tsp.2016.2614793
- The paper
- Isufi, E., Loukas, A., Simonetto, A., & Leus, G. (2017). Autoregressive Moving Average Graph Filtering. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2016.2614793
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.