DocumentCode :
604489
Title :
A new method for underdetermined convolutive blind source separation in frequency domain
Author :
Yongqiang Chen ; Jun Liu
Author_Institution :
Sch. of Inf. Sci. & Technol., Southwest Jiaotong Univ., Chengdu, China
fYear :
2012
fDate :
29-31 Dec. 2012
Firstpage :
1484
Lastpage :
1487
Abstract :
We proposed a new method for underdetermined convolutive blind sourece separation and permutation alignment. First, we combine the full-rank spatial covariance model with time-frequency masking to separate fourier transform coefficients of speech signals at each frequency bin, which can reduce computational complexity. After converting the variance parameters to binary masking sequences, we choose only the representative sequences for clustering. Finally, the artificial bee colony algorithm(ABC) is used to implement permutation alignment. The computer results show that the proposed method works very well compared with exising method.
Keywords :
Fourier transforms; blind source separation; computational complexity; frequency-domain analysis; optimisation; pattern clustering; speech processing; ABC; Fourier transform coefficients; artificial bee colony algorithm; binary masking sequences; clustering sequence; computational complexity reduction; frequency domain; full-rank spatial covariance model; permutation alignment; speech signals; time-frequency masking; underdetermined convolutive blind source separation; variance parameters; artificial bee colony algorithm; convolutive blind source separation; full-rank spatial covar iance model; permutation indeterminacy; time-frequency masking;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Network Technology (ICCSNT), 2012 2nd International Conference on
Conference_Location :
Changchun
Print_ISBN :
978-1-4673-2963-7
Type :
conf
DOI :
10.1109/ICCSNT.2012.6526201
Filename :
6526201
Link To Document :
بازگشت