The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
Open accessAbstract
We consider the orthogonal matching pursuit (OMP) algorithm for the recovery of a high-dimensional sparse signal based on a small number of noisy linear measurements. OMP is an iterative greedy algorithm that selects at each step the column, which is most correlated with the current residuals. In this paper, we present a fully data driven OMP algorithm with explicit stopping rules. It is shown that under conditions on the mutual incoherence and the minimum magnitude of the nonzero components of the signal, the support of the signal can be recovered exactly by the OMP algorithm with high probability. In addition, we also consider the problem of identifying significant components in the case where some of the nonzero components are possibly small. It is shown that in this case the OMP algorithm will still select all the significant components before possibly selecting incorrect ones. Moreover, with modified stopping rules, the OMP algorithm can ensure that no zero components are selected.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Simultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
Stable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
Uncertainty principles and ideal atomic decomposition
Donoho, D. L., & Huo, X. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959265 · Cited by 1,949
The Dantzig selector: Statistical estimation when p is much larger than n
Candes, E., & Tao, T. (2007) · The Annals of Statistics · doi:10.1214/009053606000001523 · Cited by 1,747
Cited by
Hybrid MIMO Architectures for Millimeter Wave Communications: Phase Shifters or Switches?
Mendez-Rial, R., Rusu, C., Gonzalez-Prelcic, N., Alkhateeb, A., & Heath, R. W. (2016) · IEEE Access · doi:10.1109/access.2015.2514261 · Cited by 885
MIMO Radar for Advanced Driver-Assistance Systems and Autonomous Driving: Advantages and Challenges
Sun, S., Petropulu, A. P., & Poor, H. V. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2978507 · Cited by 632
Sampling of Graph Signals With Successive Local Aggregations
Marques, A. G., Segarra, S., Leus, G., & Ribeiro, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2507546 · Cited by 287
Compressed sensing based multi-user millimeter wave systems: How many measurements are needed?
Alkhateeb, A., Leus, G., & Heath, R. W. (2015) · 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2015.7178503 · Cited by 281
Varatharajan, R., Manogaran, G., Priyan, M. K., & Sundarasekar, R. (2018) · Cluster Computing · doi:10.1007/s10586-017-0977-2 · Cited by 277
Metadata
- Authors
- Cai, T. T., & Wang, L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-07
- Volume
- 57
- Issue
- 7
- Pages
- 4680-4688
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2140856955
- Cited by
- 1,265
- References
- 18
- FWCI
- 36.46
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise. https://app.cochat.ai/papers/10.1109/tit.2011.2146090
- The paper
- Cai, T. T., & Wang, L. (2011). Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2011.2146090
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.