Sparse representations are most likely to be the sparsest possible

DOI10.1155/ASP/2006/96247MaRDI QIDQ871467zbMATH OpenFDO

Authors Michael Elad

Publication date 19 March 2007

Published in EURASIP Journal on Applied Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• On Sparse Representations in Arbitrary Redundant Bases
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
• Stable recovery of sparse overcomplete representations in the presence of noise
• Sparse representations in unions of bases
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization

Cited in

(2)

• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
• scientific article; zbMATH DE number 2092615 (Why is no real title available?)

This page was built for publication: Sparse representations are most likely to be the sparsest possible

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871467)