Parallel implementation of a VQ-based text-independent speaker identification

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

Abstract

This study presents parallel implementation of a vector quantization (VQ) based text-independent speaker identification system that uses Melfrequency cepstrum coefficients (MFCC) for feature extraction, Linde-Buzo-Gray (LEG) VQ algorithm for pattern matching and Euclidean distance for match score calculation. Comparing meaningful characteristics of voice samples and matching them with similar ones requires large amount of transformations and comparisons, which result in large memory usage and disk access. When the cost of computations is considered, it states the main motivation for a parallel speaker identification implementation, where the parallelism is achieved using domain decomposition. In this paper, we present a set of experiments using the YOHO speaker corpus and observe the effects of several parameters as VQ size, number of MFCC filter banks and threshold value. First we focus on the serial algorithm and improve the algorithm to give the best success rates and provide a strong base for parallel implementation, where a clear performance improvement on speedup is obtained. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Soǧanci, R., Gürgen, F., & Topcuoǧlu, H. (2004). Parallel implementation of a VQ-based text-independent speaker identification. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3261, 291–300. https://doi.org/10.1007/978-3-540-30198-1_30

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