TY - GEN
T1 - Grasshopper Optimization Algorithm for Blind Source Separation Based on Independent Component Analysis
AU - Yu, Yueyun
AU - Ng, Benjamin K.
AU - Lam, Chan Tong
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - The Blind Source Separation (BSS) refers to the task of recovering the source signal from a known mixed signal (also called the observation signal). The core of BSS is to find a separation matrix W and Independent Component Analysis (ICA) has been intensively studied for BSS. However, when using traditional ICA, it is easy to fall into the local optimum and the convergence speed is slow. Moreover, the accuracy of speech separation remains inadequate. For this reason, we propose that Grasshopper Optimization Algorithm (GOA) is employed to search for the separation matrix W for the BSS in conjunction with the Negative Entropy maximization function. The results show that effective separation can be achieved by our method (GOA-BSS) for different types of data including the human speech and bird sounds in various scenarios considered. Specifically, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are used to compare with GOA. GOA is superior to the two algorithms in separation efficiency, separation stability, and convergence speed. In summary, GOA-BSS has achieved an efficient separation success rate (S-Rate) in the problem of BSS, and GOA-BSS has good generalization capability.
AB - The Blind Source Separation (BSS) refers to the task of recovering the source signal from a known mixed signal (also called the observation signal). The core of BSS is to find a separation matrix W and Independent Component Analysis (ICA) has been intensively studied for BSS. However, when using traditional ICA, it is easy to fall into the local optimum and the convergence speed is slow. Moreover, the accuracy of speech separation remains inadequate. For this reason, we propose that Grasshopper Optimization Algorithm (GOA) is employed to search for the separation matrix W for the BSS in conjunction with the Negative Entropy maximization function. The results show that effective separation can be achieved by our method (GOA-BSS) for different types of data including the human speech and bird sounds in various scenarios considered. Specifically, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are used to compare with GOA. GOA is superior to the two algorithms in separation efficiency, separation stability, and convergence speed. In summary, GOA-BSS has achieved an efficient separation success rate (S-Rate) in the problem of BSS, and GOA-BSS has good generalization capability.
KW - Grasshopper Optimization Algorithm
KW - Independent Component Analysis
KW - Kurtosis
KW - Speech Separation
UR - http://www.scopus.com/inward/record.url?scp=85125300154&partnerID=8YFLogxK
U2 - 10.1109/ICCC54389.2021.9674254
DO - 10.1109/ICCC54389.2021.9674254
M3 - Conference contribution
AN - SCOPUS:85125300154
T3 - 2021 7th International Conference on Computer and Communications, ICCC 2021
SP - 1188
EP - 1193
BT - 2021 7th International Conference on Computer and Communications, ICCC 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th International Conference on Computer and Communications, ICCC 2021
Y2 - 10 December 2021 through 13 December 2021
ER -