K-EVD Clustering and Its Applications to Sparse Component Analysis

In this paper we introduce a simple distance measure from a m-dimensional point a hyper-line in the complex-valued domain. Based on this distance measure, the K-EVD clustering algorithm is proposed for estimating the basis matrix A in sparse representation model X= AS+ N Compared to existing clustering algorithms, the proposed one has advantages in two aspects: it is very fast; furthermore, when the number of basis vectors is overestimated, this algorithm can estimate and identify the significant basis vectors which represent a basis matrix, thus the number of sources can be also precisely estimated. We have applied the proposed approach for blind source separation. The simulations show that the proposed algorithm is reliable and of high accuracy, even when the number of sources is unknown and/or overestimated.

[1]  Barak A. Pearlmutter,et al.  Hard-LOST: modified k-means for oriented lines , 2004 .

[2]  Fabian J. Theis,et al.  Sparse component analysis and blind source separation of underdetermined mixtures , 2005, IEEE Transactions on Neural Networks.

[3]  Lucas C. Parra,et al.  Convolutive blind separation of non-stationary sources , 2000, IEEE Trans. Speech Audio Process..

[4]  Joseph F. Murray,et al.  Dictionary Learning Algorithms for Sparse Representation , 2003, Neural Computation.

[5]  Yuanqing Li,et al.  Blind estimation of channel parameters and source components for EEG signals: a sparse factorization approach , 2006, IEEE Transactions on Neural Networks.

[6]  Michael Elad,et al.  K-SVD and its non-negative variant for dictionary design , 2005, SPIE Optics + Photonics.

[7]  Fabian J. Theis,et al.  Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform , 2004, ESANN.

[8]  Scott Rickard,et al.  Blind separation of speech mixtures via time-frequency masking , 2004, IEEE Transactions on Signal Processing.

[9]  Michael Zibulevsky,et al.  Underdetermined blind source separation using sparse representations , 2001, Signal Process..

[10]  Daniel W. C. Ho,et al.  Underdetermined blind source separation based on sparse representation , 2006, IEEE Transactions on Signal Processing.

[11]  B. A. D. H. Brandwood.  A complex gradient operator and its applica-tion in adaptive array theory , 1983 .

[12]  Yuanqing Li,et al.  Analysis of Sparse Representation and Blind Source Separation , 2004, Neural Computation.

[13]  Barak A. Pearlmutter,et al.  Soft-LOST: EM on a Mixture of Oriented Lines , 2004, ICA.

[14]  Mineichi Kudo,et al.  Performance analysis of minimum /spl lscr//sub 1/-norm solutions for underdetermined source separation , 2004, IEEE Transactions on Signal Processing.