Equi-convergence algorithm for blind separation of sources with arbitrary distributions

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

Abstract

This paper presents practical implementation of the equi- convergent learning algorithm for blind source separation. The equi- convergent algorithm [4] has favorite properties such as isotropic con-vergence and universal convergence, but it requires to estimate unknown activation functions and certain unknown statistics of source signals. The estimation of such activation functions and statistics becomes critical in realizing the equi-convergent algorithm. It is the purpose of this paper to develop a new approach to estimate the activation functions adaptively for blind source separation. We propose the exponential type family as a model for probability density functions. A method of constructing an exponential family from the activation ( score ) functions is proposed. Then, a learning rule based on the maximum likelihood is derived to update the parameters in the exponential family. The learning rule is compatible with minimization of mutual information for training deinix- ing models. Finally, computer simulations are given to demonstrate the effectiveness and validity of the proposed approach. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Zhang, L. Q., Amari, S., & Cichocki, A. (2001). Equi-convergence algorithm for blind separation of sources with arbitrary distributions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2085 LNCS, pp. 826–833). Springer Verlag. https://doi.org/10.1007/3-540-45723-2_100

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