By Topic

Accelerating Speech Recognition Algorithm with Synergic Hidden Markov Model and Genetic Algorithm Based on Cellular Automata

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

3 Author(s)
Mosleh, M. ; Dept. of Comput. Eng., Islamic Azad Univ., Dezful, Iran ; Setayeshi, S. ; Kheyrandish, M.

One of the best current methods for modeling dynamic speech signal is using of HMM model. The speech recognition systems based on HMM can be able to compute the best likelihood measure between unknown input pattern and reference models by using Viterbi algorithm. Whereas such algorithm is based on dynamic programming, it consists of many computations with increasing number of reference words. In this paper, we will present a new evolutionary methodology based on synergic HMM and GA that will be able to compute likelihood measurement between unknown input pattern and reference patterns in the parallel form and based on cellular automata. We introduce this algorithm as HGC. The HGC algorithm will be compared with the Viterbi algorithm from theldquorecognition accuracyrdquo and ldquorecognition speedrdquo viewpoints. Obtained results show that the HGC and Viterbi algorithms are close from ldquorecognition accuracyrdquo viewpoint, but HGCisso faster than the Viterbi.

Published in:

2009 International Conference on Signal Processing Systems

Date of Conference:

15-17 May 2009