Open Access
March 2009 A time domain algorithm for blind separation of convolutive sound mixtures and L1 constrainted minimization of cross correlations
Jie Liu, Jack Xin, Yingyong Qi, Fan-Gang Zheng
Commun. Math. Sci. 7(1): 109-128 (March 2009).

Abstract

A time domain blind source separation algorithm of convolutive sound mixtures is studied based on a compact partial inversion formula in closed form. An L1-constrained minimization problem is formulated to find demixing filter coefficients for source separation while capturing scaling invariance and sparseness of solutions. The minimization aims to reduce (lagged) cross correlations of the mixture signals, which are modeled stochastically. The problem is non-convex, however it is put in a nonlinear least squares form where the robust and convergent Levenberg-Marquardt iterative method is applicable to compute local minimizers. Efficiency is achieved in recovering lower dimensional demixing filter solutions than the physical ones. Computations on recorded and synthetic mixtures show satisfactory performance, and are compared with other iterative methods.

Citation

Download Citation

Jie Liu. Jack Xin. Yingyong Qi. Fan-Gang Zheng. "A time domain algorithm for blind separation of convolutive sound mixtures and L1 constrainted minimization of cross correlations." Commun. Math. Sci. 7 (1) 109 - 128, March 2009.

Information

Published: March 2009
First available in Project Euclid: 27 March 2009

zbMATH: 1173.94373
MathSciNet: MR2512835

Subjects:
Primary: 65C60 , 65H10 , 94A12

Keywords: blind source separation , compact partial inversion , Convolutive mixtures , L1 constrained decorrelation

Rights: Copyright © 2009 International Press of Boston

Vol.7 • No. 1 • March 2009
Back to Top