title: Complex ICA by negentropy maximization.
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.
authors.affiliation: University of Maryland, Baltimore, MD 21250, USA. mnovey1@umbc.edu
authors.forename: M
authors.initials: M
authors.lastname: Novey
authors.forename: T
authors.initials: T
authors.lastname: Adali
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D016571:Neural Networks, Computer; D017711:Nonlinear Dynamics; D025341:Principal Component Analysis