Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
For practical applications the actual model topology—i.e., the connectivity between states of a certain model—is usually limited using specific, non-ergodic model architectures (e.g., linear or Bakis type).
References
Fink GA, Plötz T (2008) Developing pattern recognition systems based on Markov models: the ESMERALDA framework. Pattern Recognit Image Anal 18(2):207–215
Fink GA, Plötz T (2007) Tutorial on Markov models for handwriting recognition. In: Proceedings of the international conference on document analysis and recognition, Curitiba
Fink GA (2008) Markov models for pattern recognition–from theory to applications. Springer, Heidelberg
Huang XD, Jack MA (1989) Semi-continuous hidden Markov models for speech signals. Comput Speech Lang 3(3):239–251
Huang XD, Ariki Y, Jack MA (1990) Hidden Markov models for speech recognition. Edinburgh University Press, Edinburgh
Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J Royal Stat Soc Ser B 39(1):1–22
Bishop CM (2006) Pattern recognition and machine learning. Springer, New York
Jebara T (2004) Machine learning: discriminative and generative. Kluwer Academic, Dordrecht
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éal
Biem A (2006) Minimum classification error training for online handwriting recognition. IEEE Trans Pattern Analy Mach Intell 28(7):1041–1051
Lowerre BT (1976) The HARPY speech recognition system. Ph.D. thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburg, USA
Chen SF, Goodman J (1999) An empirical study of smoothing techniques for language modeling. Comput Speech Lang 13:359–394
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Thomas Plötz
About this chapter
Cite this chapter
Plötz, T., Fink, G.A. (2011). Markov Model Concepts: The Essence. In: Markov Models for Handwriting Recognition. SpringerBriefs in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-2188-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2188-6_3
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2187-9
Online ISBN: 978-1-4471-2188-6
eBook Packages: Computer ScienceComputer Science (R0)