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
Type de document :
Communication dans un congrès
IEEE ICASSP 2012, Mar 2012, Kyoto, Japan. 2012
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00754995
Contributeur : Cedric Herzet <>
Soumis le : mardi 20 novembre 2012 - 12:03:15
Dernière modification le : vendredi 31 août 2018 - 09:12:33
Document(s) archivé(s) le : jeudi 21 février 2013 - 12:10:39

Fichier

SBOMP_vHal.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. 2012. 〈hal-00754995〉

Partager

Métriques

Consultations de la notice

333

Téléchargements de fichiers

428