Distributed genetic algorithm for Gaussian mixture model based speaker identification

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a novel algorithm for reducing the computational complexity of identifying a speaker within a Gaussian mixture speaker model (GMM) framework. We have combined distributed genetic algorithm (DGA) and the Markov random field (MRF) to avoid typical local minima for speaker vector quantization. To improve the computation efficiency, only unstable chromosomes corresponding to speaker data parts are evolved. Identification accuracies of 93% were achieved for 100 Mandarin speakers. © 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Lung, S. Y. (2003). Distributed genetic algorithm for Gaussian mixture model based speaker identification. Pattern Recognition, 36(10), 2479–2481. https://doi.org/10.1016/S0031-3203(02)00375-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free