DocumentCode :
1155218
Title :
Mixing and Non-Mixing Local Minima of the Entropy Contrast for Blind Source Separation
Author :
Vrins, Frédéric ; Pham, Dinh-Tuan ; Verleysen, Michel
Author_Institution :
UCL Machine Learning Group, Univ. Catholique de Louvain, Louvain-la-Neuve
Volume :
53
Issue :
3
fYear :
2007
fDate :
3/1/2007 12:00:00 AM
Firstpage :
1030
Lastpage :
1042
Abstract :
In this paper, both non-mixing and mixing local minima of the entropy are analyzed from the viewpoint of blind source separation (BSS); they correspond respectively to acceptable and spurious solutions of the BSS problem. The contribution of this work is twofold. First, a Taylor development is used to show that the exact output entropy cost function has a non-mixing minimum when this output is proportional to any of the non-Gaussian sources, and not only when the output is proportional to the lowest entropic source. Second, in order to prove that mixing entropy minima exist when the source densities are strongly multimodal, an entropy approximator is proposed. The latter has the major advantage that an error bound can be provided. Even if this approximator (and the associated bound) is used here in the BSS context, it can be applied for estimating the entropy of any random variable with multimodal density
Keywords :
approximation theory; blind source separation; entropy; BSS problem; Taylor development; blind source separation; cost function; entropy approximator; entropy contrast; mixing local minima; multimodal density; Blind source separation; Books; Cost function; Data mining; Entropy; Independent component analysis; Machine learning; Machine learning algorithms; Random variables; Source separation; Blind source separation (BSS); entropy estimation; independent component analysis; mixture distribution; multi modal densities;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2006.890716
Filename :
4106142
Link To Document :
بازگشت