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

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

A Plurality of Sparse Representations Is Better Than the Sparsest One Alone

Elad, Michael, Yavneh, Irad · 2009 · IEEE Transactions on Information Theory

Abstract

Cleaning of noise from signals is a classical and long-studied problem in signal processing. Algorithms for this task necessarily rely on ana prioriknowledge about the signal characteristics, along with information about the noise properties. For signals that admit sparse representations over a known dictionary, a commonly used denoising technique is to seek the sparsest representation that synthesizes a signal close enough to the corrupted one. As this problem is too complex in general, approximation methods, such as greedy pursuit algorithms, are often employed.

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.1109/tit.2009.2027565

Cites

1 of 1 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.

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

Cites

Show all 1 references

Cited by

See all 171

Metadata

Authors
Elad, M., & Yavneh, I.
Venue
IEEE Transactions on Information Theory
Published
2009-10
Volume
55
Issue
10
Pages
4701-4714
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2161991491
Cited by
171
References
1
FWCI
7.08
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: A Plurality of Sparse Representations Is Better Than the Sparsest One Alone. https://app.cochat.ai/papers/10.1109/tit.2009.2027565
The paper
Elad, M., & Yavneh, I. (2009). A Plurality of Sparse Representations Is Better Than the Sparsest One Alone. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2009.2027565

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.