4.6 Article

An algorithm for underdetermined mixing matrix estimation

Journal

NEUROCOMPUTING
Volume 104, Issue -, Pages 26-34

Publisher

ELSEVIER
DOI: 10.1016/j.neucom.2012.09.018

Keywords

Mixing matrix estimation; Robust clustering; Sparse component analysis; Underdetermined blind source separation

Funding

  1. National Science Foundation of China [61272333]
  2. Anhui Provincial Natural Science Foundation [1208085MF94]

Ask authors/readers for more resources

This paper considers the problem of mixing matrix estimation in underdetermined blind source separation (UBSS). We propose a simple and effective detection algorithm which detects the time-frequency (TF) points occupied by only a single source for each source. The detection algorithm identifies the single source points by comparing the normalized real and imaginary parts of the TF coefficient vectors of the mixed signals, which is simpler than previously reported algorithms. Then we propose a modified similarity-based robust clustering method (MSCM) to estimate the number of sources and the mixing matrix using these detected single source points. Experimental results show the efficiency of the proposed algorithm, especially in the cases where the number of sources is unknown. (C) 2012 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available