Sparse Component Analysis and Blind Source Separation of Underdetermined Mixtures

Zusammenfassung

In this letter, we solve the problem of identifying matrices S is an element of R-n x N and A is an element of R-m x n knowing only their multiplication X = AS, under some conditions, expressed either in terms of A and sparsity of S (identifiability conditions), or in terms of X (sparse component analysis (SCA) conditions). We present algorithms for such identification and illustrate them by examples.