On a simple derivation of the complementary matching pursuit

DOI10.1016/j.sigpro.2009.07.030zbMath1177.94048MaRDI QIDQ1048880

Christine Guillemot, Gagan B. Rath

Publication date: 8 January 2010

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2009.07.030

zbMATH Keywords

sparse approximation; greedy algorithms; orthogonal matching pursuit; matching pursuit; complementary matching pursuit

Mathematics Subject Classification ID

94A11: Application of orthogonal and other special functions

94A20: Sampling theory in information and communication theory

41A99: Approximations and expansions

Uses Software

• PDCO
• CoSaMP

Cites Work

• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• Recovery of Exact Sparse Representations in the Presence of Bounded Noise
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Atomic Decomposition by Basis Pursuit
• Dictionary Preconditioning for Greedy Algorithms
• Gradient Pursuits
• Matching pursuits with time-frequency dictionaries
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution