Cantitate/Preț
Produs

Markov Models for Handwriting Recognition: SpringerBriefs in Computer Science

Autor Thomas Plötz, Gernot A. Fink
en Limba Engleză Paperback – 10 sep 2011
Since their first inception, automatic reading systems have evolved substantially, yet the recognition of handwriting remains an open research problem due to its substantial variation in appearance. With the introduction of Markovian models to the field, a promising modeling and recognition paradigm was established for automatic handwriting recognition. However, no standard procedures for building Markov model-based recognizers have yet been established. This text provides a comprehensive overview of the application of Markov models in the field of handwriting recognition, covering both hidden Markov models and Markov-chain or n-gram models. First, the text introduces the typical architecture of a Markov model-based handwriting recognition system, and familiarizes the reader with the essential theoretical concepts behind Markovian models. Then, the text reviews proposed solutions in the literature for open problems in applying Markov model-based approaches to automatic handwriting recognition.
Citește tot Restrânge

Din seria SpringerBriefs in Computer Science

Preț: 30506 lei

Preț vechi: 38132 lei
-20% Nou

Puncte Express: 458

Preț estimativ în valută:
5840 6366$ 4911£

Carte tipărită la comandă

Livrare economică 17-31 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781447121879
ISBN-10: 1447121872
Pagini: 84
Ilustrații: VI, 78 p. 5 illus.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.14 kg
Ediția:2011
Editura: SPRINGER LONDON
Colecția Springer
Seria SpringerBriefs in Computer Science

Locul publicării:London, United Kingdom

Public țintă

Research

Cuprins

Introduction.- General Architecture.- Markov Model Concepts: The Essence.- Markov Model Based Handwriting Recognition.- Recognition Systems for Practical Applications.- Discussion.

Recenzii

From the reviews:
“The book provides a general introduction with 75 pages for researchers on handwriting recognition. More contents focus on the handwriting recognition methods based on Markov models, including a recognition framework and techniques within this framework. … this book gives an introduction for researchers on handwriting recognition. I think readers can get some useful information from it.” (Longlong Ma, IAPR Newsletter, Vol. 35 (2), April, 2013)

Textul de pe ultima copertă

Since their first inception more than half a century ago, automatic reading systems have evolved substantially, thereby showing impressive performance on machine-printed text. The recognition of handwriting can, however, still be considered an open research problem due to its substantial variation in appearance. With the introduction of Markovian models to the field, a promising modeling and recognition paradigm was established for automatic handwriting recognition. However, so far, no standard procedures for building Markov-model-based recognizers could be established though trends toward unified approaches can be identified.
Markov Models for Handwriting Recognition provides a comprehensive overview of the application of Markov models in the research field of handwriting recognition, covering both the widely used hidden Markov models and the less complex Markov-chain or n-gram models. First, the text introduces the typical architecture of a Markov model-based handwriting recognition system, and familiarizes the reader with the essential theoretical concepts behind Markovian models. Then, the text gives a thorough review of the solutions proposed in the literature for open problems in applying Markov model-based approaches to automatic handwriting recognition.

Caracteristici

Introduces the typical architecture of a Markov model-based handwriting recognition system Describes the essential theoretical concepts behind Markovian models Provides a thorough review of the solutions proposed in the literature for open problems in applying Markov model-based approaches to automatic handwriting recognition