Blind Source Separation Using the Block-Coordinate Relative Newton Method

Presented here is a generalization of the modified relative Newton method, recently proposed in [1] for quasi-maximum likelihood blind source separation. Special structure of the Hessian matrix allows to perform block-coordinate Newton descent, which significantly reduces the algorithm computational complexity and boosts its performance. Simulations based on artificial and real data show that the separation quality using the proposed algorithm outperforms other accepted blind source separation methods.

• Type: Conference
• Year: 2004
• Where: ICA
• Authors: Alexander M. Bronstein, Michael M. Bronstein, Michael Zibulevsky
• Keywords: Algorithm Computational Complexity, Blind Source Separation, ICA 2004, Likelihood Blind Source