Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 992-996 |
Number of pages | 5 |
Journal | IEEE Transactions on Neural Networks |
Volume | 16 |
Issue number | 4 |
DOIs | |
State | Published - Jul 2005 |
Externally published | Yes |
Keywords
- Blind source separation (BSS)
- Sparse component analysis (SCA)
- Underdetermined mixtures