Identifiability conditions and subspace clustering in sparse BSS

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give general identifiability conditions on the source matrix in Blind Signal Separation problem. They refine some previously known ones. We develop a subspace clustering algorithm, which is a generalization of the k-plane clustering algorithm, and is suitable for separation of sparse mixtures with bigger sparsity (i.e. when the number of the sensors is bigger at least by 2 than the number of non-zero elements in most of the columns of the source matrix). We demonstrate our algorithm by examples in the square and underdetermined cases. The latter confirms the new identifiability conditions which require less hyperplanes in the data for full recovery of the sources and the mixing matrix. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Georgiev, P., Theis, F., & Ralescu, A. (2007). Identifiability conditions and subspace clustering in sparse BSS. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4666 LNCS, pp. 357–364). Springer Verlag. https://doi.org/10.1007/978-3-540-74494-8_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free