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


     

This Article
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 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 Nadal, J.-P.
Right arrow Articles by Parga, N.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Nadal, J.-P.
Right arrow Articles by Parga, N.

Neural Computation, Vol 9, 1421-1456, Copyright © 1997 by The MIT Press

LETTERS

Redundancy Reduction and Independent Component Analysis: Conditions on Cumulants and Adaptive Approaches

Jean-Pierre Nadal and Nestor Parga

In the context of both sensory coding and signal processing, building factorized codes has been shown to be an efficient strategy. In a wide variety of situations, the signal to be processed is a linear mixture of statistically independent sources. Building a factorized code is then equivalent to performing blind source separation. Thanks to the linear structure of the data, this can be done, in the language of signal processing, by finding an appropriate linear filter, or equivalently, in the language of neural modeling, by using a simple feedforward neural network. In this article, we discuss several aspects of the source separation problem. We give simple conditions on the network output that, if satisfied, guarantee that source separation has been obtained. Then we study adaptive approaches, in particular those based on redundancy reduction and maximization of mutual information. We show how the resulting updating rules are related to the BCM theory of synaptic plasticity. Eventually we briefly discuss extensions to the case of nonlinear mixtures. Through-out this article, we take care to put into perspective our work with other studies on source separation and redundancy reduction. In particular we review algebraic solutions, pointing out their simplicity but also their drawbacks.


This article has been cited by other articles:


Home page
 Neural Comput.Home page
F. Creutzig and H. Sprekeler
Predictive Coding and the Slowness Principle: An Information-Theoretic Approach
Neural Comput., April 1, 2007; 20(4): 1026 - 1041.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
O. Schwartz, T. J. Sejnowski, and P. Dayan
Soft mixer assignment in a hierarchical generative model of natural scene statistics.
Neural Comput., November 1, 2006; 18(11): 2680 - 2718.
[Abstract] [Full Text] [PDF]

Home page
 Proc. Natl. Acad. Sci. USAHome page
T. Toyoizumi, J.-P. Pfister, K. Aihara, and W. Gerstner
Generalized Bienenstock-Cooper-Munro rule for spiking neurons that maximizes information transmission
PNAS, April 5, 2005; 102(14): 5239 - 5244.
[Abstract] [Full Text] [PDF]


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