|
|
||||||||
Neural Computation, Vol 10, 2103-2114, Copyright © 1998 by The MIT Press
LETTERS |
Mark Girolami
This article develops an extended independent component analysis algorithm for mixtures of arbitrary subgaussian and supergaussian sources. The gaussian mixture model of Pearson is employed in deriving a closed-form generic score function for strictly subgaussian sources. This is combined with the score function for a unimodal supergaussian density to provide a computationally simple yet powerful algorithm for performing independent component analysis on arbitrary mixtures of nongaussian sources.
This article has been cited by other articles:
![]() |
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] |
||||
![]() |
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] |
||||
![]() |
R. A. Choudrey and S. J. Roberts Variational Mixture of Bayesian Independent Component Analyzers Neural Comput., January 1, 2003; 15(1): 213 - 252. [Abstract] [Full Text] [PDF] |
||||
![]() |
P. A.d.F.R. Hojen-Sorensen, O. Winther, and L. K. Hansen Mean-Field Approaches to Independent Component Analysis Neural Comput., April 1, 2002; 14(4): 889 - 918. [Abstract] [Full Text] [PDF] |
||||
![]() |
A. Hyvärinen Complexity Pursuit: Separating Interesting Components from Time Series Neural Comput., April 1, 2001; 13(4): 883 - 898. [Abstract] [Full Text] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| J COGNITIVE NEUROSCIENCE | NEURAL COMPUTATION | MIT PRESS JOURNALS |