Sciweavers

IJON
2007

Finite sample effects of the fast ICA algorithm

14 years 10 days ago
Finite sample effects of the fast ICA algorithm
Many algorithms for independent component analysis (ICA) and blind source separation (BSS) can be considered particular instances of a criterion based on the sum of two terms: C(Y), which expresses the decorrelation of the components and G(Y), which measures their non-Gaussianity. Within this framework, the popular FastICA algorithm can be regarded as a technique that keeps C(Y) ¼ 0 by first enforcing the whiteness of Y. Because of this constraint, the standard version of FastICA employs the sample-fourth moment as G(Y), instead of the sample-fourth cumulant. Our work analyzes some of the estimation errors introduced by the use of finite date sets in such a higher-order statistics (HOS) contrast and compares FastICA with an alternative version based on the sample-fourth cumulant, which is shown for different probability distributions having a lower variance in the generalization error in the case in which no whitening is performed, e.g. when orthonormal mixing of sources is present...
Sergio Bermejo
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where IJON
Authors Sergio Bermejo
Comments (0)