Neural Comp. Sign up for ETOCS
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 Yang, H. H.
Right arrow Articles by Amari, S.-i.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Yang, H. H.
Right arrow Articles by Amari, S.-i.

Neural Computation, Vol 9, 1457-1482, Copyright © 1997 by The MIT Press

LETTERS

Adaptive On-line Learning Algorithms for Blind Separation-Maximization Entropy and Minimum Mutual Information

Howard Hua Yang and Shun-ichi Amari

There are two major approaches for blind separation: maximum entropy (ME)andminimummutual information (MMI). Both can be implemented by the stochastic gradient descent method for obtaining the demixing ma-trix. The MI is the contrast function for blind separation; the entropy is not. To justify the ME, the relation between ME and MMI is first eluci-dated by calculating the first derivative of the entropy and proving that the mean subtraction is necessary in applying the ME and at the solution points determined by the MI, the MEwill not update the demixing matrix in the directions of increasing the cross-talking.


This article has been cited by other articles:


Home page
 Neural Comput.Home page
M. M. Van Hulle
Sequential Fixed-Point ICA Based on Mutual Information Minimization
Neural Comput., May 1, 2008; 20(5): 1344 - 1365.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
S. Fiori
A Theory for Learning by Weight Flow on Stiefel-Grassman Manifold
Neural Comput., July 1, 2001; 13(7): 1625 - 1647.
[Abstract] [Full Text]

Home page
 Neural Comput.Home page
S.-i. Amari
Natural Gradient Learning for Over- and Under-Complete Bases in ICA
Neural Comput., November 15, 1999; 11(8): 1875 - 1883.
[Abstract] [Full Text]

Home page
 Neural Comput.Home page
J. Basak and S.-i. Amari
Blind Separation of a Mixture of Uniformly Distributed Source Signals: A Novel Approach
Neural Comput., May 15, 1999; 11(4): 1011 - 1034.
[Abstract] [Full Text]


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