Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Everson, R.
Right arrow Articles by Roberts, S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Everson, R.
Right arrow Articles by Roberts, S.
(Neural Computation. 1999;11:1957-1983.)
© 1999 The MIT Press


Letter

Independent Component Analysis: A Flexible Nonlinearity and Decorrelating Manifold Approach

Richard Everson

Department of Electrical and Electronic Engineering, Imperial College of Science, Technology and Medicine, London, U.K.

Stephen Roberts

Department of Electrical and Electronic Engineering, Imperial College of Science, Technology and Medicine, London, U.K.

Independent component analysis (ICA) finds a linear transformation to variables that are maximally statistically independent. We examine ICA and algorithms for finding the best transformation from the point of view of maximizing the likelihood of the data. In particular, we discuss the way in which scaling of the unmixing matrix permits a "static" nonlinearity to adapt to various marginal densities. We demonstrate a new algorithm that uses generalized exponential functions to model the marginal densities and is able to separate densities with light tails.

We characterize the manifold of decorrelating matrices and show that it lies along the ridges of high-likelihood unmixing matrices in the space of all unmixing matrices. We show how to find the optimum ICA matrix on the manifold of decorrelating matrices, and as an example we use the algorithm to find independent component basis vectors for an ensemble of portraits.




This article has been cited by other articles:


Home page
Neural Comput.Home page
L. Xu
One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics.
Neural Comput., February 1, 2007; 19(2): 546 - 569.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
Z.-Y. Liu, K.-C. Chiu, and L. Xu
One-Bit-Matching Conjecture for Independent Component Analysis
Neural Comput., February 1, 2004; 16(2): 383 - 399.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1999 by The MIT Press.