Using particle swarm optimization for minimizing mutual information in independent component analysis

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

Abstract

Independent Component Analysis (ICA) aims to recover a set of independent random variables starting from observations that are a mixture of them. Since the prior knowledge of the marginal distributions is unknown with the only restriction of at most one Gaussian component, the problem is usually formulated as an optimization one, where the goal is the maximization (minimization) of a cost function that in the optimal value approximates the statistical independence hypothesis. In this paper, we consider the ICA contrast function based on the mutual information. The stochastic global Particle Swarm Optimization (PSO) algorithm is used to solve the optimization problem. PSO is an evolutionary algorithm where the potential solutions, called particles, fly through the problem space by following the current optimum particles. It has the advantage that it works for non-differentiable functions and when no gradient information is available, providing a simple implementation with few parameters to adjust. We apply successfully PSO to separate some selected benchmarks signals. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Igual, J., Ababneh, J., Llinares, R., & Igual, C. (2011). Using particle swarm optimization for minimizing mutual information in independent component analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6692 LNCS, pp. 484–491). https://doi.org/10.1007/978-3-642-21498-1_61

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