Matching Pursuit With Stochastic Selection

Abstract : In this paper, we propose a Stochastic Selection strategy that ac- celerates the atom selection step of Matching Pursuit. This strategy consists of randomly selecting a subset of atoms and a subset of rows in the full dictionary at each step of the Matching Pursuit to obtain a sub-optimal but fast atom selection. We study the performance of the proposed algorithm in terms of approximation accuracy (decrease of the residual norm), of exact-sparse recovery and of audio declipping of real data. Numerical experiments show the relevance of the ap- proach. The proposed Stochastic Selection strategy is presented with Matching Pursuit but applies to any pursuit algorithms provided that their selection step is based on the computation of correlations.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Thomas Peel <>
Submitted on : Thursday, August 23, 2012 - 5:31:51 PM
Last modification on : Monday, March 4, 2019 - 2:04:24 PM
Long-term archiving on : Saturday, November 24, 2012 - 2:41:20 AM


Files produced by the author(s)


  • HAL Id : hal-00725075, version 1



Thomas Peel, Valentin Emiya, Liva Ralaivola, Sandrine Anthoine. Matching Pursuit With Stochastic Selection. European Signal Processing Conference EUSIPCO 2012, Aug 2012, Bucarest, Romania. pp.1-5. ⟨hal-00725075⟩



Record views


Files downloads