Sparse Component Analysis and Blind Source Separation of Underdetermined Mixtures

Abstract

We solve the problem of identifying matrices S and A 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 conditions). We present algorithms for such identification and illustrate them by examples.