|
|
||||||||
Letter |
California Institute of Technology, Pasadena, CA 91125, U.S.A.
California Institute of Technology, Pasadena, CA 91125, U.S.A.
We introduce a novel way of performing independent component analysis using a constrained version of the expectation-maximization (EM) algorithm. The source distributions are modeled as D one-dimensional mixtures of gaussians. The observed data are modeled as linear mixtures of the sources with additive, isotropic noise. This generative model is fit to the data using constrained EM. The simpler "soft-switching" approach is introduced, which uses only one parameter to decide on the sub- or supergaussian nature of the sources. We explain how our approach relates to independent factor analysis.
This article has been cited by other articles:
![]() |
H. Xiong and Y. Choe Structural systems identification of genetic regulatory networks Bioinformatics, February 15, 2008; 24(4): 553 - 560. [Abstract] [Full Text] [PDF] |
||||
![]() |
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] |
||||
![]() |
Y. Xia and G. Feng On Convergence Conditions of an Extended Projection Neural Network Neural Comput., March 1, 2005; 17(3): 515 - 525. [Abstract] [Full Text] [PDF] |
||||
![]() |
J. Ma, Z. Liu, and L. Xu A Further Result on the ICA One-Bit-Matching Conjecture Neural Comput., February 1, 2005; 17(2): 331 - 334. [Abstract] [Full Text] [PDF] |
||||
![]() |
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 |