Overcomplete blind source separation of finite alphabet sources

IEICE Transactions on Information and Systems

Volumn E84-D, Issue 1, 2001, Pages 209-212

  Ihmt, Bin Chul ^a   Park, Dong Jo ^a   Kwon, Young Hyun ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Blind source separation; Initialization; Maximum likelihood; Ovcrcomplete; Step size

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; MATRIX ALGEBRA; MAXIMUM LIKELIHOOD ESTIMATION; THEOREM PROVING;

FINITE ALPHABET SOURCES; MIXING MATRIX;

BLIND SOURCE SEPARATION;

EID: 0035126678     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (5)

1. T.W. Lee, Independent component analysis, theory and applications, Kluwer Academic Publishers, 1998.
2. T.W. Lee, M.S. Lewicki, M. Girolami, and T.J. Sejnowski, "Blind source separation of more sources than mixtures using overcomplete representations," IEEE Sig. Proc. Lett., vol.G, no.4, pp.87-90, April 1999.
3. J. Lin, D. Grier, and J. Cowan, "Feature extraction approach to blind source separation," IEEE Workshop on Neural Networks for Sig. Proc., pp.398-405, 1997.
4. P. Pajunen, "Blind separation of binary sources with less sensors than sources," Proc. Int. Con. on Neural Networks, pp. 1994-1997, Texas, 1997.
5. P. Pajunen and J. Karhunen, "A maximum likelihood approach to nonlinear blind source separation," Proc. ICANN, pp.541-546, Lausanne, 1997.