Sparse Component Analysis and Blind Source Separation of Underdetermined Mixtures
Top Cited Papers
- 18 July 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 16 (4), 992-996
- https://doi.org/10.1109/tnn.2005.849840
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.Keywords
This publication has 9 references indexed in Scilit:
- A geometric algorithm for overcomplete linear ICANeurocomputing, 2003
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimizationProceedings of the National Academy of Sciences, 2003
- Blind separation of disjoint orthogonal signals: demixing N sources from 2 mixturesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Adaptive Blind Signal and Image ProcessingPublished by Wiley ,2002
- Independent Component AnalysisPublished by Wiley ,2001
- Blind Source Separation by Sparse Decomposition in a Signal DictionaryNeural Computation, 2001
- Learning the parts of objects by non-negative matrix factorizationNature, 1999
- Blind source separation of more sources than mixtures using overcomplete representationsIEEE Signal Processing Letters, 1999
- Atomic Decomposition by Basis PursuitSIAM Journal on Scientific Computing, 1998