Apprentissage discriminant des GMM à grande marge pour la vérification automatique du locuteur - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Apprentissage discriminant des GMM à grande marge pour la vérification automatique du locuteur

Abstract

Gaussian mixture models (GMM) have been widely and successfully used in speaker recognition during the last decades. They are generally trained using the generative criterion of maximum likelihood estimation. In an earlier work, we proposed an algorithm for discriminative training of GMM with diagonal covariances under a large margin criterion. In this paper, we present a new version of this algorithm which has the major advantage of being computationally highly efficient. The resulting algorithm is thus well suited to handle large scale databases. To show the effectiveness of the new algorithm, we carry out a full NIST speaker verification task using NIST-SRE'2006 data. The results show that our system outperforms the baseline GMM, and with high computational efficiency.
Fichier principal
Vignette du fichier
GRETSI-2011.pdf (68.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00647978 , version 1 (04-12-2011)

Identifiers

  • HAL Id : hal-00647978 , version 1

Cite

Reda Jourani, Khalid Daoudi, Régine André-Obrecht, Driss Aboutajdine. Apprentissage discriminant des GMM à grande marge pour la vérification automatique du locuteur. GRETSI, Sep 2011, Bordeaux, France. ⟨hal-00647978⟩
190 View
456 Download

Share

Gmail Facebook X LinkedIn More