A Robust Speaker Clustering Algorithm
In this paper, we present a novel speaker segmentation and clustering algorithm. The algorithm automatically performs both speaker segmentation and clustering without any prior knowledge of the identities or the number of speakers. Advantages of this algorithm over other approaches are: no need for training/development data, no threshold adjustment requirements, and robustness to different data conditions. This paper also reports the performance of the algorithm on different datasets released by NIST with different initial conditions and parameter settings. The consistently low speaker diarization error rate clearly indicates the robustness of the algorithm.
- URL: http://publications.idiap.ch/downloads/reports/2003/ajmera2003asru.pdf
- Related documents: http://publications.idiap.ch/index.php/publications/showcite/ajmera-rr-03-38
Record created on 2006-03-10, modified on 2016-08-08