An extended online Fast-ICA algorithm

2Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Hyävrinen and Oja have proposed an offline Fast-ICA algorithm. But it converge slowly in online form. By using the online whitening algorithm, and applying nature Riemannian gradient in Stiefel manifold, we present in this paper an extended online Fast-ICA algorithm, which can perform online blind source separation (BSS) directly using unwhitened observations. Computer simulation resluts are given to demonstrate the effectiveness and validity of our algorithm. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Wang, G., Rao, N. N., Zhang, Z. L., Mo, Q., & Wang, P. (2006). An extended online Fast-ICA algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 1109–1114). Springer Verlag. https://doi.org/10.1007/11759966_163

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free