Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12]

@

Journal of Information Science and Engineering, Vol. 20 No. 5, pp. 949-957 (September 2004)

Optimization of HMM by the Tabu Search Algorithm

Tsong-Yi Chen, Xiao-Dan Mei*, Jeng-Shyang Pan
and Sheng-He Sun*
Department of Electronic Engineering
National Kaohsiung University of Applied Sciences
Kaohsiung, 807 Taiwan
*Department of Automatic Test, Measurement and Control
Harbin Institute of Technology
Harbin, 150001 China

In this paper, a simple version of the tabu search algorithm is employed to train a Hidden Markov Model (HMM) to search out the optimal parameter structure of HMM for automatic speech recognition. The proposed TS-HMM training provides a mechanism that allows the search process to escape from a local optimum and obtain a near global optimum. Experimental results show that the TS-HMM training has a higher probability of finding the optimal model parameters than traditional algorithms do.

Keywords: tabu search, hidden Markov model, forward-backward algorithm, speech recognition, global optimum

Full Text () Retrieve PDF document (200409_08.pdf)

Received March 12, 2001; revised April 25, 2003; accepted July 14, 2003.
Communicated by C. C. Jay Kuo.