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

The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

Tropp, Joel A., Gilbert, Anna C. · 2007 · IEEE Transactions on Information Theory

Abstract

This paper demonstrates theoretically and empirically that a greedy algorithm called Orthogonal Matching Pursuit (OMP) can reliably recover a signal with$m$nonzero entries in dimension$d$given$ {\rm O}(m \ln d)$random linear measurements of that signal. This is a massive improvement over previous results, which require${\rm O}(m^{2})$measurements. The new results for OMP are comparable with recent results for another approach called Basis Pursuit (BP). In some settings, the OMP algorithm is faster and easier to implement, so it is an attractive alternative to BP for signal recovery problems.

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.

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

Integrity signals

Registry

Crossref · 10.1109/tit.2007.909108

Cites

42 of 42 references verified0 citation errors · 0 not checkable

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.

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

Cites

Research works printed but not linked: 8

  1. fernique, 1974, Ecole D'Et� de Probabilit�s de Saint-Flour IV, 480, 1
  2. 10.1109/ICASSP.2005.1416408 · DOI
  3. kim, 2007, ?A method for large-scale -regularized least-squares problems with applications in signal processing and statistics ?
  4. lugosi, 2005, Concentration of Measure Inequalities
  5. ball, 2002, Handbook of Banach Space Geometry, 161
  6. 10.1155/IMRN.2005.4019 · doi:10.1155/imrn.2005.4019
  7. 10.1007/s10208-007-9005-x · doi:10.1007/s10208-007-9005-x
  8. tropp, 2007, ?Signal recovery from random measurements via orthogonal matching pursuit The Gaussian case ?

Cited by

See all 9,653

Metadata

Authors
Tropp, J. A., & Gilbert, A. C.
Venue
IEEE Transactions on Information Theory
Published
2007-12
Volume
53
Issue
12
Pages
4655-4666
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2127271355
Cited by
9,653
References
42
FWCI
198.70
Type
journal article
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.