Analysis of basis pursuit via capacity sets

DOI10.1007/s00041-008-9036-yzbMath1181.94055arXiv1004.4329OpenAlexW3098292829MaRDI QIDQ734943

Michael Elad, Joseph Shtok

Publication date: 14 October 2009

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.4329

Mathematics Subject Classification ID

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

Uses Software

• PDCO

Cites Work

• Grassmannian frames with applications to coding and communication
• Quantitative robust uncertainty principles and optimally sparse decompositions
• On Sparse Representations in Arbitrary Redundant Bases
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Sparse representations in unions of bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Atomic Decomposition by Basis Pursuit
• Uncertainty principles and ideal atomic decomposition
• A generalized uncertainty principle and sparse representation in pairs of bases
• Sparse Approximate Solutions to Linear Systems
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution