Sciweavers

Share
ICA
2007
Springer

Solving the Permutation Problem in Convolutive Blind Source Separation

10 years 4 months ago
Solving the Permutation Problem in Convolutive Blind Source Separation
Abstract. This paper presents a new algorithm for solving the permutation ambiguity in convolutive blind source separation. When transformed to the frequency domain, the source separation problem reduces to independent instantaneous separation in each frequency bin, which can be efficiently solved by existing algorithms. But this independency leads to the problem of correct alignment of these single bins which is still not entirely solved. The algorithm proposed in this paper models the frequency-domain separated signals using the generalized Gaussian distribution and utilizes the small deviation of the exponent between neighboring bins for the detection of correct permutations.
Radoslaw Mazur, Alfred Mertins
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ICA
Authors Radoslaw Mazur, Alfred Mertins
Comments (0)
books