Entropy optimization by the PFANN network: application to blind source separation

Authors
Citation
S. Fiori, Entropy optimization by the PFANN network: application to blind source separation, NETWORK-COM, 10(2), 1999, pp. 171-186
Citations number
29
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
NETWORK-COMPUTATION IN NEURAL SYSTEMS
ISSN journal
0954898X → ACNP
Volume
10
Issue
2
Year of publication
1999
Pages
171 - 186
Database
ISI
SICI code
0954-898X(199905)10:2<171:EOBTPN>2.0.ZU;2-R
Abstract
The aim of this paper is to present a study of polynomial functional-link n eural units that learn through an information-theoretic-based criterion. Fi rst the structure of the neuron is presented and the unsupervised learning theory is explained and discussed, with particular attention being paid to its probability density function and cumulative distribution function appro ximation capability. Then a neural network formed by such neurons (the poly nomial functional-link artificial neural network, or PFANN) is shown to be able to separate out linearly mixed eterokurtic source signals, i.e. signal s endowed with either positive or negative kurtoses. In order to compare th e performance of the proposed blind separation technique with those exhibit ed by existing methods, the mixture of densities (MOD) approach of Xu et al , which is closely related to PFANN, is briefly recalled; then comparative numerical simulations performed on both synthetic and real-world signals an d a complexity evaluation are illustrated. These results show that the PFAN N approach gives similar performance with a noticeable reduction in computa tional effort.