TY - JOUR
T1 - Sparse component analysis and blind source separation of underdetermined mixtures
AU - Georgiev, Pando
AU - Theis, Fabian
AU - Cichocki, Andrzej
PY - 2005/7
Y1 - 2005/7
N2 - In this letter, we solve the problem of identifying matrices S ∈ ℝn×N and A ∈ ℝm×n knowing only their multiplication X = AS, under some conditions, expressed either in terms of A and sparsity of S (identifi-ability conditions), or in terms of X (sparse component analysis (SCA) conditions). We present algorithms for such identification and illustrate them by examples.
AB - In this letter, we solve the problem of identifying matrices S ∈ ℝn×N and A ∈ ℝm×n knowing only their multiplication X = AS, under some conditions, expressed either in terms of A and sparsity of S (identifi-ability conditions), or in terms of X (sparse component analysis (SCA) conditions). We present algorithms for such identification and illustrate them by examples.
KW - Blind source separation (BSS)
KW - Sparse component analysis (SCA)
KW - Underdetermined mixtures
UR - http://www.scopus.com/inward/record.url?scp=23044451368&partnerID=8YFLogxK
U2 - 10.1109/TNN.2005.849840
DO - 10.1109/TNN.2005.849840
M3 - Article
C2 - 16121741
AN - SCOPUS:23044451368
SN - 1045-9227
VL - 16
SP - 992
EP - 996
JO - IEEE Transactions on Neural Networks
JF - IEEE Transactions on Neural Networks
IS - 4
ER -