Paper ID | SPE-54.4 |
Paper Title |
Integrating end-to-end neural and clustering-based diarization: Getting the best of both worlds |
Authors |
Keisuke Kinoshita, Marc Delcroix, Naohiro Tawara, NTT Corporation, Japan |
Session | SPE-54: End-to-End Speaker Diarization and Recognition |
Location | Gather.Town |
Session Time: | Friday, 11 June, 13:00 - 13:45 |
Presentation Time: | Friday, 11 June, 13:00 - 13:45 |
Presentation |
Poster
|
Topic |
Speech Processing: [SPE-SPKR] Speaker Recognition and Characterization |
IEEE Xplore Open Preview |
Click here to view in IEEE Xplore |
Virtual Presentation |
Click here to watch in the Virtual Conference |
Abstract |
Diarization technologies can be categorized into two approaches,i.e., clustering and end-to-end neural approaches, which have different pros and cons. The clustering-based approaches assign speaker labels to speech regions by clustering speaker embeddings such as x-vectors. While it can be seen as a current state-of-the-art approach that works for various challenging data with reasonable robustness and accuracy, it has a critical disadvantage that it cannot handle overlapped speech that is inevitable in natural conversational data. In contrast, the end-to-end neural diarization (EEND), which directly predicts diarization labels using neural networks, was devised to handle the overlapped speech. While the EEND has started outperforming the x-vector clustering approach in some realistic database, it is difficult to make it work for long recordings (e.g., recordings longer than 10 minutes) because of, e.g., its huge memory consumption. Block-wise processing is also difficult because it poses an inter-block label permutation problem, i.e., ambiguity of the speaker label assignments between blocks. In this paper, we propose a simple but effective hybrid diarization framework that works with overlapped speech and for long recordings containing an arbitrary number of speakers, and show that it works significantly better than the original EEND especially when the input data is long. |