Journal of Applied Sciences ›› 2004, Vol. 22 ›› Issue (4): 433-437.

• Articles • Previous Articles     Next Articles

Hidden Markov Model Adaptation Algorithm Using Gaussian-Similarity-Analysis-Based Maximum a Posteriori Nonlinear Transform

LIU Hai-bin1, WU Zhen-yang1, ZHAO Li1, ZENG Yu-min2   

  1. 1. Department of Radio Engineering, Southeast University, Nanjing 210096, China;
    2. Department of Physics, Nanjing Normal University, Nanjing 210097, China
  • Received:2003-08-29 Revised:2004-04-05 Online:2004-12-31 Published:2004-12-31

Abstract: The performance of speech recognition system will be significantly deteriorated because of the mismatches between training and testing conditions. This paper addresses the problem and proposes an environment adaptation algorithm to adapt the mean vectors of HMM. The algorithm can reduce the performance deterioration of the speech recognition system caused by the mismatches. Firstly, we build a binary tree by Gaussian similarity analysis (GSA) and then adaptively adjust the class number according to the data. In each class, we adapt the HMM using nonlinear transform approximated by piecewise linear regression. Rather than using maximum likelihood estimation (MLE) in estimating the transformation parameters, we propose using maximum a posteriori (MAP) as the estimation criterion. The proposed algorithm, called GAS-MAPNT, has been evaluated on a Chinese digit recognition experiment based on continuous density HMM. The test shows that the proposed algorithm is efficient and superior to other algorithms with Gaussian similarity analysis, such as maximum a posteriori linear regression (MAPLR) algorithm and maximum likelihood linear regression (MLLR) algorithm.

Key words: speech recognition, nonlinear transform, Gaussian similarity analysis, maximum a posteriori

CLC Number: