Abstract
An adaptive procedure for signal representation is proposed. The representation is built up through functions (atoms) selected from a redundant family (dictionary). At each iteration, the algorithm gives rise to an approximation of a given signal, which is guaranteed 1) to be the orthogonal projection of a signal onto the subspace generated by the selected atoms and 2) to minimize the norm of the corresponding residual error. The approach is termed optimized orthogonal matching pursuit because it improves upon the earlier proposed matching pursuit and orthogonal matching pursuit approaches.
| Original language | English |
|---|---|
| Pages (from-to) | 137-140 |
| Number of pages | 4 |
| Journal | IEEE Signal Processing Letters |
| Volume | 9 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 7 Aug 2002 |
Bibliographical note
© 2002 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Keywords
- Adaptive signal representation
- Dictionary atoms
- Matching pursuit
- Nonorthogonal atomic decomposition
- Nonorthogonal signal representation
- Subset selection