4.3 Article Proceedings Paper

A NEW ALGORITHM FOR THE UNDERDETERMINED BLIND SOURCE SEPARATION BASED ON SPARSE COMPONENT ANALYSIS

Publisher

WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0218001409006965

Keywords

Sparse component analysis; blind source separation; underdetermined mixtures; generalized spherical coordinate transformation; hyperplane clustering

Ask authors/readers for more resources

For the purpose of estimating the mixing matrix under the nonstrictly sparse condition, this paper presents the algorithms to approximate the mixing matrix in two different situations in which the source vectors are 1-sparse and (m-1)-sparse. When the source signals are 1-sparse, we use the generalized spherical coordinate transformation to convert the matrix of observation signals into the new one, which makes the process of estimating column A become the process of finding the center point of these new data. For the situation that source signals are (m-1)-sparse, we propose a new algorithm for the underdetermined mixtures blind source separation based on hyperplane clustering. The algorithm firstly finds out the linearly independent vectors from the observations, and secondly determines all the normal vectors of hyperplanes by analyzing the number of observations that are in the same hyperplane. Finally, we identify the column vectors of the mixing matrix A by calculating the vectors which are orthogonal to the clustered normal vectors. These two new algorithms for estimating the mixing matrix are more suitable for the general cases as they have lower requirement for the sparsity of the observations.

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

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available