Neural Diarization with Non-autoregressive Intermediate Attractors

Yusuke Fujita, Tatsuya Komatsu, Robin Scheibler, Yusuke Kida, Tetsuji Ogawa
3/13/2023
eess.AScs.CLcs.SD

No official code found. Best implementation: hitachi-speech/EEND (435 stars, MIT, last commit 2021-08-30).

Abstract

End-to-end neural diarization (EEND) with encoder-decoder-based attractors (EDA) is a promising method to handle the whole speaker diarization problem simultaneously with a single neural network. While the EEND model can produce all frame-level speaker labels simultaneously, it disregards output label dependency. In this work, we propose a novel EEND model that introduces the label dependency between frames. The proposed method generates non-autoregressive intermediate attractors to produce speaker labels at the lower layers and conditions the subsequent layers with these labels. While the proposed model works in a non-autoregressive manner, the speaker labels are refined by referring to the whole sequence of intermediate labels. The experiments with the two-speaker CALLHOME dataset show that the intermediate labels with the proposed non-autoregressive intermediate attractors boost the diarization performance. The proposed method with the deeper network benefits more from the intermediate labels, resulting in better performance and training throughput than EEND-EDA.

View on arXivView PDF

Code Implementations(1)

hitachi-speech/EENDCommunity100%
MIT

End-to-End Neural Diarization

43564Perl, ShellSep 12, 20195 years agoMIT
chainerdeep-learningeendend-to-endkaldi+2 more

Similar Papers

Cite this paper

@article{fujita2023neural,
  title  = {Neural Diarization with Non-autoregressive Intermediate Attractors},
  author = {Yusuke Fujita and Tatsuya Komatsu and Robin Scheibler and Yusuke Kida and Tetsuji Ogawa},
  year   = {2023},
  eprint = {2303.06806},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.06806v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.06806.svg)](https://codeofpaper.com/paper/2303.06806)

Discussion