TY - JOUR
T1 - GPSO-ICA
T2 - Independent Component Analysis based on Gravitational Particle Swarm Optimization for blind source separation
AU - Lee, Shih Hsiung
AU - Yang, Chu Sing
N1 - Funding Information:
This research is financially supported by the Ministry of Science and Technology of Taiwan (under grants Nos. 104-2221-E-006-119-MY3 and 104-3115-E-194-001).
Publisher Copyright:
© 2018 - IOS Press and the authors. All rights reserved.
PY - 2018
Y1 - 2018
N2 - Blind source separation (BSS) is an advanced method of signal processing. Essentially, the problem in BSS is to separate and estimate the original signal from the observed mixed signal source without knowing the characteristics of the original signal. Independent component analysis (ICA) is a popular approach for blind source separation, and because its traditional search scheme is based on a gradient algorithm, a convergence problem will arise. In order to overcome the defect, this paper proposed to apply Particle Swarm Optimization (PSO) and Gravitational Search Algorithm (GSA) to conduct accelerated computing of the rate of convergence of a demixing matrix in ICA. However, the PSO converges prematurely, and the population diversity is reduced rapidly, so that the optimal solution falls into the local optimum. In order to increase the diversity of PSO, GPSO-based ICA algorithm (GPSO-ICA) is proposed that has the exploring ability of GSA, so that the ICA algorithm has a higher convergence rate and better ability to escape local optimization. A series of comparisons is implemented for the ICA algorithms based on PSO, GSA, and GPSO. The results show that GPSO-ICA has better performance than the other methods.
AB - Blind source separation (BSS) is an advanced method of signal processing. Essentially, the problem in BSS is to separate and estimate the original signal from the observed mixed signal source without knowing the characteristics of the original signal. Independent component analysis (ICA) is a popular approach for blind source separation, and because its traditional search scheme is based on a gradient algorithm, a convergence problem will arise. In order to overcome the defect, this paper proposed to apply Particle Swarm Optimization (PSO) and Gravitational Search Algorithm (GSA) to conduct accelerated computing of the rate of convergence of a demixing matrix in ICA. However, the PSO converges prematurely, and the population diversity is reduced rapidly, so that the optimal solution falls into the local optimum. In order to increase the diversity of PSO, GPSO-based ICA algorithm (GPSO-ICA) is proposed that has the exploring ability of GSA, so that the ICA algorithm has a higher convergence rate and better ability to escape local optimization. A series of comparisons is implemented for the ICA algorithms based on PSO, GSA, and GPSO. The results show that GPSO-ICA has better performance than the other methods.
UR - http://www.scopus.com/inward/record.url?scp=85053319383&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85053319383&partnerID=8YFLogxK
U2 - 10.3233/JIFS-171545
DO - 10.3233/JIFS-171545
M3 - Article
AN - SCOPUS:85053319383
SN - 1064-1246
VL - 35
SP - 1943
EP - 1957
JO - Journal of Intelligent and Fuzzy Systems
JF - Journal of Intelligent and Fuzzy Systems
IS - 2
ER -