Loading [a11y]/accessibility-menu.js
A quasi-optimally efficient algorithm for independent component analysis | IEEE Conference Publication | IEEE Xplore

A quasi-optimally efficient algorithm for independent component analysis

Publisher: IEEE

Abstract:

We propose an incremental algorithm for independent component analysis (ICA), that is guided by the statistical efficiency. Starting from an /spl lscr//sup /spl lscr//spl...View more

Abstract:

We propose an incremental algorithm for independent component analysis (ICA), that is guided by the statistical efficiency. Starting from an /spl lscr//sup /spl lscr//spl infin// norm sparseness measure contrast function, we derive the learning algorithm based on a winner-take-all learning mechanism. It avoids the optimization of high order non-linear functions or density estimation, which have been used by other ICA methods, such as negentropy approximation, infomax, and maximum likelihood estimation based methods. We show that when the latent independent random variables are super-Gaussian distributions, the network efficiently extracts the independent components. We observed a much faster convergence than with other ICA methods.
Date of Conference: 17-21 May 2004
Date Added to IEEE Xplore: 30 August 2004
Print ISBN:0-7803-8484-9
Print ISSN: 1520-6149
Publisher: IEEE
Conference Location: Montreal, QC, Canada

References

References is not available for this document.