In this letter, we solve the problem of identifying matrices S /spl isin/ /spl Ropf//sup n/spl times/N/ and A /spl isin/ /spl Ropf//sup m/spl times/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.
Sparse component analysis and blind source separation of underdetermined mixtures
Pando G. Georgiev,Fabian J Theis,A. Cichocki
Published 2005 in IEEE Transactions on Neural Networks
ABSTRACT
PUBLICATION RECORD
- Publication year
2005
- Venue
IEEE Transactions on Neural Networks
- Publication date
2005-07-01
- Fields of study
Medicine, Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar, PubMed
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-18 of 18 references · Page 1 of 1