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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Comon, P.: Independent Component Analysis; a new concept? Signal Processing 36(3), 287–314 (1994)
Hyvarinen, A., Karhunen, J., Oja, E.: Independent Component Analysis. Wiley, New York (2001)
Cichocki, A., Amari, S.I.: Adaptive Blind Signal and Image Processing. Wiley, New York (2002)
Cardoso, J.F.: Blind Signal Separation: statistical principles. Proceedings of the IEEE 86(10), 2009–2025 (1998)
Cardoso, J.F.: Higher-order contrasts for Independent Component Analysis. Neural Computation 11, 157–192 (1999)
Bell, A.J., Sejnowski, T.J.: An information-maximization approach to blind separation and blind deconvolution. Neural Computation 7(6), 1004–1034 (1995)
Cardoso, J.F.: Infomax and maximum likelihood for blind source separation. IEEE Signal Processing Letters 4(4), 112–114 (1997)
Cardoso, J.F., Laheld, B.: Equivariant adaptive source separation. IEEE Trans. Signal Processing 44, 3017–3030 (1996)
Amari, S.I.: Natural gradient works efficiently in learning. Neural Computation 10, 251–276 (1998)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942–1948 (1995)
Kennedy, J., Spears, W.M.: Matching algorithm to problems: an experimental test of the particle swarm and some genetic algorithms on multi modal problem generator. In: Proc. IEEE Int. Conf. Evolutionary Computation (1998)
Trelea, I.C.: The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters 85, 317–325 (2003)
Clerc, M., Kennedy, J.: The particle swarm—Explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6, 58–73 (2002)
Cichocki, A., Amari, S., Siwek, K., Tanaka, T., Phan, A.H., Zdunek, R.: ICALAB - MATLAB Toolbox Ver. 3 for signal processing
Hyvarinen, A., Oja, E.: A fast fixed point algorithm for independent component analysis. Neural Computation 9(7), 1483–1492 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Igual, J., Ababneh, J., Llinares, R., Igual, C. (2011). Using Particle Swarm Optimization for Minimizing Mutual Information in Independent Component Analysis. In: Cabestany, J., Rojas, I., Joya, G. (eds) Advances in Computational Intelligence. IWANN 2011. Lecture Notes in Computer Science, vol 6692. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21498-1_61
Download citation
DOI: https://doi.org/10.1007/978-3-642-21498-1_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21497-4
Online ISBN: 978-3-642-21498-1
eBook Packages: Computer ScienceComputer Science (R0)