Sparse component analysis and blind source separation of underdetermined mixtures
Lists
Only you see this
Abstract
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.
BibTeX
@article{georgiev2005sparse,
author = {Pando G. Georgiev and Fabian J. Theis and Andrzej Cichocki},
title = {{Sparse component analysis and blind source separation of underdetermined mixtures}},
journal = {IEEE Trans. Neural Networks},
year = {2005},
url = {https://openreview.net/forum?id=nbx5A1LRvA},
}Loading related content...