Real-time speaker identification and verification

  • Kinnunen T
  • Karpov E
  • Fränti P
  • 39


    Mendeley users who have this article in their library.
  • 113


    Citations of this article.


In speaker identification, most of the computation originates from the distance or likelihood computations between the feature vectors of the unknown speaker and the models in the database. The identification time depends on the number of feature vectors, their dimensionality, the complexity of the speaker models and the number of speakers. In this paper, we concentrate on optimizing vector quantization (VQ) based speaker identification. We reduce the number of test vectors by pre-quantizing the test sequence prior to matching, and the number of speakers by pruning out unlikely speakers during the identification process. The best variants are then generalized to Gaussian mixture model (GMM) based modeling. We apply the algorithms also to efficient cohort set search for score normalization in speaker verification. We obtain a speed-up factor of 16:1 in the case of VQ-based modeling with minor degradation in the identification accuracy, and 34:1 in the case of GMM-based modeling. An equal error rate of 7% can be reached in 0.84 s on average when the length of test utterance is 30.4 s.

Author-supplied keywords

  • Gaussian mixture model (GMM)
  • Pre-quantizatlon
  • Real-time
  • Speaker pruning
  • Speaker recognition
  • Vector quantization (VQ)

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Tomi Kinnunen

  • Evgeny Karpov

  • Pasi Fränti

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free