Skip to Main content Skip to Navigation
Conference papers

MPTK: Matching Pursuit made Tractable

Sacha Krstulovic 1 Rémi Gribonval 1 
1 METISS - Speech and sound data modeling and processing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Matching Pursuit (MP) aims at finding sparse decompositions of signals over redundant bases of elementary waveforms. Traditionally, MP has been considered too slow an algorithm to be applied to real-life problems with high-dimensional signals. Indeed, in terms of floating points operations, its typical numerical implementations have a complexity of O(N^2) and are associated with impractical runtimes. In this paper, we propose a new architecture which exploits the structure shared by many redundant MP dictionaries, and thus decreases its complexity to O(N log N). This architecture is implemented in a new software toolkit, called MPTK (the Matching Pursuit Toolkit), which is able to reach, e.g., 0.25 x real time for a typical MP analysis scenario applied to a 1 hour long audio track. This substantial acceleration makes it possible, from now on, to ex- plore and apply MP in the framework of real-life, high-dimensional data processing problems.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Rémi Gribonval Connect in order to contact the contributor
Submitted on : Tuesday, February 8, 2011 - 9:28:40 PM
Last modification on : Friday, February 4, 2022 - 3:18:48 AM
Long-term archiving on: : Monday, May 9, 2011 - 2:50:58 AM


Files produced by the author(s)



Sacha Krstulovic, Rémi Gribonval. MPTK: Matching Pursuit made Tractable. Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on, May 2006, Toulouse, France. pp.III-496 -- III-499, ⟨10.1109/ICASSP.2006.1660699⟩. ⟨inria-00544919⟩



Record views


Files downloads