title: Sparse component analysis and blind source separation of underdetermined mixtures.
abstract: 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.
authors.forename: Pando
authors.initials: P
authors.lastname: Georgiev
authors.forename: Fabian
authors.initials: F
authors.lastname: Theis
authors.forename: Andrzej
authors.initials: A
authors.lastname: Cichocki
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D010363:Pattern Recognition, Automated / Q000379:methods*