Faster ICA Under Orthogonal Constraint

Independent Component Analysis (ICA) is a technique for unsupervised exploration of multi-channel data widely used in observational sciences. In its classical form, ICA relies on modeling the data as a linear mixture of non-Gaussian independent sources. The problem can be seen as a likelihood maximization problem. We introduce Picard-O, a preconditioned L-BFGS strategy over the set of orthogonal matrices, which can quickly separate both super- and sub-Gaussian signals. It returns the same set of sources as the widely used FastICA algorithm. Through numerical experiments, we show that our method is faster and more robust than FastICA on real data.

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

[2]  Philippe Garat,et al.  Blind separation of mixture of independent sources through a quasi-maximum likelihood approach , 1997, IEEE Trans. Signal Process..

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

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

[5]  Antonio Torralba,et al.  Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope , 2001, International Journal of Computer Vision.

[6]  Aapo Hyvärinen,et al.  The Fixed-Point Algorithm and Maximum Likelihood Estimation for Independent Component Analysis , 1999, Neural Processing Letters.

[7]  A. Ferreol,et al.  Comparative performance analysis of eight blind source separation methods on radiocommunications signals , 2004, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541).

[8]  W. Bertram.  Differential Geometry, Lie Groups and Symmetric Spaces over General Base Fields and Rings , 2005, math/0502168.

[9]  Erkki Oja,et al.  Performance analysis of the FastICA algorithm and Crame/spl acute/r-rao bounds for linear independent component analysis , 2006, IEEE Transactions on Signal Processing.

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

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

[12]  Pierre Comon,et al.  Robust Independent Component Analysis by Iterative Maximization of the Kurtosis Contrast With Algebraic Optimal Step Size , 2010, IEEE Transactions on Neural Networks.

[13]  E. Oja,et al.  Performance Analysis of the FastICA Algorithm and Cramér – Rao Bounds for Linear Independent Component Analysis , 2010 .

[14]  Jean-Baptiste Poline,et al.  A group model for stable multi-subject ICA on fMRI datasets , 2010, NeuroImage.

[15]  R. Oostenveld,et al.  Independent EEG Sources Are Dipolar , 2012, PloS one.

[16]  M. Milham,et al.  The ADHD-200 Consortium: A Model to Advance the Translational Potential of Neuroimaging in Clinical Neuroscience , 2012, Front. Syst. Neurosci..

[17]  Tianwen Wei,et al.  A Convergence and Asymptotic Analysis of the Generalized Symmetric FastICA Algorithm , 2014, IEEE Transactions on Signal Processing.

[18]  Alexandre Gramfort,et al.  Faster Independent Component Analysis by Preconditioning With Hessian Approximations , 2017, IEEE Transactions on Signal Processing.