DocumentCode :
1480975
Title :
Boltzmann Machine and Mean-Field Approximation for Structured Sparse Decompositions
Author :
Drémeau, Angélique ; Herzet, Cédric ; Daudet, Laurent
Author_Institution :
Inst. Langevin, ESPCI ParisTech, Paris, France
Volume :
60
Issue :
7
fYear :
2012
fDate :
7/1/2012 12:00:00 AM
Firstpage :
3425
Lastpage :
3438
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 marginalized maximum a posteriori problem. To solve this problem, we resort to a mean-field approximation and the “variational Bayes expectation-maximization” algorithm. This approach results in a soft procedure making no hard decision on the support or the values of the sparse representation. We show that this characteristic leads to an improvement of the performance over state-of-the-art algorithms.
Keywords :
Bayes methods; Boltzmann machines; approximation theory; expectation-maximisation algorithm; signal representation; Boltzmann machine; expectation-maximization algorithm; maximum a posteriori problem; mean field approximation; soft procedure; sparse representation; structured sparse decomposition; variational Bayes method; Adaptation models; Algorithm design and analysis; Approximation algorithms; Approximation methods; Inference algorithms; Matching pursuit algorithms; Strontium; Bernoulli–Gaussian model; Boltzmann machine; mean-field approximation; structured sparse representation;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/TSP.2012.2192436
Filename :
6176252
Link To Document :
بازگشت