In this paper we address the problem of blind source extraction of a subset of "interesting" independent sources from a linear convolutive or instantaneous mixture. The interesting sources are those which are independent and, in a certain sense, are sparse and far away from Gaussianity. We show that in the low-noise limit and when none of the desired sources is Gaussian, the minimum entropy and cumulants based approaches can solve the problem. These criteria, with roots in Blind Deconvolution and in Projection Pursuit, will be proposed here for the simultaneous blind extraction of a group of independent sources. Then, we suggest simple algorithms which, working on the Stiefel manifold perform maximization of the proposed contrast functions. © Springer-Verlag Berlin Heidelberg 2001.
CITATION STYLE
Cruces, S., Cichocki, A., & Amari, S. I. (2001). The minimum entropy and cumulants based contrast functions for blind source extraction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2085 LNCS, pp. 786–793). Springer Verlag. https://doi.org/10.1007/3-540-45723-2_95
Mendeley helps you to discover research relevant for your work.