title: Blind separation of positive sources by globally convergent gradient search.
abstract: The instantaneous noise-free linear mixing model in independent component analysis is largely a solved problem under the usual assumption of independent nongaussian sources and full column rank mixing matrix. However, with some prior information on the sources, like positivity, new analysis and perhaps simplified solution methods may yet become possible. In this letter, we consider the task of independent component analysis when the independent sources are known to be nonnegative and well grounded, which means that they have a nonzero pdf in the region of zero. It can be shown that in this case, the solution method is basically very simple: an orthogonal rotation of the whitened observation vector into nonnegative outputs will give a positive permutation of the original sources. We propose a cost function whose minimum coincides with nonnegativity and derive the gradient algorithm under the whitening constraint, under which the separating matrix is orthogonal. We further prove that in the Stiefel manifold of orthogonal matrices, the cost function is a Lyapunov function for the matrix gradient flow, implying global convergence. Thus, this algorithm is guaranteed to find the nonnegative well-grounded independent sources. The analysis is complemented by a numerical simulation, which illustrates the algorithm.
authors.affiliation: Neural Networks Research Centre, Helsinki University of Technology, 02015 HUT, Finland. erkki.oja@hut.fi
authors.forename: Erkki
authors.initials: E
authors.lastname: Oja
authors.forename: Mark
authors.initials: M
authors.lastname: Plumbley
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D006801:Humans; D007091:Image Processing, Computer-Assisted; D016013:Likelihood Functions; D016014:Linear Models; D017711:Nonlinear Dynamics; D012815:Signal Processing, Computer-Assisted