A swapping-based refinement of orthogonal matching pursuit strategies

Authors:
Miroslav Andrle;Laura Rebollo-Neira
Affiliations:
Aston University, Birmingham, UK;Aston University, Birmingham, UK
Venue:
Signal Processing - Sparse approximations in signal and image processing
Year:
2006

Citing 3
Cited 5

Greedy algorithms and M-term approximation with regard to redundant dictionaries

Journal of Approximation Theory
Fast orthogonal least squares algorithm for efficient subset modelselection

IEEE Transactions on Signal Processing
Greed is good: algorithmic results for sparse approximation

IEEE Transactions on Information Theory

Letter to the Editor: Experiments on orthogonalization by biorthogonal representations of orthogonal projectors

Journal of Computational and Applied Mathematics
Fast linear discriminant analysis using binary bases

Pattern Recognition Letters
Representing Images Using Nonorthogonal Haar-Like Bases

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast communication: Sparse signal representation by adaptive non-uniform B-spline dictionaries on a compact interval

Signal Processing
Recovery of sparse representations by polytope faces pursuit

ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A swapping-based refinement of orthogonal matching pursuit strategies is introduced. The approach is based on recursive forward and backward biorthogonalisation techniques for adapting orthogonal projections. The resulting algorithm, which improves upon orthogonal matching pursuit methods, is fast and easy to implement.