2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed 2008
DOI: 10.1109/snpd.2008.73
|View full text |Cite
|
Sign up to set email alerts
|

A Genetic Algorithm-aided Hidden Markov Model Topology Estimation for Phoneme Recognition of Thai Continuous Speech

Abstract: The use of Hidden Markov Models (HMM) in many pattern recognition tasks is now very common. Like other pattern recognitions, most Automatic Speech Recognition systems rely on HMM acoustic models. In such systems, recognition performances are significantly affected by their topologies. In this paper, we propose an HMM topology estimation approach for Thai phoneme recognition tasks whose process is divided into 2 stages. First, a set of suitable topologies are constructed by combinations of different objective f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(7 citation statements)
references
References 10 publications
(10 reference statements)
0
7
0
Order By: Relevance
“…The following research works are focused on the speech recognition using HMMs, as in Oudelha et al [26] combining the Baum-Welch algorithm (BW); in Cheshomi et al [27] also uses the BW algorithm. Bhuriyakorn et al [28] present approaches for HMMs topologies generation, in Yang et al [29] address the optimization problem combining a Tabu search and BW algorithm; Yang et al [30] uses Particle Swarm Optimization (PSO) and GA on recognition performance, and in Ogawa et al [31] determine the structure of a Partly HMM with GA. -There is a work of Won et al [2] that presents the use of GA for evolving HMMs, used on information prediction of secondary structure for protein sequences.…”
Section: Parameters Optimization Of An Hmmmentioning
confidence: 99%
“…The following research works are focused on the speech recognition using HMMs, as in Oudelha et al [26] combining the Baum-Welch algorithm (BW); in Cheshomi et al [27] also uses the BW algorithm. Bhuriyakorn et al [28] present approaches for HMMs topologies generation, in Yang et al [29] address the optimization problem combining a Tabu search and BW algorithm; Yang et al [30] uses Particle Swarm Optimization (PSO) and GA on recognition performance, and in Ogawa et al [31] determine the structure of a Partly HMM with GA. -There is a work of Won et al [2] that presents the use of GA for evolving HMMs, used on information prediction of secondary structure for protein sequences.…”
Section: Parameters Optimization Of An Hmmmentioning
confidence: 99%
“…GA will be used to get transition probability matrix, unlike [16] and [14] Baum Welch algorithm will not be used at all to adjust the transition and emission probabilities. However the rest of the steps will be used as per [1] which is using the Baum-Welch algorithm to adjust the probabilities of the HMM and then using Viterbi algorithm to determine the most likely path that a user is going to take then assigning reach buzz rank formula to finally calculate influence of the user.…”
Section: A Buzz Approachmentioning
confidence: 99%
“…Baum-Welch [13] algorithm is considered a hill climbing algorithm [14] and different initial values of HMM provide different results. [15] and [16] both have proposed use of Genetic Algorithms (GAs) to evolve structure of HMM. The structure of HMM are the number of hidden states and the topology of hidden states, evolutionary algorithm was used to identify the best hidden states that are true representative of the problem.…”
Section: Introductionmentioning
confidence: 99%
“…Lastly, the training of HMM is computationally intensive and there is no known method that can guarantee to obtain the most optimal model. Kwong et al [11] and Bhuriyakorn et al [12] have applied Genetic Algorithms to evolve the structure of the HMM for speech recognition. In similar work, Kyoung-Jae et al [8] applied this technique to DNA recognition.…”
Section: Introductionmentioning
confidence: 99%