Information-theoretic approach to blind separation of sources in non-linear mixture
Signal Processing - Special issue on neural networks
Natural gradient works efficiently in learning
Neural Computation
Independent component analysis: algorithms and applications
Neural Networks
Equi-convergence Algorithm for Blind Separation of Sources with Arbitrary Distributions
IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Bio-inspired Applications of Connectionism-Part II
Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications
Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications
Swarm Intelligence in Data Mining (Studies in Computational Intelligence)
Swarm Intelligence in Data Mining (Studies in Computational Intelligence)
Source separation in post-nonlinear mixtures
IEEE Transactions on Signal Processing
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Nonlinear blind source separation using higher order statistics anda genetic algorithm
IEEE Transactions on Evolutionary Computation
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
Nonlinear blind source separation using a radial basis function network
IEEE Transactions on Neural Networks
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Extracting independent source signals from their nonlinear mixtures is a very important issue in many realistic models. This paper proposes a new method for solving nonlinear blind source separation (NBSS) problems by exploiting particle swarm optimization (PSO) algorithm and natural gradient descent. First, we address the problem of separation of mutually independent sources in post-nonlinear mixtures. The natural gradient descent is used to estimate the separation matrix. Then we define the mutual information between output signals as the fitness function of PSO. The mutual information is used to measure the statistical dependence of the outputs of the demixing system. PSO can rapidly obtain the globally optimal coefficients of the higher order polynomial functions. Compared to conventional NBSS approaches, the main characteristics of this method are its simplicity, the rapid convergence and high accuracy. In particular, it is robust against local minima in search for inverse functions. Experiments are discussed to demonstrate these results.