About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICASSP 2003
Conference paper
Discriminative training of tied mixture density HMMs for online handwritten digit recognition
Abstract
This paper describes and evaluates the Maximum Mutual Information criterion (MMI) for online unconstrained-style handwritten digit recognition based on Hidden Markov Models (HMMs). The study focuses on determining the best MMI optimization scheme and the HMM parameters that exhibit the most discriminative capabilities in the context of Tied Mixture Density Hidden Markov Models (TDHMMS), where all HMM states share a pool of Gaussians. The experimental results show that the second-order optimization scheme is the most efficient and that although means and covariance matrix are shared by all models, they contribute the most to discrimination.