Blind Source Separation Based on K-SCA Assumption
The blind source.separation (BSS) based on K-SCA is discussed in this paper. The first challenging task of this approach is how to estimate the unknown mixing matrix precisely, to solve this problem, the algorithm based on hyperplane membership function is proposed. In contrast to the classical methods, the required key condition on sparsity of the sources can be considerably relaxed, and the algorithm has a good ability of anti-noise. Several experiments involving speech signals show the effectiveness and efficiency of this method.
underdetermined blind source separation hyperplane membership function sparse analysis
Wen Yang Hongyi Zhang
College of Electronics & Information Engineering Henan University of Science and Technology Luoyang, Department of Electronic and Electric Engineering XIA MEN university of technology XiaMen, Fujian 36
国际会议
成都
英文
116-121
2010-07-07(万方平台首次上网日期,不代表论文的发表时间)