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. Our algorithm uses "standard" speech processing components...

Full description

Saved in:
Bibliographic Details
Main Authors: Ajmera, J., Wooters, C.
Format: Conference Proceeding
Language:English
Subjects:
Bayesian methods
Clustering algorithms
Error analysis
Hidden Markov models
Information retrieval
Iterative algorithms
NIST
Robustness
Speech processing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. Our algorithm uses "standard" speech processing components and techniques such as HMM, agglomerative clustering, and the Bayesian information criterion. However, we have combined and modified these so as to produce an algorithm with the following advantages: no threshold adjustment requirements; no need for training/development data; and robustness to different data conditions. This paper also reports the performance of this algorithm on different datasets released by the USA National Institute of Standards and Technology (NIST) with different initial conditions and parameter settings. The consistently low speaker-diarization error rate clearly indicates the robustness and utility of the algorithm.
DOI:10.1109/ASRU.2003.1318476