Simplified formulation of a depermutation criterion in convolutive blind source separation

R. Mazur, A. Mertins


For the separation of convolutive mixtures, an often used approach is the transformation to the time-frequency domain, where the problem is reduced to multiple instantaneous mixtures. This allows for the employment of well-known ICA algorithms. The drawbacks of this method are the inherent permutation and scaling problems. These ambiguities have to be corrected before a transformation back to the time domain can be carried out. The scaling ambiguity is usually solved using the minimal distortion principle. For the permutation problem, several approaches have been proposed. In this paper we propose a modification of an existing algorithm with the aim of simplifying the depermutation criterion and the corresponding computational effort while maintaining the same performance.
Original languageEnglish
Title of host publication2009 17th European Signal Processing Conference
Number of pages4
Place of PublicationGlasgow, UK
Publication date01.08.2009
ISBN (Print)978-161-7388-76-7
Publication statusPublished - 01.08.2009
Event17th European Signal Processing Conference - Glasgow, United Kingdom
Duration: 24.08.200928.08.2009
Conference number: 91099


Dive into the research topics of 'Simplified formulation of a depermutation criterion in convolutive blind source separation'. Together they form a unique fingerprint.

Cite this