HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Liu, Z.-Y. Articles by Xu, L. Search for Related Content PubMed PubMed Citation Articles by Liu, Z.-Y. Articles by Xu, L.

One-Bit-Matching Conjecture for Independent Component Analysis

zyliu{at}cse.cuhk.edu.hk, Department of Computer Science and Engineering, Chinese University of Hong Kong, Shatin, New Territories, Hong Kong

Kai-Chun Chiu

kcchiu{at}cse.cuhk.edu.hk, Department of Computer Science and Engineering, Chinese University of Hong Kong, Shatin, New Territories, Hong Kong

Lei Xu

lxu{at}cse.cuhk.edu.hk, Department of Computer Science and Engineering, Chinese University of Hong Kong, Shatin, New Territories, Hong Kong

The one-bit-matching conjecture for independent component analysis (ICA) could be understood from different perspectives but is basically stated as "all the sources can be separated as long as there is a one-to-one same-sign-correspondence between the kurtosis signs of all source probability density functions (pdf's) and the kurtosis signs of all model pdf's" (Xu, Cheung, & Amari, 1998a). This conjecture has been widely believed in the ICA community and implicitly supported by many ICA studies, such as the Extended Infomax (Lee, Girolami, & Sejnowski, 1999) and the soft switching algorithm (Welling & Weber, 2001). However, there is no mathematical proof to confirm the conjecture theoretically. In this article, only skewness and kurtosis are considered, and such a mathematical proof is given under the assumption that the skewness of the model densities vanishes. Moreover, empirical experiments are demonstrated on the robustness of the conjecture as the vanishing skewness assumption breaks. As a by-product, we also show that the kurtosis maximization criterion (Moreau & Macchi, 1996) is actually a special case of the minimum mutual information criterion for ICA.

This article has been cited by other articles:

				L. Xu One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics. Neural Comput., February 1, 2007; 19(2): 546 - 569. [Abstract] [Full Text] [PDF]

				J. Ma, Z. Liu, and L. Xu A Further Result on the ICA One-Bit-Matching Conjecture Neural Comput., February 1, 2005; 17(2): 331 - 334. [Abstract] [Full Text] [PDF]