Volume 6, Issue 2 (3-2010)                   JSDP 2010, 6(2): 63-74 | Back to browse issues page

XML Persian Abstract Print

An Introduction of New DESICA Algorithm for Blind Speech Separation in Dynamic Case
Abstract:   (3417 Views)

Abstract: We consider a new scenario in blind speech separation problem in which the number and the features of active sources change with time in opposite to the previous methods in which all sources are active all the time. Accordingly, we propose the new DESICA algorithm for source separation which is a compound of the ICA and DESPRIT algorithms. In this algorithm, using the ICA, the separation process is performed initially and then using the DESPRIT algorithm, the binary mask of silence intervals is calculated. Finally, by applying the binary mask to the separated signals, the final separation is obtained. Simulation results show that the DESICA algorithm improves the SDR and SIR about 6dB compared to those of the DESPRIT algorithm. Also, the SEN is improved about 11 and 17dB with respect to those of the ICA and DESPRIT algorithms.
Keywords: Blind source separation, Eventual thresholding, Binary mask
Full-Text [PDF 2526 kb]   (1135 Downloads)    
Type of Study: Research | Subject: Paper
Received: 2010/03/20 | Accepted: 2018/02/19 | Published: 2018/02/19 | ePublished: 2018/02/19
Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.