INTERSPEECH 2013
14thAnnual Conference of the International Speech Communication Association

Lyon, France
August 25-29, 2013

Towards a More Efficient SVM Supervector Speaker Verification System Using Gaussian Reduction and a Tree-Structured Hash

Richard D. McClanahan (1), Phillip L. De Leon (2)

(1) Sandia National Laboratories, USA
(2) New Mexico State University, USA

Speaker verification (SV) systems that employ maximum a posteriori (MAP) adaptation of a Gaussian mixture model (GMM) universal background model (UBM) incur a significant test-stage com- putational load in the calculation of a posteriori probabilities and sufficient statistics. We propose a multi-layered hash system employing a tree-structured GMM which uses Runnalls' GMM reduction technique. The proposed method is applied only to the test stage and does not require any modifications to the training stage or previously-trained speaker models. With the tree-structured hash system we are able to achieve a factor of 8~ reduction in test-stage computation with no degradation in accuracy. Furthermore, we can achieve computational reductions greater than 21~ with less than 7.5% relative degradation in accuracy.

Full Paper

Bibliographic reference.  McClanahan, Richard D. / Leon, Phillip L. De (2013): "Towards a more efficient SVM supervector speaker verification system using Gaussian reduction and a tree-structured hash", In INTERSPEECH-2013, 3670-3673.