Abstract

The gradient based hidden Markov model (HMM) inversion algorithm is studied and applied to robust speech recognition tasks under general types of mismatched conditions. It stems from the gradient-based inversion algorithm of an artificial neural network (ANN) by viewing an HMM as a special type of ANNs. The HMM inversion has a conceptual duality to HMM training just as ANN inversion does to ANN training. The forward training of an HMM, based on either the Baum-Welch reestimation or gradient method, finds the model parameters /spl lambda/ to optimize some criteria (e.g., maximum likelihood, maximum mutual information, and mean squared error) with given speech inputs s. On the other hand, the inversion of an HMM finds speech inputs s that optimize some criterion with given model parameters /spl lambda/. The performance of the proposed gradient based HMM inversion for noisy speech recognition under additive noise corruption and microphone mismatch conditions is compared with the robust Baum-Welch HMM inversion technique along with other noisy speech recognition technique, i.e., the robust MINIMAX classification technique.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.