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 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 Attias, H.
Right arrow Articles by Schreiner, C. E.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Attias, H.
Right arrow Articles by Schreiner, C. E.

Neural Computation, Vol 10, 1373-1424, Copyright © 1998 by The MIT Press

ARTICLES

Blind Source Separation and Deconvolution: the Dynamic Component Analysis Algorithm

H. Attias and C. E. Schreiner

We derive a novel family of unsupervised learning algorithms for blind separation of mixed and convolved sources. Our approach is based on formulating the separation problem as a learning task of a spatiotemporal generative model, whose parameters are adapted iteratively to minimize suitable error functions, thus ensuring stability of the algorithms. The resulting learning rules achieve separation by exploiting high-order spatiotemporal statistics of the mixture data. Different rules are obtained by learning generative models in the frequency and time domains, whereas a hybrid frequency-time model leads to the best performance. These algorithms generalize independent component analysis to the case of convolutive mixtures and exhibit superior performance on instantaneous mixtures. An extension of the relative-gradient concept to the spatiotemporal case leads to fast and efficient learning rules with equivariant properties. Our approach can incorporate information about the mixing situation when available, resulting in a "semiblind" separation method. The spatiotemporal redundancy reduction performed by our algorithms is shown to be equivalent to information-rate maximization through a simple network. We illustrate the performance of these algorithms by successfully separating instantaneous and convolutive mixtures of speech and noise signals.


This article has been cited by other articles:


Home page
 J. Neurophysiol.Home page
B. J. Malone, B. H. Scott, and M. N. Semple
Dynamic Amplitude Coding in the Auditory Cortex of Awake Rhesus Macaques
J Neurophysiol, September 1, 2007; 98(3): 1451 - 1474.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
M. Dyrholm, S. Makeig, and L. K. Hansen
Model Selection for Convolutive ICA with an Application to Spatiotemporal Analysis of EEG.
Neural Comput., April 1, 2007; 19(4): 934 - 955.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
S.-i. Amari
Estimating Functions of Independent Component Analysis for Temporally Correlated Signals
Neural Comput., September 1, 2000; 12(9): 2083 - 2107.
[Abstract] [Full Text]

Home page
 Neural Comput.Home page
H. Attias
Independent Factor Analysis
Neural Comput., May 15, 1999; 11(4): 803 - 851.
[Abstract] [Full Text]


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