Sciweavers

Share
ICASSP
2009
IEEE

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

10 years 4 months ago
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.
Boris Mailhé, Rémi Gribonval, Fr&eac
Added 21 May 2010
Updated 21 May 2010
Type Conference
Year 2009
Where ICASSP
Authors Boris Mailhé, Rémi Gribonval, Frédéric Bimbot, Pierre Vandergheynst
Comments (0)
books