Article ID Journal Published Year Pages File Type
10362235 Pattern Recognition Letters 2005 8 Pages PDF
Abstract
In the standard hidden Markov model, the current state depends only on the immediately preceding state, but has nothing to do with the immediately preceding observation. This paper presents a new type of hidden Markov models in which the current state depends both on the immediately preceding state and the immediately preceding observation, and the state sequence is still a Markov chain. Several new algorithms are given and simulated for the three basic problems of interest, including probability evaluation, optimal state sequence and parameter estimation. One example of its initial applications shows that the new model may outperform the standard model in some circumstance.
Related Topics
Physical Sciences and Engineering Computer Science Computer Vision and Pattern Recognition
Authors
,