4.4 Article

Underdetermined Mixing Matrix Estimation Algorithm Based on Single Source Points

Journal

CIRCUITS SYSTEMS AND SIGNAL PROCESSING
Volume 36, Issue 11, Pages 4453-4467

Publisher

SPRINGER BIRKHAUSER
DOI: 10.1007/s00034-017-0522-9

Keywords

Underdetermined blind source separation; Mixing matrix estimation; Local directional density detection; Dynamic data field clustering

Funding

  1. National Natural Science Foundation of China [61371172]
  2. International S&T Cooperation Program of China (ISTCP) [2015DFR10220]
  3. Ocean Engineering Project of the National Key Laboratory Foundation [1213]
  4. Fundamental Research Funds for the Central Universities [HEUCF1508]
  5. Natural Science Foundation of Heilongjiang Province [F201337]

Ask authors/readers for more resources

This paper considers the mixing matrix estimation in the underdetermined blind source separation. An effective estimation algorithm based on local directional density detection (LDDD) and dynamic data field clustering (DDFC) is proposed. First, argument-based time-frequency single source points detection is employed to improve signal sparsity. To overcome the limitation of traditional clustering algorithms, which depend on the preset of initial clustering centers and the number of sources, the LDDD is introduced to choose the single source points with high potential energy as representative objects to form data preliminary classification. Then DDFC algorithm is adopted to move and merge the representative objects until all column vectors of mixing matrix are estimated. Simulation results show that the proposed method can effectively estimate mixing matrix with high accuracy, especially in the real non-cooperative cases where the number of sources is unknown.

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.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available