A low complexity orthogonal matching pursuit for sparse signal approximation with shift-invariant dictionaries

We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift- invariant signal dictionaries with localized atoms, such as time-frequency dictionaries, and achieves approximation performance comparable to OMP at a computational cost similar to Matching Pursuit. Numerical experiments with a large audio signal show that, compared to OMP and Gradient Pursuit, the proposed algorithm runs in over 500 less time while leaving the approximation error almost unchanged.


Présenté à:
IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP09), Taipei, Taiwan, 2009
Année
2009
Publisher:
Taipei, Taiwan
Mots-clefs:
Laboratoires:




 Notice créée le 2009-01-20, modifiée le 2019-03-16

n/a:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)