University of Surrey

Test tubes in the lab Research in the ATI Dance Research

A Coupled HMM for Solving the Permutation Problem in Frequency Domain BSS

Sanei, S, Wang, W and Chambers, J (2004) A Coupled HMM for Solving the Permutation Problem in Frequency Domain BSS In: ICASSP 2004, 2004-05-17 - 2004-05-21, Montreal, Canada.

[img] Text
Restricted to Repository staff only
Available under License : See the attached licence file.

Download (256kB)
[img] Text (licence)
Restricted to Repository staff only

Download (33kB)


A block-based compressed sensing approach coupled with binary time-frequency masking is presented for the underdetermined speech separation problem. The proposed algorithm consists of multiple steps. First, the mixed signals are segmented to a number of blocks. For each block, the unknown mixing matrix is estimated in the transform domain by a clustering algorithm. Using the estimated mixing matrix, the sources are recovered by a compressed sensing approach. The coarsely separated sources are then used to estimate the time-frequency binary masks which are further applied to enhance the separation performance. The separated source components from all the blocks are concatenated to reconstruct the whole signal. Numerical experiments are provided to show the improved separation performance of the proposed algorithm, as compared with two recent approaches. The block-based operation has the advantage in improving considerably the computational efficiency of the compressed sensing algorithm without degrading its separation performance.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Authors :
Date : 30 August 2004
Identification Number : 10.1109/ICASSP.2004.1327173
Contributors :
Depositing User : Symplectic Elements
Date Deposited : 28 Mar 2017 14:43
Last Modified : 31 Oct 2017 14:37

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800