On sparse reconstruction from Fourier and Gaussian measurements

This publication has 29 references indexed in Scilit:

• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
  Communications on Pure and Applied Mathematics, 2006
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution
  Communications on Pure and Applied Mathematics, 2006
• Decoding by Linear Programming
  IEEE Transactions on Information Theory, 2005
• Reconstruction and subgaussian processes
  Comptes Rendus Mathematique, 2005
• Recovery of Short, Complex Linear Combinations Via$ell _1$Minimization
  IEEE Transactions on Information Theory, 2005
• Greed is Good: Algorithmic Results for Sparse Approximation
  IEEE Transactions on Information Theory, 2004
• On sparse representation in pairs of bases
  IEEE Transactions on Information Theory, 2003
• Uncertainty principles and ideal atomic decomposition
  IEEE Transactions on Information Theory, 2001
• On Milman's inequality and random subspaces which escape through a mesh in ℝ n
  Published by Springer Nature ,1988
• Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
  Annales de l'institut Fourier, 1985