Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aharon, M., Elad, M., Bruckstein, A.M.: K-SVD and its non-negative variant for dictionary design. In: Proceedings of the SPIE conference wavelets, vol. 5914 (July 2005)
Georgiev, P.G., Theis, F., Cichocki, A.: Sparse component analysis and blind source separation of underdetermined mixtures. IEEE Trans. on Neural Networks 16(4), 992–996 (2005)
Li, Y.Q., Amari, S., Cichocki, A., Ho, D.W.C.: Underdetermined Blind Source Separation Based on Sparse Representation. IEEE Trans. on Signal Processing (in print)
Li, Y.Q., Cichocki, A., Amari, S.: Blind estimation of channel parameters and source components for EEG signals: A sparse factorization approach. IEEE Transactions on Neural Networks (2006) (accepted for publication)
Brandwood, D.: A complex gradient operator and its application in adaptive array theory. Proc. Inst. Elect. Eng. 130, 11–16 (1983)
Parra, L., Spence, C.: Convolutive blind separation of non-stationary sources. IEEE Trans. Speech and audio processing 8(3), 320–327 (2000)
O’Grady, P.D., Pearlmutter, B.A.: Soft-LOST: EM on a mixture of oriented lines. In: International Conference on Independent Component Analysis 2004, pp. 428–435 (2004)
O’Grady, P.D., Pearlmutter, B.A.: Hard-LOST: Modified K-means for oriented lines. In: Proceedings of the Irish Signals and Systems Conference 2004, pp. 247–252 (2004)
Bofill, P., Zibulevsky, M.: Undetermined blind source separation using sparse representations. Signal processing 81, 2353–2362 (2001)
Li, Y.Q., Cichocki, A., Amari, S.: Analysis of sparse representation and blind source separation. Neural computation 16, 1193–1234 (2004)
Delgado, K.K., Murry, J.F., Rao, B.D., et al.: Dictionary learning algorithms for sparse representation. Neural computation 15, 349–396 (2003)
Takigawa, I., Kudo, M., Toyama, J.: Performance analysis of Minimum l1 -norm solutions for underdetermined source separation. IEEE Trans. Signal processing 52(3), 582–591 (2004)
Yilmaz, O., Rickard, S.: Blind separation of speech mixtures via time-frequency masking. IEEE Trans. Signal Processing 52(7), 1830–1847 (2004)
Theis, F.J., Georgiev, P.G., Cichocki, A.: Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform. In: Proceedings of 12th European Symposium on Artificial Neural Networks (ESANN 2004), Bruges, Belgium, April 2004, pp. 343–348 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, Z., Cichocki, A. (2006). K-EVD Clustering and Its Applications to Sparse Component Analysis. In: Rosca, J., Erdogmus, D., Príncipe, J.C., Haykin, S. (eds) Independent Component Analysis and Blind Signal Separation. ICA 2006. Lecture Notes in Computer Science, vol 3889. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11679363_12
Download citation
DOI: https://doi.org/10.1007/11679363_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32630-4
Online ISBN: 978-3-540-32631-1
eBook Packages: Computer ScienceComputer Science (R0)