Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Bayesian Pursuit Algorithms

Cedric Herzet 1 Angélique Drémeau 2, 3 
1 FLUMINANCE - Fluid Flow Analysis, Description and Control from Image Sequences
CEMAGREF - Centre national du machinisme agricole, du génie rural, des eaux et forêts, Inria Rennes – Bretagne Atlantique
Abstract : This paper addresses the sparse representation (SR) problem within a general Bayesian framework. We show that the Lagrangian formulation of the standard SR problem, i.e. $\x^\star=\argmin_\x \lbrace \| \y-\D\x\|_2^2+\lambda\| \x\|_0 \rbrace$, can be regarded as a limit case of a general maximum a posteriori (MAP) problem involving Bernoulli-Gaussian variables. We then propose different tractable implementations of this MAP problem that we refer to as ''Bayesian pursuit algorithms". The Bayesian algorithms are shown to have strong connections with several well-known pursuit algorithms of the literature (e.g., MP, OMP, StOMP, CoSaMP, SP) and generalize them in several respects. In particular, i) they naturally allow for atom deselection; ii) they can include any prior information about the probability of occurrence of each atom within the selection process; iii) they can encompass the estimation of unkown model parameters into their recursions.
Complete list of metadata

Cited literature [44 references]  Display  Hide  Download
Contributor : Cédric Herzet Connect in order to contact the contributor
Submitted on : Monday, August 6, 2012 - 11:10:22 AM
Last modification on : Wednesday, October 26, 2022 - 4:07:44 PM
Long-term archiving on: : Friday, March 31, 2017 - 11:43:49 AM


Files produced by the author(s)


  • HAL Id : hal-00673801, version 3


Cedric Herzet, Angélique Drémeau. Bayesian Pursuit Algorithms. 2012. ⟨hal-00673801v3⟩



Record views


Files downloads