Mixture density estimators in Viterbi training

In speech recognition, speech units are usually modeled as hidden Markov processes. The use of Gaussian mixture densities for computing the local emission probabilities has led to a significant performance improvement. Analytical estimators for updating the parameters in the iterative training are well known if the Baum Welch algorithm is used, but, unfortunately, analytical formulas in the Viterbi case cannot be derived by a limiting process from the Baum Welch formulas. Approximate techniques are used with fairly good success. The authors propose analytical estimators in the Viterbi case as a natural extension of similar formulas used for the plain Gaussian density.<<ETX>>

[1]  Biing-Hwang Juang,et al.  Mixture autoregressive hidden Markov models for speech signals , 1985, IEEE Trans. Acoust. Speech Signal Process..

[2]  Jerome R. Bellegarda,et al.  Tied mixture continuous parameter modeling for speech recognition , 1990, IEEE Trans. Acoust. Speech Signal Process..

[3]  C. J. Wellekens,et al.  Explicit time correlation in hidden Markov models for speech recognition , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  L. R. Rabiner,et al.  Recognition of isolated digits using hidden Markov models with continuous mixture densities , 1985, AT&T Technical Journal.