A Diversity-Guided Particle Swarm Optimization Method for Blind Source Separation


Article Preview

This paper presents a diversity-guided Particle swarm optimization (PSO) algorithm to resolve the Blind source separation (BSS) problem. Because the independent component analysis (ICA) approach, a popular method for the BSS problem, has a shortcoming of premature convergence during the optimization process, the proposed PSO algorithm aims to improve this issue by using the diversity calculation to avoid trapping in the local optima. In the experiment, the performance of the proposed PSO algorithm for the BSS problem has been investigated and the results are compared with the conventional PSO algorithm. It shows that the proposed PSO algorithm outperforms the conventional PSO algorithm.



Edited by:

D.L. Liu, X.B. Zhu, K.L. Xu and D.M. Fang




S. Wei et al., "A Diversity-Guided Particle Swarm Optimization Method for Blind Source Separation", Applied Mechanics and Materials, Vols. 513-517, pp. 876-880, 2014

Online since:

February 2014




* - Corresponding Author

[1] V. Zarzoso and A.K. Nandi: Blind Source Separation, Blind Estimation Using Higher-order Statistics, (1999), pp.167-252.

DOI: https://doi.org/10.1007/978-1-4757-2985-6_4

[2] P. Comon, C. Jutten: Handbook of Blind Source Separation, Independent Component Analysis and Applications, Academic Press, Oxford UK, (2010).

[3] C. L. Lin, S. T. Hsieh and C. C. Liu: PSO-based Learning Rate Adjustment for Blind Source Separation, Proceedings of 2005 International Symposium on Intelligent Signal Processing and Communication Systems, (2005), pp.181-184.

DOI: https://doi.org/10.1109/ispacs.2005.1595376

[4] Brillouin, Leon: Negentropy Principle of Information, J. of Applied Physics, Vol. 24(9), (1953), pp.1152-1163.

[5] J. Kennedy, R. Eberhart: Particle Swarm Optimization, Proceedings of IEEE International Conference on Neural Networks IV. (1995), p.1942–(1948).

[6] J. Riget and J. S. Vesterstrøm. A diversity-guided particle swarm optimizer - the ARPSO, Technical report, EVALile, Dept. of Computer Science, University of Aarhus, Denmark, (2002).

[7] C. Lin, C. Huo, S. Lin, Y. Yu, and T. Sun, Taguchi-based disturbance with tournament selection to improve on MOPSO, 2011 IEEE Congress on Evolutionary Computation (CEC), (2011), p.1805–1810.

DOI: https://doi.org/10.1109/cec.2011.5949834