Abstract

Independent component analysis has been more attractive in the signal processing field. An independent component analysis method based on adaptive artificial bee colony algorithm is proposed in this paper, aiming at the problems of slow convergence and low computational precision in existing independent component analysis methods. The algorithm uses the Givens rotation to reduce the amount of variables to be solved. An adaptive global guidance item is introduced in searching strategy to dynamically adjust optimal guiding role. Simulation results show that the adaptive algorithm can separate the linear combinations of sub-Gaussian and super-Gaussian sources successfully and improve the accuracy of separation.

Keyword

Independent component analysis, Artificial bee colony, Adaptive, Search strategy.

Cite this article

Refference

[1][1]Lee TW. Independent component analysis. In independent component analysis 1998 (pp. 27-66). Springer.

[2][2]Comon P, Jutten C, editors. Handbook of blind source separation: independent component analysis and applications. Academic press; 2010.

[3][3]Liu JQ, Feng DZ, Zhang WW. Adaptive improved natural gradient algorithm for blind source separation. Neural Computation. 2009; 21(3):872-89.

[4][4]Karaboga D. An idea based on honey bee swarm for numerical optimization. Technical report-tr06, Erciyes University, engineering faculty, computer engineering department; 2005.

[5][5]Ebrahimzadeh A, Mavaddati S. A novel technique for blind source separation using bees colony algorithm and efficient cost functions. Swarm and Evolutionary Computation. 2014:15-20.

[6][6]Karaboga D, Basturk B. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization. 2007; 39(3):459-71.

[7][7]Karaboga D, Basturk B. On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing. 2008; 8(1):687-97.

[8][8]Mladenova CD, Mladenov IM, Todorov MD. About parametric representations of SO (n) matrices and plane rotations. In AIP conference proceedings-American institute of physics 2012 (pp. 280-7).

[9][9]Wang J, Yao Y, Mao Y, Sheng B, Mi N. Fresh: fair and efficient slot configuration and scheduling for hadoop clusters. In IEEE 7th International conference on cloud computing 2014 (pp. 761-8). IEEE.

[10][10]Bawa RK, Sharma G. Modified min-min heuristic for job scheduling based on QoS in grid environment. In international conference on information management in the knowledge economy (IMKE) 2013 (pp. 166-71). IEEE.

[11][11]Chen H, Wang F, Helian N, Akanmu G. User-priority guided min-min scheduling algorithm for load balancing in cloud computing. In national conference on parallel computing technologies 2013 (pp. 1-8). IEEE.

[12][12]Diaz CO, Pecero JE, Bouvry P. Scalable, low complexity, and fast greedy scheduling heuristics for highly heterogeneous distributed computing systems. The Journal of Supercomputing. 2014; 67(3):837-53.

[13][13]Huang SC, Jiau MK, Lin CH. A genetic-algorithm-based approach to solve carpool service problems in cloud computing. IEEE Transactions on Intelligent Transportation Systems. 2015; 16(1):352-64.