Blind source separation in post-nonlinear mixtures using natural gradient descent and particle swarm optimization algorithm

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

Abstract

Extracting independent source signals from their nonlinear mixtures is a very important issue in many realistic models. This paper proposes a new method for solving nonlinear blind source separation (NBSS) problems by exploiting particle swarm optimization (PSO) algorithm and natural gradient descent. First, we address the problem of separation of mutually independent sources in post-nonlinear mixtures. The natural gradient descent is used to estimate the separation matrix. Then we define the mutual information between output signals as the fitness function of PSO. The mutual information is used to measure the statistical dependence of the outputs of the demixing system. PSO can rapidly obtain the globally optimal coefficients of the higher order polynomial functions. Compared to conventional NBSS approaches, the main characteristics of this method are its simplicity, the rapid convergence and high accuracy. In particular, it is robust against local minima in search for inverse functions. Experiments are discussed to demonstrate these results. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Song, K., Ding, M., Wang, Q., & Liu, W. (2007). Blind source separation in post-nonlinear mixtures using natural gradient descent and particle swarm optimization algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4493 LNCS, pp. 721–730). Springer Verlag. https://doi.org/10.1007/978-3-540-72395-0_89

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