Structured Bayesian Orthogonal Matching Pursuit

Abstract : 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
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-00754995
Contributor : Cédric Herzet <>
Submitted on : Tuesday, November 20, 2012 - 12:03:15 PM
Last modification on : Monday, September 2, 2019 - 2:20:10 PM
Long-term archiving on : Thursday, February 21, 2013 - 12:10:39 PM

File

SBOMP_vHal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00754995, version 1

Citation

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

Share

Metrics

Record views

402

Files downloads

662