Penalty function approach for constrained convolutive blind source separation

Abstract

A new approach for convolutive blind source separation (BSS) using penalty functions is proposed in this paper. Motivated by nonlinear programming techniques for the constrained optimization problem, it converts the convolutive BSS into a joint diagonalization problem with unconstrained optimization. Theoretical analyses together with numerical evaluations reveal that the proposed method not only improves the separation performance by significantly reducing the effect of large errors within the elements of covariance matrices at low frequency bins and removes the degenerate solution induced by a null unmixing matrix, but also provides an unified framework to constrained BSS. © Springer-Verlag 2004.