By Topic

A Robust K-plane Clustering Algorithm for Blind Separation of Underdetermined Mixtures of Sparse Sources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Fei Li ; Dept. of Electron. & Inf. Eng., Nanchang Univ., Nanchang, China ; Zhang, Ye ; Jianhua Wu ; Zheng Luo

In this paper, a robust K-plane clustering algorithm has been proposed for blind separation of underdetermined mixtures of sparse sources. In the presence of noise, based on the insufficient sparsity assumption of the source signals, the K-dimensional concentration hyperplanes have been found by using the algorithm, and then using them to estimate the mixing matrix. Simulation results show that the proposed algorithm can provide a good performance for underdetermined blind sources separation when the sources are insufficiently sparse signals.

Published in:

Measuring Technology and Mechatronics Automation (ICMTMA), 2010 International Conference on  (Volume:1 )

Date of Conference:

13-14 March 2010