Feature dimension reduction using reduced-rank maximum likelihood estimation for hidden Markov models

D.X. Sun · 2002

This paper presents a new method of feature dimension reduction in hidden Markov modeling (HMM) for speech recognition. The key idea is to apply reduced rank maximum likelihood estimation in the M-step of the usual Baum-Welch (1972) algorithm for estimating HMM parameters such that the estimates of the Gaussian distribution parameters are restricted in a sub-space of reduced dimensionality. There are two main advantages of applying this method in HMM: feature dimension reduction is achieved simultaneously with the estimation of HMM parameters, therefore it guarantees that the likelihood function is monotonically increasing; and it requires very little extra computation in addition to the standard Baum-Welch algorithm, hence it can be easily incorporated in the existing speech recognition systems using HMMs.

Read the paper · More papers on PaperTik