Ant Colony Clustering Algorithm for Underdetermined BSS  

作　　者：HE Xuansen WANG Fang CHAI Wenbiao WU Liangmin 

机构地区：[1]College of Information Science and Engineering, Hunan University, Changsha 410082, China

出　　处：《Chinese Journal of Electronics》2013年第2期319-324,共6页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China （No.61072122） and the Key Project of Hunan Provincial Natural Science Foundation （No.11JJ20153）.

摘　　要：In underdetermined blind source separa- tion, in order to quickly and accurately estimate the mixing matrix and the source signals, this paper presents a new al- gorithm based on ant colony clustering. The basic ideal of the algorithm is that we utilize the linear clustering charac- teristic of sparse signals to estimate the number of sources and the column vector of the mixing matrix by estimating the directions of the straight lines. In the preprocessing step, the observed signals in time domain are transformed to sparse signals in frequency domain. Through normaliz- ing the observed data the linearity clustering is translated to compact clustering, and then using ant colony cluster- ing to get the number of source signals and the mixing ma- trix. Finally, based on the estimation of the mixing matrix, the source signals are recovered by linear programming method. The simulation results illustrate the availability and accuracy of the proposed algorithm.

关 键 词：Blind source separation Underdeter- mined blind source separation Sparse representation Ant colony clustering Compact clustering. 

分 类 号：O572.321[理学—粒子物理与原子核物理] TP317[理学—物理]