The Nile on
Markov Models for Pattern Recognition by Gernot A. Fink
describes important methods for efficient processing of Markov models, and the adaptation of the models to different tasks; examines algorithms for searching within the complex solution spaces that result from the joint application of Markov chain and hidden Markov models;
FORMAT
Paperback LANGUAGE
English CONDITION
Brand New Publisher Description
This thoroughly revised and expanded new edition now includes a more detailed treatment of the EM algorithm, a description of an efficient approximate Viterbi-training procedure, a theoretical derivation of the perplexity measure and coverage of multi-pass decoding based on n-best search. Supporting the discussion of the theoretical foundations of Markov modeling, special emphasis is also placed on practical algorithmic solutions. Features: introduces the formal framework for Markov models; covers the robust handling of probability quantities; presents methods for the configuration of hidden Markov models for specific application areas; describes important methods for efficient processing of Markov models, and the adaptation of the models to different tasks; examines algorithms for searching within the complex solution spaces that result from the joint application of Markov chain and hidden Markov models; reviews key applications of Markov models.
Back Cover
Markov models are extremely useful as a general, widely applicable tool for many areas in statistical pattern recognition. This unique text/reference places the formalism of Markov chain and hidden Markov models at the very center of its examination of current pattern recognition systems, demonstrating how the models can be used in a range of different applications. Thoroughly revised and expanded, this new edition now includes a more detailed treatment of the EM algorithm, a description of an efficient approximate Viterbi-training procedure, a theoretical derivation of the perplexity measure, and coverage of multi-pass decoding based on n -best search. Supporting the discussion of the theoretical foundations of Markov modeling, special emphasis is also placed on practical algorithmic solutions. Topics and features: Introduces the formal framework for Markov models, describing hidden Markov models and Markov chain models, also known as n-gram models Covers the robust handling of probability quantities, which are omnipresent when dealing with these statistical methods Presents methods for the configuration of hidden Markov models for specific application areas, explaining the estimation of the model parameters Describes important methods for efficient processing of Markov models, and the adaptation of the models to different tasks Examines algorithms for searching within the complex solution spaces that result from the joint application of Markov chain and hidden Markov models Reviews key applications of Markov models in automatic speech recognition, character and handwriting recognition, and the analysis of biological sequences Researchers, practitioners, and graduate students of pattern recognition will all find this book to be invaluable in aiding their understanding of the application of statistical methods in this area.
Table of Contents
Introduction.- Application Areas.- Part I: Theory.- Foundations of Mathematical Statistics.- Vector Quantization and Mixture Estimation.- Hidden Markov Models.- N-Gram Models.- Part II: Practice.- Computations with Probabilities.- Configuration of Hidden Markov Models.- Robust Parameter Estimation.- Efficient Model Evaluation.- Model Adaptation.- Integrated Search Methods.- Part III: Systems.- Speech Recognition.- Handwriting Recognition.- Analysis of Biological Sequences.
Review
From the book reviews:"The book is highly appropriate for researchers and practitioners dealing with pattern recognition in general and speech, character and handwriting recognition sequences, in particular." (Catalin Stoean, zbMATH 1307.68001, 2015)
Long Description
Markov models are extremely useful as a general, widely applicable tool for many areas in statistical pattern recognition. This unique text/reference places the formalism of Markov chain and hidden Markov models at the very center of its examination of current pattern recognition systems, demonstrating how the models can be used in a range of different applications. Thoroughly revised and expanded, this new edition now includes a more detailed treatment of the EM algorithm, a description of an efficient approximate Viterbi-training procedure, a theoretical derivation of the perplexity measure, and coverage of multi-pass decoding based on n -best search. Supporting the discussion of the theoretical foundations of Markov modeling, special emphasis is also placed on practical algorithmic solutions. Topics and features: introduces the formal framework for Markov models, describing hidden Markov models and Markov chain models, also known as n-gram models; covers the robust handling of probability quantities, which are omnipresent when dealing with these statistical methods; presents methods for the configuration of hidden Markov models for specific application areas, explaining the estimation of the model parameters; describes important methods for efficient processing of Markov models, and the adaptation of the models to different tasks; examines algorithms for searching within the complex solution spaces that result from the joint application of Markov chain and hidden Markov models; reviews key applications of Markov models in automatic speech recognition, character and handwriting recognition, and the analysis of biological sequences. Researchers, practitioners, and graduate students of pattern recognition will all find this book to be invaluable in aiding their understanding of the application of statistical methods in this area.
Review Quote
From the book reviews: The book is highly appropriate for researchers and practitioners dealing with pattern recognition in general and speech, character and handwriting recognition sequences, in particular. (Catalin Stoean, zbMATH 1307.68001, 2015)"
Feature
Thoroughly revised, updated and expanded new edition Examines pattern recognition systems from the perspective of Markov models, demonstrating how the models can be used in a range of applications Places special emphasis on practical algorithmic solutions
Details ISBN1447171330 Author Gernot A. Fink Publisher Springer London Ltd Year 2016 ISBN-10 1447171330 ISBN-13 9781447171331 Format Paperback Language English Media Book Imprint Springer London Ltd Subtitle From Theory to Applications Place of Publication England Country of Publication United Kingdom Pages 276 Publication Date 2016-08-27 Short Title Markov Models for Pattern Recognition Edition 2nd UK Release Date 2016-08-27 AU Release Date 2016-08-27 NZ Release Date 2016-08-27 Edition Description Softcover reprint of the original 2nd ed. 2014 Series Advances in Computer Vision and Pattern Recognition Alternative 9781447163077 DEWEY 006.4 Audience Professional & Vocational Country of Origin NL Product Class Description Computing: Professional & Programming Illustrations 45 Illustrations, black and white
We\'ve got this
At The Nile, if you\'re looking for it, we\'ve got it.
With fast shipping, low prices, friendly service and well over a million items - you\'re bound to find what you want, at a price you\'ll love!
TheNile_Item_ID:100257505;
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.