Elad M 2003 Optimally sparse representation in general (non-orthogonal) dictionaries via ℓ 1 minimization

Cached

Download Links

by David L. Donoho , Michael Elad
Venue:Proc. Natl Acad. Sci. USA 100 2197–202
Citations:366 - 32 self

Active Bibliography

299 Stable recovery of sparse overcomplete representations in the presence of noise – - 2006
207 From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images – - 2007
90 Just relax: Convex programming methods for subset selection and sparse approximation – - 2004
12 Sparse Representations are Most Likely to be the Sparsest Possible – - 2004
358 Uncertainty principles and ideal atomic decomposition – - 2001
528 Greed is Good: Algorithmic Results for Sparse Approximation – - 2004
An Efficient Algorithm for . . . Pixel Camera and Compressive Sensing – - 2009
24 A Non-Negative and Sparse Enough Solution of an Underdetermined Linear System of Equations is Unique – - 2007
Compressive sensing: a paradigm shift in signal processing – - 812
1 Theoretical Results and Applications Related to Dimension Reduction – - 2007
69 Theoretical results on sparse representations of multiple-measurement vectors – - 2006
5 Blind Source Separation: the Sparsity Revolution – - 2008
1 Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information – - 2004
122 Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions – - 2004
7 Greedy Basis Pursuit – - 2006
3 15 Years of Reproducible Research in Computational Harmonic Analysis – - 2008
MODEL SELECTION WHEN THE NUMBER OF VARIABLES EXCEEDS THE NUMBER OF OBSERVATIONS – - 2006
132 Sparse solutions to linear inverse problems with multiple measurement vectors – - 2005
1 Hybrid Video Coding Based on Bidimensional Matching Pursuit – - 2004