Underdetermined convolutive blind source separation via time-frequency masking

DSpace/Manakin Repository


Search DR-NTU

Advanced Search Subject Search


My Account

Underdetermined convolutive blind source separation via time-frequency masking

Show simple item record

dc.contributor.author Reju, Vaninirappuputhenpurayil Gopalan
dc.contributor.author Koh, Soo Ngee
dc.contributor.author Soon, Ing Yann
dc.date.accessioned 2011-09-06T09:01:08Z
dc.date.available 2011-09-06T09:01:08Z
dc.date.copyright 2009
dc.date.issued 2011-09-06
dc.identifier.citation Reju, V. G., Koh, S. N., & Soon, I. Y. (2010). Underdetermined Convolutive Blind Source Separation via Time-Frequency Masking. IEEE Transactions on Audio, Speech, and Language Processing, 18(1), 101-116.
dc.identifier.issn 1558-7916
dc.identifier.uri http://hdl.handle.net/10220/7004
dc.description.abstract In this paper, we consider the problem of separation of unknown number of sources from their underdetermined convolutive mixtures via time-frequency (TF) masking. We propose two algorithms, one for the estimation of the masks which are to be applied to the mixture in the TF domain for the separation of signals in the frequency domain, and the other for solving the permutation problem. The algorithm for mask estimation is based on the concept of angles in complex vector space. Unlike the previously reported methods, the algorithm does not require any estimation of the mixing matrix or the source positions for mask estimation. The algorithm clusters the mixture samples in the TF domain based on the Hermitian angle between the sample vector and a reference vector using the well known k -means or fuzzy c -means clustering algorithms. The membership functions so obtained from the clustering algorithms are directly used as the masks. The algorithm for solving the permutation problem clusters the estimated masks by using k-means clustering of small groups of nearby masks with overlap. The effectiveness of the algorithm in separating the sources, including collinear sources, from their underdetermined convolutive mixtures obtained in a real room environment, is demonstrated.
dc.format.extent 15 p.
dc.language.iso en
dc.relation.ispartofseries IEEE transactions on audio, speech, and language processing
dc.rights © 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [DOI: http://dx.doi.org/10.1109/TASL.2009.2024380].
dc.subject DRNTU::Engineering::Electrical and electronic engineering::Electronic systems::Signal processing.
dc.title Underdetermined convolutive blind source separation via time-frequency masking
dc.type Journal Article
dc.contributor.school School of Electrical and Electronic Engineering
dc.identifier.doi http://dx.doi.org/10.1109/TASL.2009.2024380
dc.description.version Accepted version
dc.identifier.rims 141440

Files in this item

Files Size Format View
Underdetermined ... Time–Frequency Masking.pdf 599.1Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record


Total views

All Items Views
Underdetermined convolutive blind source separation via time-frequency masking 366

Total downloads

All Bitstreams Views
Underdetermined Convolutive Blind Source Separation via Time–Frequency Masking.pdf 396

Top country downloads

Country Code Views
United States of America 120
China 93
Singapore 20
Germany 18
India 17

Top city downloads

city Views
Mountain View 58
Beijing 47
Singapore 19
Hefei 8
Columbus 7