Structured Bayesian Orthogonal Matching Pursuit - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Structured Bayesian Orthogonal Matching Pursuit


Taking advantage of the structures inherent in many sparse decompositions constitutes a promising research axis. In this paper, we address this problem from a Bayesian point of view. We exploit a Boltzmann machine, allowing to take a large variety of structures into account, and focus on the resolution of a joint maximum a posteriori problem. The proposed algorithm, called Structured Bayesian Orthogonal Matching Pursuit (SBOMP), is a structured extension of the Bayesian Orthogonal Matching Pursuit algorithm (BOMP) introduced in our previous work. In numerical tests involving a recovery problem, SBOMP is shown to have good performance over a wide range of sparsity levels while keeping a reasonable computational complexity
Fichier principal
Vignette du fichier
SBOMP_vHal.pdf (189.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00754995 , version 1 (20-11-2012)


  • HAL Id : hal-00754995 , version 1


Angélique Drémeau, Cedric Herzet, Laurent Daudet. Structured Bayesian Orthogonal Matching Pursuit. IEEE ICASSP 2012, Mar 2012, Kyoto, Japan. ⟨hal-00754995⟩
235 View
621 Download


Gmail Facebook X LinkedIn More