By Topic

Underdetermined Blind Source Separation of anechoic speech mixtures in the Time-Frequency domain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lv Yao ; Inst. of Acoust., Chinese Acad. of Sci., Beijing ; Li Shuangtian

This paper focuses on the problem of Under-determined Blind Source Separation (BSS) of anechoic speech mixtures. Our algorithm uses the idea of binary Time-Frequency (TF) mask employed in the Degenerate Unmixing Estimation Technique (DUET), but relaxes the strict sparsity assumption in DUET by allowing the sources to overlap in the TF domain to a certain extent. In particular, the number of active sources at any TF point does not exceed the number of sensors. We use the Unsupervised Robust C-Prototypes (URCP) algorithm to estimate the mixing parameters, and then divide the TF points into disjoint groups and overlapped groups to treat them separately. Experimental results show that the proposed method indicates a substantial increase in the Signal-to-Interference Ratio (SIR) comparing with DUET.

Published in:

Signal Processing, 2008. ICSP 2008. 9th International Conference on

Date of Conference:

26-29 Oct. 2008