Particle swarm optimization for sorted adapted Gaussian mixture models

  • Authors:

  • Rahim Saeidi;Hamid Reza Sadegh Mohammadi;Todor Ganchev;Robert David Rodman

  • Affiliations:

  • Iranian Research Institute for Electrical Engineering, Academic Center for Education, Culture, and Research, Tehran, Iran;Iranian Research Institute for Electrical Engineering, Academic Center for Education, Culture, and Research, Tehran, Iran;Wire Communications Laboratory, Electrical and Computer Engineering Department, University of Patras, Rio-Patras, Greece;Department of Computer Science, North Carolina State University, Raleigh, NC

  • Venue:
  • IEEE Transactions on Audio, Speech, and Language Processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, we introduced the sorted Gaussian mixture models (SGMMs) algorithm providing the means to tradeoff performance for operational speed and thus permitting the speed-up of GMM-based classification schemes. The performance of the SGMM algorithm depends on the proper choice of the sorting function, and the proper adjustment of its parameters. In the present work, we employ particle swarm optimization (PSO) and an appropriate fitness function to find the most advantageous parameters of the sorting function. We evaluate the practical significance of our approach on the text-independent speaker verification task utilizing the NIST 2002 speaker recognition evaluation (SRE) database while following the NIST SRE experimental protocol. The experimental results demonstrate a superior performance of the SGMM algorithm using PSO when compared to the original SGMM. For comprehensiveness we also compared these results with those from a baseline Gaussian mixture model-universal background model (GMM-UBM) system. The experimental results suggest that the performance loss due to speed-up is partially mitigated using PSO-derived weights in a sorted GMM-based scheme.