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.
Original language | English |
---|---|
Pages (from-to) | 480-495 |
Number of pages | 16 |
Journal | Signal processing |
Volume | 86 |
Issue number | 3 |
Early online date | 15 Aug 2005 |
DOIs | |
Publication status | Published - Mar 2006 |
Keywords
- Adaptive biorthogonalisation
- B-spline dictionaries
- Greedy algorithms
- Matching pursuit
- Nonlinear approximation
- Sparse representation