In speaker verification (SV) systems based on a support vector machine (SVM) using Gaussian mixture model (GMM) supervectors, a large portion of the test-stage computational load is the calculation of the a posteriori probabilities of the feature vectors for the given universal background model (UBM). Furthermore, the calculation of the sufficient statistics for the mean also contributes substantially to computational load. In this paper, we propose several methods to cluster the GMM-UBM mixture components in order to reduce the computational load and speed up the verification. In the adaptation stage, we compare the feature vectors to the clusters and calculate the a posteriori probabilities and update the statistics exclusively for mixture components belonging to appropriate clusters. Our results, demonstrate that (on average) we can, reduce the number of a posteriori probability calculations by a factor up to 2.8x without loss in accuracy.
Index Terms: speaker recognition, clustering methods
Bibliographic reference. McClanahan, Richard D. / Leon, Phillip L. De (2012): "Mixture component clustering for efficient speaker verification", In INTERSPEECH-2012, 1087-1090.