The DOI matches its Crossref record.
The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
Abstract
The general theory of greedy approximation is well developed. Much less is known about how specific features of a dictionary can be used to our advantage. In this paper, we discuss incoherent dictionaries. We build a new greedy algorithm which is called the orthogonal super greedy algorithm (OSGA). We show that the rates of convergence of OSGA and the orthogonal matching pursuit (OMP) with respect to incoherent dictionaries are the same. Based on the analysis of the number of orthogonal projections and the number of iterations, we observed that OSGA is times simpler (more efficient) than OMP. Greedy approximation is also a fundamental tool for sparse signal recovery. The performance of orthogonal multimatching pursuit, a counterpart of OSGA in the compressed sensing setting, is also analyzed under restricted isometry property conditions.
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
Compressive sensing: From theory to applications, a survey
Qaisar, S., Bilal, R. M., Iqbal, W., Naureen, M., & Lee, S. (2013) · Journal of Communications and Networks · doi:10.1109/jcn.2013.000083 · Cited by 457
Zhou, N., Li, H., Wang, D., Pan, S., & Zhou, Z. (2015) · Optics Communications · doi:10.1016/j.optcom.2014.12.084 · Cited by 270
Chai, X., Fu, X., Gan, Z., Zhang, Y., Lu, Y., & Chen, Y. (2020) · Neural Computing and Applications · doi:10.1007/s00521-018-3913-3 · Cited by 127
Metadata
- Authors
- Liu, E., & Temlyakov, V. N.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2012-04
- Volume
- 58
- Issue
- 4
- Pages
- 2040-2047
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1974198688
- Cited by
- 234
- References
- 0
- FWCI
- 19.03
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing. https://app.cochat.ai/papers/10.1109/tit.2011.2177632
- The paper
- Liu, E., & Temlyakov, V. N. (2012). The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2011.2177632
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.