mirage

An algorithm for mixing matrix estimation in instantaneous blind source separation

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

An algorithm for mixing matrix estimation in instantaneous blind source separation

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-08T00:41:09Z
dc.date.available 2011-09-08T00:41:09Z
dc.date.copyright 2009
dc.date.issued 2011-09-08
dc.identifier.citation Reju, V. G., Koh, S. N., & Soon, I. Y. (2009). An algorithm for mixing matrix estimation in instantaneous blind source separation. Signal Processing, 89, 1762-1773.
dc.identifier.issn 0165-1684
dc.identifier.uri http://hdl.handle.net/10220/7013
dc.description.abstract Sparsity of signals in the frequency domain is widely used for blind source separation (BSS) when the number of sources is more than the number of mixtures (underdetermined BSS). In this paper we propose a simple algorithm for detection of points in the Time-Frequency (TF) plane of the instantaneous mixtures where only single source contributions occur. Samples at these points in the TF plane can be used for the mixing matrix estimation. The proposed algorithm identifies the single-source points (SSPs) by comparing the absolute directions of the real and imaginary parts of the Fourier transform coefficient vectors of the mixed signals. Finally, the SSPs so obtained are clustered using the hierarchical clustering algorithm for the estimation of the mixing matrix. The proposed idea for the SSP identification is simpler than the previously reported algorithms.
dc.format.extent 27 p.
dc.language.iso en
dc.relation.ispartofseries Signal processing
dc.rights © 2009 Elsevier. This is the author created version of a work that has been peer reviewed and accepted for publication by Signal Processing, Elsevier.  It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document.  The published version is available at: [DOI: http://dx.doi.org/10.1016/j.sigpro.2009.03.017].
dc.subject DRNTU::Engineering::Electrical and electronic engineering::Electronic systems::Signal processing.
dc.title An algorithm for mixing matrix estimation in instantaneous blind source separation
dc.type Journal Article
dc.contributor.school School of Electrical and Electronic Engineering
dc.identifier.doi http://dx.doi.org/10.1016/j.sigpro.2009.03.017
dc.description.version Accepted version
dc.identifier.rims 140668

Files in this item

Files Size Format View
An algorithm fo ... lind source separation.pdf 773.1Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Statistics

Total views

All Items Views
An algorithm for mixing matrix estimation in instantaneous blind source separation 390

Total downloads

All Bitstreams Views
An algorithm for mixing matrix estimation in instantaneous blind source separation.pdf 536

Top country downloads

Country Code Views
United States of America 176
China 120
India 61
Singapore 19
Iran 14

Top city downloads

city Views
Mountain View 115
Beijing 43
Singapore 19
Harbin 14
Glendale 12

Downloads / month

  2014-06 2014-07 2014-08 total
An algorithm for mixing matrix estimation in instantaneous blind source separation.pdf 0 0 16 16