DocumentCode
1051750
Title
Complex ICA by Negentropy Maximization
Author
Novey, Michael ; Adali, Tulay
Author_Institution
Univ. of Maryland Baltimore County, Baltimore
Volume
19
Issue
4
fYear
2008
fDate
4/1/2008 12:00:00 AM
Firstpage
596
Lastpage
609
Abstract
In this paper, we use complex analytic functions to achieve independent component analysis (ICA) by maximization of non-Gaussianity and introduce the complex maximization of non-Gaussianity (CMN) algorithm. We derive both a gradient-descent and a quasi-Newton algorithm that use the full second-order statistics providing superior performance with circular and noncircular sources as compared to existing methods. We show the connection among ICA methods through maximization of non-Gaussianity, mutual information, and maximum likelihood (ML) for the complex case, and emphasize the importance of density matching for all three cases. Local stability conditions are derived for the CMN cost function that explicitly show the effects of noncircularity on convergence and demonstrated through simulation examples.
Keywords
independent component analysis; optimisation; source separation; complex maximization; independent component analysis; maximum likelihood; negentropy maximization; nonGaussianity algorithm; quasiNewton algorithm; second-order statistics; Complex-valued data; independent component analysis (ICA); quasi-Newton algorithm; Algorithms; Computer Simulation; Neural Networks (Computer); Nonlinear Dynamics; Principal Component Analysis;
fLanguage
English
Journal_Title
Neural Networks, IEEE Transactions on
Publisher
ieee
ISSN
1045-9227
Type
jour
DOI
10.1109/TNN.2007.911747
Filename
4443874
Link To Document