Markov Model Concepts: The Essence
- 886 Downloads
The integrated use of hidden Markov models (HMMs) and Markov chain models can be considered the state-of-the-art for the analysis of sequential data. The former represents a generative model that covers the “appearance” of the underlying data whereas the latter describes restrictions of possible hypotheses sequences. Hidden Markov models describe a two-stage stochastic process with hidden states and observable outputs. The first stage can be interpreted as a probabilistic finite state automaton, which is the basis for the generative modeling as it is described by the second stage. Markov chain models are usually realized as stochastic n-gram models, which describe the probability of the occurrence of entire symbol sequences. For both HMMs and Markov chain models efficient algorithms exist for parameter estimation and for model evaluation. They can be used in an integrated manner for effective segmentation and classification of sequential data. This chapter gives a detailed overview of the theoretical foundations of Markovian models as they are used for handwriting recognition.
KeywordsTheory Algorithms Definition Recognition paradigm Segmentation free recognition Mixture model Hidden Markov model n-gram model
- 2.Fink GA, Plötz T (2007) Tutorial on Markov models for handwriting recognition. In: Proceedings of the international conference on document analysis and recognition, CuritibaGoogle Scholar
- 5.Huang XD, Ariki Y, Jack MA (1990) Hidden Markov models for speech recognition. Edinburgh University Press, EdinburghGoogle Scholar
- 9.Lee JS, Park CH (2005) Discriminative training of hidden Markov models by multiobjective optimization for visual speech recognition. In: Proceedings of the IEEE international joint conference neural networks, MontréalGoogle Scholar
- 11.Lowerre BT (1976) The HARPY speech recognition system. Ph.D. thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburg, USAGoogle Scholar