Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 2,075

The DOI matches its Crossref record.

Sparsity and incoherence in compressive sampling

Open access
Candès, Emmanuel, Romberg, Justin·2007·Inverse Problems

Abstract

We consider the problem of reconstructing a sparse signal from a limited number of linear measurements. Given m randomly selected samples of Ux 0 , where U is an orthonormal matrix, we show that ℓ 1 minimization recovers x 0 exactly when the number of measurements exceeds where S is the number of nonzero components in x 0 and μ is the largest entry in U properly normalized: . The smaller μ is, the fewer samples needed. The result holds for 'most' sparse signals x 0 supported on a fixed (but arbitrary) set T . Given T , if the sign of x 0 for each nonzero entry on T and the observed values of Ux 0 are drawn at random, the signal is recovered with overwhelming probability. Moreover, there is a sense in which this is nearly optimal since any method succeeding with the same probability would require just about as many samples.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/0266-5611/23/3/008

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 2,075

Metadata

Authors
Candès, E., & Romberg, J.
Venue
Inverse Problems
Published
2007-04-10
Volume
23
Issue
3
Pages
969-985
ISSN
  • 0266-5611 (ISSN-L)
  • 1361-6420
OpenAlex
W2109357213
Cited by
2,075
References
0
FWCI
83.01
Type
journal article
Language
en
Open access
bronze

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: Sparsity and incoherence in compressive sampling. https://app.cochat.ai/papers/10.1088/0266-5611/23/3/008
The paper
Candès, E., & Romberg, J. (2007). Sparsity and incoherence in compressive sampling. Inverse Problems. https://doi.org/10.1088/0266-5611/23/3/008

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.