A Sparsity-Based Method to Solve Permutation Indeterminacy in Frequency-Domain Convolutive Blind Source Separation

摘要

Existing methods for frequency-domain estimation of mixing filters in convolutive blind source separation (BSS) suffer from permutation and scaling indeterminacies in sub-bands. However, if the filters are assumed to be sparse in the time domain, it is shown in this paper that the l_1-norm of the filter matrix increases as the sub-band coefficients are permuted. With this motivation, an algorithm is then presented which solves the source permutation indeterminacy, provided there is no scaling indeterminacy in sub-bands. The robustness of the algorithm to noise is also presented.