Evolutionary Algorithm Using Mutual Information for Independent Component Analysis

Authors:
F. Rojas;C. G. Puntonet;M.R. Álvarez;I. Rojas
Affiliations:
Dpto. Arquitectura. y Tecnología de Computadores, University of Granada, Spain;Dpto. Arquitectura. y Tecnología de Computadores, University of Granada, Spain;Dpto. Arquitectura. y Tecnología de Computadores, University of Granada, Spain;Dpto. Arquitectura. y Tecnología de Computadores, University of Granada, Spain
Venue:
IWANN '03 Proceedings of the 7th International Work-Conference on Artificial and Natural Neural Networks: Part II: Artificial Neural Nets Problem Solving Methods
Year:
2009

Citing 8
Cited 0

Independent component analysis, a new concept?

Signal Processing - Special issue on higher order statistics
An information-maximization approach to blind separation and blind deconvolution

Neural Computation
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Independent component analysis: theory and applications

Independent component analysis: theory and applications
Nonlinear independent component analysis: existence and uniqueness results

Neural Networks
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Source separation in post-nonlinear mixtures

IEEE Transactions on Signal Processing
Nonlinear blind source separation using higher order statistics anda genetic algorithm

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Independent Component Analysis (ICA) is a method for finding underlying factors from multidimensional statistical data. ICA differs from other similar methods in that it looks for components that are both statistically independent and nongaussian. Blind Source Separation (BSS) consists in recovering unobserved signals from a known set of mixtures. Thus, ICA and BSS are equivalent when the mixture is assumed to be linear up to possible permutations and invertible scalings. However, when the mixing model is nonlinear, additional constraints are needed to assure that independent components correspond to the original signals. In this paper, we propose a simple though effective method based on estimating the probability densities of the outputs for solving the BSS problem in linear and nonlinear mixtures making use of genetic algorithms. A post-nonlinear mixture model is assumed so that the solution space in the nonlinear case is restricted to signals equivalent to the original ones.