By Topic

Text-dependent speaker identification using circular hidden Markov models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zheng, Y.-C. ; Inst. of Inf. Sci., Northern Jiaoing Univ., Beijing, China ; Yuan, B.-Z.

A brief overview of hidden Markov models is given. The properties of circular hidden Markov models and their application to speaker recognition are discussed. For each person, a distinct reference CHMM is produced using the Baum forward-and-backward algorithm. Classification is carried out by selecting the model with the highest probability as the speaker identification system output. Preliminary testing on a set of ten speakers indicates a performance of about 94% speaker recognition accuracy

Published in:

Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Date of Conference:

11-14 Apr 1988