DocumentCode
3303228
Title
An Effective Hybrid Optimization Algorithm for HMM
Author
Yang, Fengqin ; Zhang, Changhai
Author_Institution
Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun
Volume
4
fYear
2008
fDate
18-20 Oct. 2008
Firstpage
80
Lastpage
84
Abstract
Hidden Markov model (HMM) is currently the most popular approach to speech recognition. The problem of optimizing model parameters is of great interest to the researchers in this area. The Baum-Welch (BW) algorithm is very popular estimation method due to its reliability and efficiency. However, it is easily trapped in local optimum. particle swarm optimization (PSO) algorithm is a stochastic global optimization technique, but its convergence speed is comparatively slow. With the purpose of overcoming their drawbacks, a new training algorithm based on the PSO algorithm and the BW algorithm (PSOBW) is proposed to train the continuous HMM in continuous speech recognition. This algorithm not only overcomes the shortcoming of the slow convergence speed of the PSO algorithm but also helps the BW algorithm escape from local optimum. The experimental results show that the algorithm is superior to the BW algorithm in the recognition performance.
Keywords
hidden Markov models; particle swarm optimisation; speech recognition; PSO algorithm; continuous speech recognition; hidden Markov model; hybrid optimization algorithm; particle swarm optimization algorithm; stochastic global optimization technique; Computer science; Convergence; Educational institutions; Gaussian distribution; Hidden Markov models; Parameter estimation; Particle swarm optimization; Probability distribution; Speech recognition; Stochastic processes; BaumWelch algorithm; Hidden Markov Model; Particle Swarm Optimization; speech recognition;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation, 2008. ICNC '08. Fourth International Conference on
Conference_Location
Jinan
Print_ISBN
978-0-7695-3304-9
Type
conf
DOI
10.1109/ICNC.2008.367
Filename
4667253
Link To Document