Optimized dyadic sorting for solving the permutation ambiguity in acoustic blind source separation

R. Mazur, J. O. Jungmann, A. Mertins

Abstract

In this paper, we propose a modification to dyadic sorting scheme used for the permutation problemin convolutive blind source separation. In the frequency domain, the problem of separation of sources can be reduced to multiple instantaneous problems, which are easily solvable using independent component analysis. However, this simplified method leads to the problem of correctly aligning and scaling of the single frequency bins. These ambiguities need to be solved before the transformation to the time domain, as otherwise the separation process will fail. In this paper we combine dyadic sorting with an optimized way of calculation of correlation coefficients by using spectral summation. The improved performance will we shown on real world examples.
Original languageEnglish
Title of host publication21st European Signal Processing Conference (EUSIPCO 2013)
Number of pages5
PublisherIEEE
Publication date01.09.2013
Pages1-5
Article number6811394
ISBN (Electronic)978-0-9928626-0-2
Publication statusPublished - 01.09.2013
Event2013 21st European Signal Processing Conference - Marrakech, Morocco
Duration: 09.09.201313.09.2013
Conference number: 105230

Fingerprint

Dive into the research topics of 'Optimized dyadic sorting for solving the permutation ambiguity in acoustic blind source separation'. Together they form a unique fingerprint.

Cite this