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.
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
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
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
(2018) · IEEE Control Systems · doi:10.1109/mcs.2018.2810460 · Cited by 518
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Compressive sampling. https://app.cochat.ai/papers/10.4171/022-3/69
- The paper
- Candès, E. J. (2007). Compressive sampling. Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006. https://doi.org/10.4171/022-3/69
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.