A Blind Source Separation Algorithm Based on Dynamic Niching Particle Swarm Optimization
1 LMIB, School of Mathematics and Systems Science, Beihang University, Beijing 100191, China
2 School of Software Engineering, Beihang University, Beijing 100191, China
* Corresponding author (E-mail: Hongyili_buaa@163.com)
In this paper, the dynamic niching particle swarm optimization (DNPSO) is proposed to solve linear blind source separation problem. The key point is to use the DNPSO rather than particle swarm optimization (PSO) and fast-ICA as the optimization algorithm in Independent Component Analysis (ICA). By using DNPSO, which has global superiority, the performance of ICA will be improved in accuracy and convergence rate. The idea of sub-population in DNPSO leads to the greater efficiency compared with other methods when solving high dimensional cost functions in ICA. The performance of ICA based on DNPSO is investigated by numerical experiments.
© Owned by the authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.