Data-Driven Design of HMM Topology for Online Handwriting Recognition

نویسندگان

  • Jay J. Lee
  • Jahwan Kim
  • Jin H. Kim
چکیده

Although HMM is widely used for on-line handwriting recognition, there is no simple and wellestablished method of designing the HMM topology. We propose a data-driven systematic method to design HMM topology. Data samples in a single pattern class are structurally simplified into a sequence of straight-line segments, and then these simplified representations of the samples are clustered. An HMM is constructed for each of these clusters, by assigning a state to each straight-line segments. Then the resulting multiple models of the class are combined to form an architecture of a multiple parallel-path HMM, which behaves as a single HMM. To avoid excessive growing of the number of the states, parameter tying is applied in that structural similarity among patterns is reflected. Experiments on on-line Hangul recognition showed about 19 % of error reductions, compared to the intuitive design method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Off-line Arabic Handwritten Recognition Using a Novel Hybrid HMM-DNN Model

In order to facilitate the entry of data into the computer and its digitalization, automatic recognition of printed texts and manuscripts is one of the considerable aid to many applications. Research on automatic document recognition started decades ago with the recognition of isolated digits and letters, and today, due to advancements in machine learning methods, efforts are being made to iden...

متن کامل

HMM topology optimization for handwriting recognition

This paper addresses the problem of Hidden Markov Model (HMM) topology estimation in the context of on-line handwriting recognition. HMMs have been widely used in applications related to speech and handwriting recognition with great success. One major drawback with these approaches, however, is that the techniques that they use for estimating the topology of the models (number of states, connec...

متن کامل

A comparison between continuous and discrete density hidden Markov models for cursive handwriting recognition

This paper presents the results of the comparison of continuous and discrete density Hidden Markov Models (HMMs) used for cursive handwriting recognition. For comparison, a subset of a large vocabulary (1000 word), writer-independent online handwriting recognition system for word and sentence recognition was used, which was developed at Duisburg University. This system has some unique features ...

متن کامل

A new HMM topology for shape recognition

This study deals with the shape recognition problem using the Hidden Markov Model (HMM). In many pattern recognition applications, selection of the size and topology of the HMM is mostly done by heuristics or using trial and error methods. It is well known that as the number of states and the non-zero state transition increases, the complexity of the HMM training and recognition algorithms incr...

متن کامل

Generation of Synthetic Training Data for an HMM-based Handwriting Recognition System

A perturbation model for generating synthetic textlines from existing cursively handwritten lines of text produced by human writers is presented. Our purpose is to improve the performance of an HMM-based off-line cursive handwriting recognition system by providing it with additional synthetic training data. Two kinds of perturbations are applied, geometrical transformations and thinning/thicken...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJPRAI

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2001