z-logo
open-access-imgOpen Access
High-order hidden Markov model for piecewise linear processes and applications to speech recognition
Author(s) -
Lee-Min Lee,
Fu-Rong Jean
Publication year - 2016
Publication title -
the journal of the acoustical society of america
Language(s) - English
Resource type - Journals
eISSN - 1520-8524
pISSN - 0001-4966
DOI - 10.1121/1.4960107
Subject(s) - hidden markov model , hidden semi markov model , forward algorithm , markov model , computer science , maximum entropy markov model , piecewise , variable order markov model , conditional independence , markov process , independence (probability theory) , pattern recognition (psychology) , algorithm , speech recognition , markov chain , mathematics , artificial intelligence , machine learning , statistics , mathematical analysis
The hidden Markov models have been widely applied to systems with sequential data. However, the conditional independence of the state outputs will limit the output of a hidden Markov model to be a piecewise constant random sequence, which is not a good approximation for many real processes. In this paper, a high-order hidden Markov model for piecewise linear processes is proposed to better approximate the behavior of a real process. A parameter estimation method based on the expectation-maximization algorithm was derived for the proposed model. Experiments on speech recognition of noisy Mandarin digits were conducted to examine the effectiveness of the proposed method. Experimental results show that the proposed method can reduce the recognition error rate compared to a baseline hidden Markov model.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom