SuperLectures.com

A SPARSITY BASED CRITERION FOR SOLVING THE PERMUTATION AMBIGUITY IN CONVOLUTIVE BLIND SOURCE SEPARATION

Full Paper at IEEE Xplore

Non-negative Tensor Factorization and Blind Separation

Přednášející: Radoslaw Mazur, Autoři: Radoslaw Mazur, Alfred Mertins, University of Luebeck, Germany

In this paper, we present a new algorithm for solving the permutation ambiguity in convolutive blind source separation. A common approach for separation of convolutive mixtures is the transformation to the time-frequency domain, where the convolution becomes a multiplication. This allows for the use of well-known instantaneous ICA algorithms independently in each frequency bin. However, this simplification leads to the problem of correctly aligning these single bins previously to the transformation to the time domain. Here, we propose a new criterion for solving this ambiguity. The new approach is based on the sparsity of the speech signals and yields a robust depermutation algorithm. The results will be shown on real-world examples.


  Přepis řeči

|

  Slajdy

Zvětšit slajd | Zobrazit všechny slajdy

0:00:16

  1. slajd

0:00:52

  2. slajd

0:01:35

  3. slajd

0:02:12

  4. slajd

0:02:37

  5. slajd

0:06:31

  6. slajd

0:06:57

  7. slajd

0:11:52

  8. slajd

0:14:03

  9. slajd

0:16:22

 10. slajd

  Komentáře

Please sign in to post your comment!

  Informace o přednášce

Nahráno: 2011-05-26 17:55 - 18:15, Club B
Přidáno: 22. 6. 2011 01:35
Počet zhlédnutí: 16
Rozlišení videa: 1024x576 px, 512x288 px
Délka videa: 0:17:52
Audio stopa: MP3 [6.03 MB], 0:17:52