A swapping-based refinement of orthogonal matching pursuit strategies

DOI10.1016/J.SIGPRO.2005.05.034MaRDI QIDQ1027247zbMATH OpenOpenAlexFDO

Authors Miroslav Andrle, L. Rebollo-Neira

Publication date 1 July 2009

Published in Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

greedy algorithmsnonlinear approximationsparse representationmatching pursuitadaptive biorthogonalisationb-spline dictionaries

Mathematics Subject Classification ID

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

Recommendations

• Backward adaptive biorthogonalization
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Greed is Good: Algorithmic Results for Sparse Approximation
• Analysis of the self projected matching pursuit algorithm
• Analysis of orthogonal multi-matching pursuit under restricted isometry property

Cited in

(4)

• Backward adaptive biorthogonalization
• Analysis of the self projected matching pursuit algorithm
• Sparse signal representation by adaptive non-uniform B-spline dictionaries on a compact interval
• Experiments on orthogonalization by biorthogonal representations of orthogonal projectors

This page was built for publication: A swapping-based refinement of orthogonal matching pursuit strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027247)