A swapping-based refinement of orthogonal matching pursuit strategies
- 1 March 2006
- journal article
- Published by Elsevier in Signal Processing
- Vol. 86 (3) , 480-495
- https://doi.org/10.1016/j.sigpro.2005.05.034
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Nonlinear Approximation with Dictionaries I. Direct EstimatesJournal of Fourier Analysis and Applications, 2004
- Orthogonal matching pursuit: recursive function approximation with applications to wavelet decompositionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimized orthogonal matching pursuit approachIEEE Signal Processing Letters, 2002
- Greedy Algorithms andM-Term Approximation with Regard to Redundant DictionariesJournal of Approximation Theory, 1999
- Nonlinear approximationActa Numerica, 1998
- Adaptive greedy approximationsConstructive Approximation, 1997
- Some remarks on greedy algorithmsAdvances in Computational Mathematics, 1996
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993
- Orthogonal least squares learning algorithm for radial basis function networksIEEE Transactions on Neural Networks, 1991