Blind separation of bilinear mixtures using mutual information minimization
Résumé
In this paper an approach for blind source separation in bilinear (or linear quadratic) mixtures is presented. The proposed algorithm employs the same recurrent structure as [Hosseini and Deville, 2003] for separating these mixtures. However, instead of maximal likelihood, our algorithm is based on minimizing the mutual information of the outputs for recovering the independent components. Simulation results show the efficiency of the proposed algorithm.
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...