Computer Science – Information Theory
Scientific paper
2006-11-21
Computer Science
Information Theory
11 pages, 6 figures, To appear in IEEE Transactions on Information Theory
Scientific paper
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 \textit{exact} output entropy cost function has a non-mixing minimum when this output is proportional to \textit{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.
Pham Dinh-Tuan
Verleysen Michel
Vrins Frederic
No associations
LandOfFree
Mixing and non-mixing local minima of the entropy contrast for blind source separation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Mixing and non-mixing local minima of the entropy contrast for blind source separation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mixing and non-mixing local minima of the entropy contrast for blind source separation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-338549