On sparse representation in pairs of bases
IEEE Transactions on Information TheoryPublished 29 May 2003
Arie Feuer, Arkadi Nemirovski
Citations164
SJR quartileQ1
SJR score1.46
SNIP1.76
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is established here that the EB condition is both sufficient and necessary for replacing an l/sub 0/ optimization by linear programming minimization when searching for the unique sparse representation.
Abstract
In previous work, Elad and Bruckstein (EB) have provided a sufficient condition for replacing an l/sub 0/ optimization by linear programming minimization when searching for the unique sparse representation. We establish here that the EB condition is both sufficient and necessary.
Keywords
Computer ScienceEngineering
IEEE Transactions on Information TheoryUncertainty principles and ideal atomic decomposition
1,967 Citations2001David L. Donoho, Xiaoming Huo
It is proved that if S is representable as a highly sparse superposition of atoms from this time-frequency dictionary, then there is only one such highly sparse representation of S, and it can be obtained by solving the convex optimization problem of minimizing the l/sup 1/ norm of the coefficients among all decompositions.
IEEE Transactions on Information TheoryA generalized uncertainty principle and sparse representation in pairs of bases
669 Citations2002Michael Elad, Alfred M. Bruckstein⋆
The main contribution in this paper is the improvement of an important result due to Donoho and Huo (2001) concerning the replacement of the l/sub 0/ optimization problem by a linear programming minimization when searching for the unique sparse representation.