Local Separation Property of the Two-Source ICA Problem with the One-Bit-Matching Condition

The one-bit-matching conjecture for independent component analysis (ICA) is basically stated as “all the sources can be separated as long as there is 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”, which has been widely believed in the ICA community, but not proved completely. Recently, it has been proved that under the assumption of zero skewness for the model pdf’s, the global maximum of a cost function on the ICA problem with the one-bit-matching condition corresponds to a feasible solution of the ICA problem. In this paper, we further study the one-bit-matching conjecture along this direction and prove that all the possible local maximums of this cost function correspond to the feasible solutions of the ICA problem in the case of two sources under the same assumption. That is, the one-bit-matching condition is sufficient for solving the two-source ICA problem via any local ascent algorithm of the cost function.

[1]  Terrence J. Sejnowski,et al.  An Information-Maximization Approach to Blind Separation and Blind Deconvolution , 1995, Neural Computation.

[2]  Lang Tong,et al.  Waveform-preserving blind estimation of multiple independent sources , 1993, IEEE Trans. Signal Process..

[3]  Pierre Comon,et al.  Independent component analysis, A new concept? , 1994, Signal Process..

[4]  Max Welling,et al.  A Constrained EM Algorithm for Independent Component Analysis , 2001, Neural Computation.

[5]  J. Cardoso.  Infomax and maximum likelihood for blind source separation , 1997, IEEE Signal Processing Letters.

[6]  Richard M. Everson,et al.  Independent Component Analysis: A Flexible Nonlinearity and Decorrelating Manifold Approach , 1999, Neural Computation.

[7]  Andrzej Cichocki,et al.  A New Learning Algorithm for Blind Signal Separation , 1995, NIPS.

[8]  Terrence J. Sejnowski,et al.  Independent Component Analysis Using an Extended Infomax Algorithm for Mixed Subgaussian and Supergaussian Sources , 1999, Neural Computation.

[9]  Lei Xu,et al.  One-Bit-Matching Conjecture for Independent Component Analysis , 2004, Neural Computation.

[10]  Shun-ichi Amari,et al.  Learned parametric mixture based ICA algorithm , 1998, Neurocomputing.

[11]  Lei Xu,et al.  Some global and local convergence analysis on the information-theoretic independent component analysis approach , 2000, Neurocomputing.

[12]  Mark A. Girolami,et al.  An Alternative Perspective on Adaptive Independent Component Analysis Algorithms , 1998, Neural Computation.