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

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

On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations

Bruckstein, Alfred M., Elad, Michael, Zibulevsky, Michael · 2008 · IEEE Transactions on Information Theory

Abstract

An underdetermined linear system of equationsAx=bwith nonnegativity constraintxges 0 is considered. It is shown that for matricesAwith a row-span intersecting the positive orthant, if this problem admits a sufficiently sparse solution, it is necessarily unique. The bound on the required sparsity depends on a coherence property of the matrixA. This coherence measure can be improved by applying a conditioning stage onA, thereby strengthening the claimed result. The obtained uniqueness theorem relies on an extended theoretical analysis of the lscr0- lscr1equivalence developed here as well, considering a matrixAwith arbitrary column norms, and an arbitrary monotone element-wise concave penalty replacing the lscr1-norm objective function. Finally, from a numerical point of view, a greedy algorithm-a variant of the matching pursuit-is presented, such that it is guaranteed to find this sparse solution. It is further shown how this algorithm can benefit from well-designed conditioning ofA.

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.2008.929920

Cites

20 of 20 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

Cited by

See all 285

Metadata

Authors
Bruckstein, A. M., Elad, M., & Zibulevsky, M.
Venue
IEEE Transactions on Information Theory
Published
2008-11
Volume
54
Issue
11
Pages
4813-4820
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2135161976
Cited by
285
References
20
FWCI
15.05
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.