A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries

Boris Mailhé
  • Fonction : Auteur
  • PersonId : 856985
Pierre Vandergheynst
  • Fonction : Auteur
  • PersonId : 839985

Résumé

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.
Fichier principal
Vignette du fichier
LocOMP.pdf (312.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00461092 , version 1 (11-01-2011)

Identifiants

Citer

Boris Mailhé, Rémi Gribonval, Pierre Vandergheynst, Frédéric Bimbot. A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries. Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on, Apr 2009, Taipei, Taiwan. pp.3445 - 3448, ⟨10.1109/ICASSP.2009.4960366⟩. ⟨hal-00461092⟩
364 Consultations
339 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More