The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
Open accessAbstract
We study the problem of selecting the best sampling set for bandlimited reconstruction of signals on graphs. A frequency domain representation for graph signals can be defined using the eigenvectors and eigenvalues of variation operators that take into account the underlying graph connectivity. Smoothly varying signals defined on the nodes are of particular interest in various applications, and tend to be approximately bandlimited in the frequency basis. Sampling theory for graph signals deals with the problem of choosing the best subset of nodes for reconstructing a bandlimited signal from its samples. Most approaches to this problem require a computation of the frequency basis (i.e., the eigenvectors of the variation operator), followed by a search procedure using the basis elements. This can be impractical, in terms of storage and time complexity, for real datasets involving very large graphs. We circumvent this issue in our formulation by introducing quantities called graph spectral proxies, defined using the powers of the variation operator, in order to approximate the spectral content of graph signals. This allows us to formulate a direct sampling set selection approach that does not require the computation and storage of the basis elements. We show that our approach also provides stable reconstruction when the samples are noisy or when the original signal is only approximately bandlimited. Furthermore, the proposed approach is valid for any choice of the variation operator, thereby covering a wide range of graphs and applications. We demonstrate its effectiveness through various numerical experiments.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Horn, R. A., & Johnson, C. R. (2012) · doi:10.1017/cbo9781139020411 · Cited by 4,642
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
Self-citationNumerical Methods for Large Eigenvalue Problems: Revised Edition
Saad, Y. (2011) · doi:10.1137/1.9781611970739 · Cited by 2,364
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 · cited 3×
“t;i ju j+ P u=2S u1 u, where 1 u is SUBMITTED TO IEEE TRANSACTIONS ON SIGNAL PROCESSING 10 TABLE III: Comparison of complexity of different sampling set selection algorithms. Method in [11] Method in [12] Proposed Method Eigen-pair computations O((jEjjSj+ CjSj3)T 1) O((jEjjSj+ CjSj3)T 1) O(kjEjjSjT 2) Sampling set sea…”
InfluentialSensor Selection via Convex Optimization
Joshi, S., & Boyd, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007095 · Cited by 1,311
Collective dynamics of 'small-world' networks
Watts, D. J., & Strogatz, S. H. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.301 · Cited by 988
Discrete Signal Processing on Graphs: Frequency Analysis
Sandryhaila, A., & Moura, J. M. F. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2321121 · Cited by 879
Sandryhaila, A., & Moura, J. M. F. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2329213 · Cited by 779
Knyazev, A. V. (2001) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827500366124 · Cited by 778
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
Laplacians and the Cheeger Inequality for Directed Graphs
Chung, F. (2005) · Annals of Combinatorics · doi:10.1007/s00026-005-0237-z · Cited by 535
Interlacing eigenvalues and graphs
Haemers, W. H. (1995) · Linear Algebra and its Applications · doi:10.1016/0024-3795(95)00199-2 · Cited by 466
Learning from labeled and unlabeled data on a directed graph
Zhou, D., Huang, J., & Schölkopf, B. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102482 · Cited by 403
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
Self-citationSignals on Graphs: Uncertainty Principle and Sampling
Tsitsvero, M., Barbarossa, S., & Di Lorenzo, P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2573748 · Cited by 329
Sampling of Graph Signals With Successive Local Aggregations
Marques, A. G., Segarra, S., Leus, G., & Ribeiro, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2507546 · Cited by 287
Sampling in Paley-Wiener spaces on combinatorial graphs
Pesenson, I. (2008) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-08-04511-x · Cited by 244
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
Self-citationCompact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
Narang, S. K., & Ortega, A. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2273197 · Cited by 217
Self-citationTowards a sampling theorem for signals on arbitrary graphs
Anis, A., Gadde, A., & Ortega, A. (2014) · 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2014.6854325 · Cited by 204
Self-citationSemi-supervised Learning on Directed Graphs
Zhou, D., Hofmann, T., & Schölkopf, B. (2004) · Max Planck Institute for Plasma Physics · Cited by 198
Sampling with Arbitrary Sampling and Reconstruction Spaces and Oblique Dual Frame Vectors
Eldar, Y. C. (2003) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-003-0004-2 · Cited by 194
Random sampling of bandlimited signals on graphs
Puy, G., Tremblay, N., Gribonval, R., & Vandergheynst, P. (2018) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2016.05.005 · Cited by 173
Local-Set-Based Graph Signal Reconstruction
Wang, X., Liu, P., & Gu, Y. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2411217 · Cited by 163
Active semi-supervised learning using sampling theory for graph signals
Gadde, A., Anis, A., & Ortega, A. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623760 · Cited by 130
Self-citationLocalized iterative methods for interpolation in graph structured data
Narang, S. K., Gadde, A., Sanou, E., & Ortega, A. (2013) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2013.6736922 · Cited by 120
Self-citationA discrete theory of irregular sampling
Gröchenig, K. (1993) · Linear Algebra and its Applications · doi:10.1016/0024-3795(93)90275-s · Cited by 96
Variational Splines and Paley–Wiener Spaces on Combinatorial Graphs
Pesenson, I. Z. (2008) · Constructive Approximation · doi:10.1007/s00365-007-9004-9 · Cited by 93
Bilateral filter: Graph spectral interpretation and extensions
Gadde, A., Narang, S. K., & Ortega, A. (2013) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2013.6738252 · Cited by 79
Self-citationDownsampling of Signals on Graphs Via Maximum Spanning Trees
Nguyen, H. Q., & Do, M. N. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2369013 · Cited by 72
Local two-channel critically sampled filter-banks on graphs
Narang, S. K., & Ortega, A. (2010) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2010.5651072 · Cited by 46
Self-citationGraph-wavelet filterbanks for edge-aware image processing
Narang, S. K., Chao, Y., & Ortega, A. (2012) · doi:10.1109/ssp.2012.6319643 · Cited by 42
Self-citationSampling theory for graph signals
Chen, S., Sandryhaila, A., & Kovačević, J. (2015) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2015.7178600 · Cited by 40
Uncertainty principle and sampling of signals defined on graphs
Tsitsvero, M., Barbarossa, S., & Lorenzo, P. D. (2015) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2015.7421465 · Cited by 14
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-citationGraph Learning From Data Under Laplacian and Structural Constraints
Egilmez, H. E., Pavez, E., & Ortega, A. (2017) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2017.2726975 · Cited by 364
Self-citationConvolutional 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
- Anis, A., Gadde, A., & Ortega, A.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2016-07-15
- Volume
- 64
- Issue
- 14
- Pages
- 3775-3789
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2195972617
- Cited by
- 336
- References
- 41
- FWCI
- 37.35
- 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
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.