The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Signals on Graphs: Uncertainty Principle and Sampling
Open accessAbstract
In many applications, the observations can be represented as a signal defined over the vertices of a graph. The analysis of such signals requires the extension of standard signal processing tools. In this paper, first, we provide a class of graph signals that are maximally concentrated on the graph domain and on its dual. Then, building on this framework, we derive an uncertainty principle for graph signals and illustrate the conditions for the recovery of band-limited signals from a subset of samples. We show an interesting link between uncertainty principle and sampling and propose alternative signal recovery algorithms, including a generalization to frame-based reconstruction methods. After showing that the performance of signal recovery algorithms is significantly affected by the location of samples, we suggest and compare a few alternative sampling strategies. Finally, we provide the conditions for perfect recovery of a useful signal corrupted by sparse noise, showing that this problem is also intrinsically related to vertex-frequency localization properties.
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
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
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
(2011) · Choice Reviews Online · doi:10.5860/choice.48-3328 · Cited by 2,736
A Mathematical Introduction to Compressive Sensing
Foucart, S., & Rauhut, H. (2013) · Applied and Numerical Harmonic Analysis · doi:10.1007/978-0-8176-4948-7 · Cited by 2,548
Prolate Spheroidal Wave Functions, Fourier Analysis and Uncertainty - I
Slepian, D., & Pollak, H. O. (1961) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1961.tb03976.x · Cited by 2,492 · cited 3×
“The vectors {ψi} are the counterpart of the prolate spheroidal wave functions introduced by Slepian and Pollack for continuous-time signals [30].”
BackgroundMethodInfluentialA class of nonharmonic Fourier series
Duffin, R. J., & Schaeffer, A. C. (1952) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1952-0047179-6 · Cited by 2,277
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
Cited by
Convolutional Neural Network Architectures for Signals Supported on Graphs
Gama, F., Marques, A. G., Leus, G., & Ribeiro, A. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2887403 · Cited by 308
Global and local uncertainty principles for signals on graphs
Perraudin, N., Ricaud, B., Shuman, D. I., & Vandergheynst, P. (2018) · APSIPA Transactions on Signal and Information Processing · doi:10.1017/atsip.2018.2 · Cited by 58
Metadata
- Authors
- Tsitsvero, M., Barbarossa, S., & Di Lorenzo, P.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2016-09-15
- Volume
- 64
- Issue
- 18
- Pages
- 4845-4860
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2215668387
- Cited by
- 329
- References
- 43
- FWCI
- 80.05
- 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: Signals on Graphs: Uncertainty Principle and Sampling. https://app.cochat.ai/papers/10.1109/tsp.2016.2573748
- The paper
- Tsitsvero, M., Barbarossa, S., & Di Lorenzo, P. (2016). Signals on Graphs: Uncertainty Principle and Sampling. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2016.2573748
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.