The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Sampling of Graph Signals With Successive Local Aggregations
Open accessAbstract
A new scheme to sample signals defined on the nodes of a graph is proposed. The underlying assumption is that such signals admit a sparse representation in a frequency domain related to the structure of the graph, which is captured by the so-called graph-shift operator. Instead of using the value of the signal observed at a subset of nodes to recover the signal in the entire graph, the sampling scheme proposed here uses as input observations taken at a single node. The observations correspond to sequential applications of the graph-shift operator, which are linear combinations of the information gathered by the neighbors of the node. When the graph corresponds to a directed cycle (which is the support of time-varying signals), our method is equivalent to the classical sampling in the time domain. When the graph is more general, we show that the Vandermonde structure of the sampling matrix, critical when sampling time-varying signals, is preserved. Sampling and interpolation are analyzed first in the absence of noise, and then noise is considered. We then study the recovery of the sampled signal when the specific set of frequencies that is active is not known. Moreover, we present a more general sampling scheme, under which, either our aggregation approach or the alternative approach of sampling a graph signal by observing the value of the signal at a subset of nodes can be both viewed as particular cases. Numerical experiments illustrating the results in both synthetic and real-world graphs close the paper.
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
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Fundamentals of Statistical Signal Processing: Estimation Theory
Sengijpta, S. K. (1995) · Technometrics · doi:10.1080/00401706.1995.10484391 · Cited by 11,076
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Fundamentals of statistical signal processing: Estimation theory
Prasad, K. V. (1994) · Control Engineering Practice · doi:10.1016/0967-0661(94)90195-3 · Cited by 7,902
Bollobás, B. (1985) · Cited by 6,196
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
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
(1993) · Choice Reviews Online · doi:10.5860/choice.31-0986 · Cited by 1,540
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
Sampling-50 years after Shannon
Unser, M. (2000) · Proceedings of the IEEE · doi:10.1109/5.843002 · Cited by 1,358
Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
Cai, T. T., & Wang, L. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2146090 · Cited by 1,265
Fundamentals of Statistical Signal Processing: Estimation Theory
Sengupta, S. K., & Kay, S. M. (1995) · Technometrics · doi:10.2307/1269750 · Cited by 901
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
Optimized Projections for Compressed Sensing
Elad, M. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.900760 · Cited by 835
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
Borkowski, J. J., & Pukelsheim, F. (1994) · Technometrics · doi:10.2307/1270234 · Cited by 301
Signal Recovery on Graphs: Variation Minimization
Chen, S., Sandryhaila, A., Moura, J. M. F., & Kovacevic, J. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2441042 · Cited by 294
Towards 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
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
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
Alexeev, B., Cahill, J., & Mixon, D. G. (2012) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-012-9235-4 · Cited by 138
Reconstruction of Graph Signals Through Percolation from Seeding Nodes
Segarra, S., Marques, A. G., Leus, G. J. T., & Ribeiro, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2552510 · Cited by 97
Self-citationGraph spectral compressed sensing for sensor networks
Zhu, X., & Rabbat, M. (2012) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2012.6288515 · Cited by 55
Interpolation of graph signals using shift-invariant graph filters
Segarra, S., Marques, A. G., Leus, G. J. T., & Ribeiro, A. (2015) · European Signal Processing Conference (EUSIPCO) · doi:10.1109/eusipco.2015.7362375 · Cited by 36
Self-citationDistributed Linear Network Operators using Graph FiltersPreprint
Segarra, S., Marques, A. G., & Ribeiro, A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.03947 · Cited by 21
Self-citationSignal Recovery on GraphsPreprint
Chen, S., Sandryhaila, A., Moura, J. M. F., & Kovačević, J. (2014) · arXiv (Cornell University) · Cited by 14
Towards a spectral characterization of signals supported on small-world networks
Rabbat, M., & Gripon, V. (2014) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2014.6854512 · Cited by 14
Cited by
Xia, F., Sun, K., Yu, S., Aziz, A., Wan, L., Pan, S., & Liu, H. (2021) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2021.3076021 · Cited by 473
Kernel Mean Embedding of Distributions: A Review and Beyond
Muandet, K., Fukumizu, K., Sriperumbudur, B., & Schölkopf, B. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000060 · Cited by 409
Connecting 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
Self-citationEfficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
Anis, A., Gadde, A., & Ortega, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2546233 · Cited by 336
Signals 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
Metadata
- Authors
- Marques, A. G., Segarra, S., Leus, G., & Ribeiro, A.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2016-04
- Volume
- 64
- Issue
- 7
- Pages
- 1832-1843
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W1690143098
- Cited by
- 287
- References
- 27
- FWCI
- 36.60
- 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.