Sparse representations are most likely to be the sparsest possible

DOI10.1155/ASP/2006/96247zbMATH Open1122.94010MaRDI QIDQ871467FDOQ871467

Authors: Michael Elad 

Publication date: 19 March 2007

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

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

Mathematics Subject Classification ID

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

Cited In (2)

• Title not available (Why is that?)
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure

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)