The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Discrete Signal Processing on Graphs: Frequency Analysis
Abstract
Signals and datasets that arise in physical and engineering applications, as well as social, genetics, biomolecular, and many other domains, are becoming increasingly larger and more complex. In contrast to traditional time and image signals, data in these domains are supported by arbitrary graphs. Signal processing on graphs extends concepts and techniques from traditional signal processing to data indexed by generic graphs. This paper studies the concepts of low and high frequencies on graphs, and low-, high- and band-pass graph signals and graph filters. In traditional signal processing, these concepts are easily defined because of a natural frequency ordering that has a physical interpretation. For signals residing on graphs, in general, there is no obvious frequency ordering. We propose a definition of total variation for graph signals that naturally leads to a frequency ordering on graphs and defines low-, high-, and band-pass graph signals and filters. We study the design of graph filters with specified frequency response, and illustrate our approach with applications to sensor malfunction detection and data classification.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
A Wavelet Tour of Signal Processing
(1999) · Elsevier eBooks · doi:10.1016/b978-0-12-466606-1.x5000-4 · Cited by 16,227
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Probability, Random Variables, and Stochastic Processes
Miller, I. (1966) · Technometrics · doi:10.1080/00401706.1966.10490365 · Cited by 8,452
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Discrete-time Signal Processing
Williamson, D. (1999) · Advanced Textbooks in Control and Signal Processing · doi:10.1007/978-1-4471-0541-1 · Cited by 4,858
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
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · MPG.PuRe (Max Planck Society) · Cited by 3,864
Abe, S. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0285-4 · Cited by 3,721
Jackson, M. O. (2008) · Princeton University Press eBooks · doi:10.1515/9781400833993 · Cited by 2,666
The political blogosphere and the 2004 U.S. election: divided they blog
Adamic, L. A., & Glance, N. (2005) · Proceedings of the 3rd international workshop on Link discovery · doi:10.1145/1134271.1134277 · Cited by 2,619
Networks, Crowds, and Markets: Reasoning about a Highly Connected World
Easley, D., & Kleinberg, J. (2010) · doi:10.1017/cbo9780511761942 · Cited by 2,590
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
Coauthorship networks and patterns of scientific collaboration
Newman, M. E. J. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307545100 · Cited by 1,931
A Wavelet Tour of Signal Processing
(2009) · Elsevier eBooks · doi:10.1016/b978-0-12-374370-1.x0001-8 · Cited by 1,886
Coifman, R. R., Lafon, S., Lee, A. B., Maggioni, M., Nadler, B., Warner, F., & Zucker, S. W. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0500334102 · Cited by 1,675
Handbook of Image and Video Processing
(2005) · Elsevier eBooks · doi:10.1016/b978-0-12-119792-6.x5062-1 · Cited by 1,578
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 · cited 9×
“In [9], [10], [11] we take a different route.”
BackgroundMethodInfluentialSelf-citationNetworks, Crowds, and Markets: Network Dynamics: Structural Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
Networks, Crowds, and Markets: Network Dynamics: Population Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
An Introduction to the Approximation of Functions
Jerome, J. (1970) · Technometrics · doi:10.1080/00401706.1970.10488686 · Cited by 738
Regularization and Semi-supervised Learning on Large Graphs
Belkin, M., Matveeva, I., & Niyogi, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27819-1_43 · Cited by 536
Coifman, R. R., & Maggioni, M. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.04.004 · Cited by 491
Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
Narang, S. K., & Ortega, A. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2188718 · Cited by 387
Adaptive total variation image deblurring: A majorization–minimization approach
Oliveira, J. P., Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2009) · Signal Processing · doi:10.1016/j.sigpro.2009.03.018 · Cited by 364
Label propagation through linear neighborhoods
Wang, F., & Zhang, C. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143968 · Cited by 258
Discrete signal processing on graphs: Graph fourier transform
Sandryhaila, A., & Moura, J. M. F. (2013) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2013.6638850 · Cited by 175
Self-citationAlgebraic Signal Processing Theory: Foundation and 1-D Time
Puschel, M., & Moura, J. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.925261 · Cited by 173
Self-citationA Spectral Graph Uncertainty Principle
Agaskar, A., & Lu, Y. M. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2252233 · Cited by 167
Approximating signals supported on graphs
Zhu, X., & Rabbat, M. (2012) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2012.6288775 · Cited by 149
Tikhonov regularization and semi-supervised learning on large graphs
Belkin, M., Matveeva, I. V., & Niyogi, P. (2004) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2004.1326716 · Cited by 139
Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs
Voronenko, Y., & Püschel, M. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2006152 · Cited by 134
Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
Püschel, M., & Moura, J. M. F. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.907919 · Cited by 122
Self-citationTotal variation denoising with overlapping group sparsity
Selesnick, I., & Chen, P.-Y. (2013) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2013.6638755 · Cited by 112
Algebraic Signal Processing Theory: 1-D Space
Püschel, M., & Moura, J. M. F. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.925259 · Cited by 111
Self-citationThe Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
Püschel, M., & Moura, J. M. F. (2003) · SIAM Journal on Computing · doi:10.1137/s009753970139272x · Cited by 110
Self-citationDiscrete signal processing on graphs: Graph filters
Sandryhaila, A., & Moura, J. M. F. (2013) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2013.6638849 · Cited by 88
Self-citationCirculant structures and graph signal processing
Ekambaram, V. N., Fanti, G. C., Ayazifar, B., & Ramchandran, K. (2013) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2013.6738172 · Cited by 42
Algebraic Signal Processing Theory: 1-D Nearest Neighbor Models
Sandryhaila, A., Kovačević, J., & Püschel, M. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2186133 · Cited by 36
Self-citationAlgebraic Signal Processing Theory: 2-D Spatial Hexagonal Lattice
Püschel, M., & Rötteler, M. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.896626 · Cited by 36
Multiresolution graph signal processing via circulant structures
Ekambaram, V. N., Fanti, G. C., Ayazifar, B., & Ramchandran, K. (2013) · IEEE Digital Signal Processing Workshop and IEEE Signal Processing Education Workshop (DSP/SPE) · doi:10.1109/dsp-spe.2013.6642575 · Cited by 27
Sandryhaila, A., Kovačević, J., & Püschel, M. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100805777 · Cited by 17
Self-citation
Cited by
Graph Signal Processing: Overview, Challenges, and Applications
Ortega, A., Frossard, P., Kovačević, J., Moura, J. M. F., & Vandergheynst, P. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2820126 · Cited by 1,787
Self-citationSandryhaila, A., & Moura, J. M. F. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2329213 · Cited by 779
Self-citationCayleyNets: 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
Discrete Signal Processing on Graphs: Sampling Theory
Chen, S., Varma, R., Sandryhaila, A., & Kovacevic, J. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2469645 · Cited by 666
Self-citationConnecting the Dots: Identifying Network Structure via Graph Signal Processing
Mateos, G., Segarra, S., Marques, A. G., & Ribeiro, A. (2019) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2890143 · Cited by 369
Metadata
- Authors
- Sandryhaila, A., & Moura, J. M. F.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2014-06
- Volume
- 62
- Issue
- 12
- Pages
- 3042-3054
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W1698699930
- Cited by
- 879
- References
- 48
- FWCI
- 62.72
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.