Beyond sparsity: Recovering structured representations by ${\ell}^1$ minimization and greedy algorithms

This publication has 22 references indexed in Scilit:

• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
  Applied and Computational Harmonic Analysis, 2007
• Greed is Good: Algorithmic Results for Sparse Approximation
  IEEE Transactions on Information Theory, 2004
• Sparse representations in unions of bases
  IEEE Transactions on Information Theory, 2003
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
  Proceedings of the National Academy of Sciences, 2003
• A generalized uncertainty principle and sparse representation in pairs of bases
  IEEE Transactions on Information Theory, 2002
• Uncertainty principles and ideal atomic decomposition
  IEEE Transactions on Information Theory, 2001
• Atomic Decomposition by Basis Pursuit
  SIAM Journal on Scientific Computing, 1998
• Adaptive greedy approximations
  Constructive Approximation, 1997
• Adaptive Time-Frequency Approximations with Matching Pursuits
  Published by Elsevier ,1994
• On a Conjecture of Huber Concerning the Convergence of Projection Pursuit Regression
  The Annals of Statistics, 1987