The DOI matches its Crossref record.
Compressive sampling
Abstract
Conventional wisdom and common practice in acquisition and reconstruction of images from frequency data follow the basic principle of the Nyquist density sampling theory. This principle states that to reconstruct an image, the number of Fourier samples we need to acquire must match the desired resolution of the image, i.e. the number of pixels in the image. This paper surveys an emerging theory which goes by the name of “compressive sampling” or “compressed sensing,” and which says that this conventional wisdom is inaccurate. Perhaps surprisingly, it is possible to reconstruct images or signals of scientific interest accurately and sometimes even exactly from a number of samples which is far smaller than the desired resolution of the image/signal, e.g. the number of pixels in the image. It is believed that compressive sampling has far reaching implications. For example, it suggests the possibility of new data acquisition protocols that translate analog information into digital form with fewer sensors than what was considered necessary. This new sampling theory may come to underlie procedures for sampling and compressing data simultaneously. In this short survey, we provide some of the key mathematical insights underlying this new theory, and explain some of the interactions between compressive sampling and other fields such as statistics, information theory, coding theory, and theoretical computer science.
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
Cited by
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
Off-Grid Direction of Arrival Estimation Using Sparse Bayesian Inference
Yang, Z., Xie, L., & Zhang, C. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222378 · Cited by 968
Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
Needell, D., & Vershynin, R. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-008-9031-3 · Cited by 952
Task-Driven Dictionary Learning
Mairal, J., Bach, F., & Ponce, J. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.156 · Cited by 823
hp-VPINNs: Variational physics-informed neural networks with domain decomposition
Kharazmi, E., Zhang, Z., & Karniadakis, G. E. M. (2021) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2020.113547 · Cited by 818
Closed-Loop Turbulence Control: Progress and Challenges
Brunton, S. L., & Noack, B. R. (2015) · Applied Mechanics Reviews · doi:10.1115/1.4031175 · Cited by 623
Machine learning in acoustics: Theory and applications
Bianco, M. J., Gerstoft, P., Traer, J., Ozanich, E., Roch, M. A., Gannot, S., & Deledalle, C.-A. (2019) · The Journal of the Acoustical Society of America · doi:10.1121/1.5133944 · Cited by 609
Duarte-Carvajalino, J. M., & Sapiro, G. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2022459 · Cited by 571
Graph Regularized Sparse Coding for Image Representation
Zheng, M., Bu, J., Chen, C., Wang, C., Zhang, L., Qiu, G., & Cai, D. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2090535 · Cited by 562
(2018) · IEEE Control Systems · doi:10.1109/mcs.2018.2810460 · Cited by 518
The State of the Art of Data Science and Engineering in Structural Health Monitoring
Bao, Y., Chen, Z., Wei, S., Xu, Y., Tang, Z., & Li, H. (2019) · Engineering · doi:10.1016/j.eng.2018.11.027 · Cited by 483
An Overview of Low-Rank Matrix Recovery From Incomplete Observations
Davenport, M. A., & Romberg, J. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2539100 · Cited by 439
A Sparse Image Fusion Algorithm With Application to Pan-Sharpening
Zhu, X. X., & Bamler, R. (2013) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2012.2213604 · Cited by 438
Duarte, M. F., & Baraniuk, R. G. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.08.003 · Cited by 428
van Diessen, E., Numan, T., van Dellen, E., van der Kooi, A. W., Boersma, M., Hofman, D., van Lutterveld, R., van Dijk, B. W., van Straaten, E. C. W., Hillebrand, A., et al. (2015) · Clinical Neurophysiology · doi:10.1016/j.clinph.2014.11.018 · Cited by 417
Statistical learning and selective inference
Taylor, J., & Tibshirani, R. J. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1507583112 · Cited by 398
IoT Connectivity Technologies and Applications: A Survey
Ding, J., Nemati, M., Ranaweera, C., & Choi, J. (2020) · IEEE Access · doi:10.1109/access.2020.2985932 · Cited by 374
Deep learning for real-time single-pixel video
Higham, C. F., Murray-Smith, R., Padgett, M. J., & Edgar, M. P. (2018) · Scientific Reports · doi:10.1038/s41598-018-20521-y · Cited by 318
End-to-End Variational Networks for Accelerated MRI Reconstruction
Sriram, A., Zbontar, J., Murrell, T., Defazio, A., Zitnick, C. L., Yakubova, N., Knoll, F., & Johnson, P. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-59713-9_7 · Cited by 301
Sparse Representation for Wireless Communications: A Compressive Sensing Approach
Qin, Z., Fan, J., Liu, Y., Gao, Y., & Li, G. Y. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2789521 · Cited by 247
Internet of multimedia things: Vision and challenges
Alvi, S. A., Afzal, B., Shah, G. A., Atzori, L., & Mahmood, W. (2015) · Ad Hoc Networks · doi:10.1016/j.adhoc.2015.04.006 · Cited by 241
Structural damage detection based on l 1 regularization using natural frequencies and mode shapes
Hou, R., Xia, Y., & Zhou, X. (2018) · Structural Control and Health Monitoring · doi:10.1002/stc.2107 · Cited by 127
Damage Identification Scheme Based on Compressive Sensing
Wang, Y., & Hao, H. (2015) · Journal of Computing in Civil Engineering · doi:10.1061/(asce)cp.1943-5487.0000324 · Cited by 77
Emerging data technology in structural health monitoring: compressive sensing technology
Bao, Y., Li, H., & Ou, J. (2014) · Journal of Civil Structural Health Monitoring · doi:10.1007/s13349-013-0064-1 · Cited by 43
Metadata
- Authors
- Candès, E. J.
- Venue
- Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006
- Publisher
- EMS Press
- Published
- 2007-05-15
- Pages
- 1433-1452
- OpenAlex
- W4238744307
- Cited by
- 612
- References
- 0
- FWCI
- 25.27
- Type
- book chapter
- 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.