Bayesian Pursuit Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2012

Bayesian Pursuit Algorithms


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.
Fichier principal
Vignette du fichier
technical_report.pdf (518.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00673801 , version 1 (24-02-2012)
hal-00673801 , version 2 (13-07-2012)
hal-00673801 , version 3 (06-08-2012)


  • HAL Id : hal-00673801 , version 3


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


Gmail Facebook X LinkedIn More