Maximum non-Gaussianity estimation revisit: Uniqueness analysis from the perspective of constrained cost function optimization

In Independent Component Analysis (ICA) and its diverse algorithms, uniqueness is the most essential requirement and rationality problem compared with performances of existence, stability and convergence. For ICA's maximum non-Gaussianity estimation (MNE), many achievements have been made in recent twenty years based on uniqueness assumption, which has been taken for granted all along except for some intuitive interpretation. From the perspective of constrained cost function optimization, the paper is to provide a mathematical proof for uniqueness principle in MNE. The research focuses on skewless assumption and kurtosis-based cost function with basic linear ICA model. Provided that the sources are skewless, the relationship between the Kuhn-Tucker (K-T) points of cost function and the local maxima of non-Gaussianity are derived with the help of constrained optimization theory, and then a conclusion is drawn that there is a one-to-one correspondence between independent components and the local maxima, i.e. maximum non-Gaussianity is the sufficient and necessary condition for independent sources recovery. Moreover, the result also leads to an alternative and straightforward approach to the proof of the Xu' one-bit-matching conjecture for the availability of multi-unit approaches.

[1]  Eric Moreau,et al.  New self-adaptative algorithms for source separation based on contrast functions , 1993, [1993 Proceedings] IEEE Signal Processing Workshop on Higher-Order Statistics.

[2]  Aapo Hyvärinen,et al.  Survey on Independent Component Analysis , 1999 .

[3]  Aapo Hyvärinen,et al.  Fast and robust fixed-point algorithms for independent component analysis , 1999, IEEE Trans. Neural Networks.

[4]  Zhang Yi,et al.  Convergence Analysis of a Class of HyvÄrinen–Oja's ICA Learning Algorithms With Constant Learning Rates , 2009, IEEE Transactions on Signal Processing.

[5]  L. Xu Independent Component Analysis and Extensions with Noise and Time: A Bayesian Ying-Yang Learning Perspective , 2003 .

[6]  Liping Li,et al.  On extending the complex FastICA algorithms to noisy data , 2014, Neural Networks.

[7]  Gang Wang,et al.  Global Convergence of FastICA: Theoretical Analysis and Practical Considerations , 2005, ICNC.

[8]  Nathalie Delfosse,et al.  Adaptive blind separation of independent sources: A deflation approach , 1995, Signal Process..

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

[10]  Tianwen Wei,et al.  FastICA Algorithm: Five Criteria for the Optimal Choice of the Nonlinearity Function , 2013, IEEE Transactions on Signal Processing.

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

[12]  E. Oja,et al.  Independent Component Analysis , 2013 .

[13]  Andrzej Cichocki,et al.  Adaptive Blind Signal and Image Processing - Learning Algorithms and Applications , 2002 .

[14]  E. Oja,et al.  Convergence of the symmetrical FastICA algorithm , 2002, Proceedings of the 9th International Conference on Neural Information Processing, 2002. ICONIP '02..

[15]  Visa Koivunen,et al.  Identifiability, separability, and uniqueness of linear ICA models , 2004, IEEE Signal Processing Letters.

[16]  Gang Wang,et al.  Local Stability Analysis of Maximum Nongaussianity Estimation in Independent Component Analysis , 2006, ISNN.

[17]  R. Fletcher Practical Methods of Optimization , 1988 .

[18]  Hao Shen,et al.  Local Convergence Analysis of FastICA and Related Algorithms , 2008, IEEE Transactions on Neural Networks.

[19]  Jimin Ye,et al.  On the convergence of ICA algorithms with weighted orthogonal constraint , 2014, Digit. Signal Process..

[20]  Motoaki Kawanabe,et al.  Uniqueness of Non-Gaussianity-Based Dimension Reduction , 2011, IEEE Transactions on Signal Processing.

[21]  Jinwen Ma,et al.  A Further Result on the ICA One-Bit-Matching Conjecture , 2005, Neural Computation.

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

[23]  Tianping Chen,et al.  Stability analysis of blind signals separation algorithms , 2003, Proceedings of the International Joint Conference on Neural Networks, 2003..

[24]  Andrzej Cichocki,et al.  Stability Analysis of Learning Algorithms for Blind Source Separation , 1997, Neural Networks.

[25]  Shun-ichi Amari,et al.  Stability Analysis Of Adaptive Blind Source Separation , 1997 .

[26]  Erkki Oja,et al.  The FastICA Algorithm Revisited: Convergence Analysis , 2006, IEEE Transactions on Neural Networks.

[27]  Peter J Lesniewski,et al.  Performance limits of ICA-based heart rate identification techniques in imaging photoplethysmography , 2015, Physiological measurement.

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

[29]  Lei Xu,et al.  One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics , 2007, Neural Computation.

[30]  Gang Wang,et al.  Self-adaptive FastICA Based on Generalized Gaussian Model , 2005, ISNN.