Solving the permutation problem in convolutive blind source separation

  • Authors:
  • Radoslaw Mazur;Alfred Mertins

  • Affiliations:
  • Institute for Signal Processing, University of Lübeck, Lübeck, Germany;Institute for Signal Processing, University of Lübeck, Lübeck, Germany

  • Venue:
  • ICA'07 Proceedings of the 7th international conference on Independent component analysis and signal separation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.