Off-line recognition of large-set handwritten characters with multiple hidden Markov models

Hee Seon Park, Seong Whan Lee

Research output: Contribution to journalArticle

51 Citations (Scopus)

Abstract

There are many uncertainties in handwritten character recognition. Stochastic modeling is a flexible and general method for modeling such problems and entails the use of probabilistic models to deal with uncertain or incomplete information. This paper presents an efficient scheme for off-line recognition of large-set handwritten characters in the framework of stochastic models, the first-order hidden Markov models (HMMs). To facilitate the processing of unconnected patterns and patterns with isolated noises, four types of feature vectors based on the regional projection contour transformation (RPCT) are employed. The recognition system consists of two phases. For each character, in the training phase, multiple HMMs corresponding to different feature types of RPCT are built. In the classification phase, the results of individual classifiers to produce the final recognition result for an input character are integrated, where each individual HMM classifier produces one score that is the probability of generating the test observation sequence for each character model. In this paper, several methods for integrating the results of different classifiers are considered so that a better result could be obtained. In order to verify the effectiveness of the proposed scheme, the most frequently used 520 types of Hangul characters in Korea have been considered in the experiments. Experimental results indicate that the proposed scheme is very promising for the recognition of large-set handwritten characters with numerous variations.

Original languageEnglish
Pages (from-to)231-244
Number of pages14
JournalPattern Recognition
Volume29
Issue number2
DOIs
Publication statusPublished - 1996 Feb 1

Fingerprint

Character sets
Hidden Markov models
Classifiers
Character recognition
Stochastic models
Processing
Experiments

Keywords

  • Hidden Markov model
  • Large-set handwritten character recognition
  • Multiple classifier combination
  • Regional projection contour transformation

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Off-line recognition of large-set handwritten characters with multiple hidden Markov models. / Park, Hee Seon; Lee, Seong Whan.

In: Pattern Recognition, Vol. 29, No. 2, 01.02.1996, p. 231-244.

Research output: Contribution to journalArticle

@article{43d96a0fd3764658ad149710e23fa6a1,
title = "Off-line recognition of large-set handwritten characters with multiple hidden Markov models",
abstract = "There are many uncertainties in handwritten character recognition. Stochastic modeling is a flexible and general method for modeling such problems and entails the use of probabilistic models to deal with uncertain or incomplete information. This paper presents an efficient scheme for off-line recognition of large-set handwritten characters in the framework of stochastic models, the first-order hidden Markov models (HMMs). To facilitate the processing of unconnected patterns and patterns with isolated noises, four types of feature vectors based on the regional projection contour transformation (RPCT) are employed. The recognition system consists of two phases. For each character, in the training phase, multiple HMMs corresponding to different feature types of RPCT are built. In the classification phase, the results of individual classifiers to produce the final recognition result for an input character are integrated, where each individual HMM classifier produces one score that is the probability of generating the test observation sequence for each character model. In this paper, several methods for integrating the results of different classifiers are considered so that a better result could be obtained. In order to verify the effectiveness of the proposed scheme, the most frequently used 520 types of Hangul characters in Korea have been considered in the experiments. Experimental results indicate that the proposed scheme is very promising for the recognition of large-set handwritten characters with numerous variations.",
keywords = "Hidden Markov model, Large-set handwritten character recognition, Multiple classifier combination, Regional projection contour transformation",
author = "Park, {Hee Seon} and Lee, {Seong Whan}",
year = "1996",
month = "2",
day = "1",
doi = "10.1016/0031-3203(95)00081-X",
language = "English",
volume = "29",
pages = "231--244",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Limited",
number = "2",

}

TY - JOUR

T1 - Off-line recognition of large-set handwritten characters with multiple hidden Markov models

AU - Park, Hee Seon

AU - Lee, Seong Whan

PY - 1996/2/1

Y1 - 1996/2/1

N2 - There are many uncertainties in handwritten character recognition. Stochastic modeling is a flexible and general method for modeling such problems and entails the use of probabilistic models to deal with uncertain or incomplete information. This paper presents an efficient scheme for off-line recognition of large-set handwritten characters in the framework of stochastic models, the first-order hidden Markov models (HMMs). To facilitate the processing of unconnected patterns and patterns with isolated noises, four types of feature vectors based on the regional projection contour transformation (RPCT) are employed. The recognition system consists of two phases. For each character, in the training phase, multiple HMMs corresponding to different feature types of RPCT are built. In the classification phase, the results of individual classifiers to produce the final recognition result for an input character are integrated, where each individual HMM classifier produces one score that is the probability of generating the test observation sequence for each character model. In this paper, several methods for integrating the results of different classifiers are considered so that a better result could be obtained. In order to verify the effectiveness of the proposed scheme, the most frequently used 520 types of Hangul characters in Korea have been considered in the experiments. Experimental results indicate that the proposed scheme is very promising for the recognition of large-set handwritten characters with numerous variations.

AB - There are many uncertainties in handwritten character recognition. Stochastic modeling is a flexible and general method for modeling such problems and entails the use of probabilistic models to deal with uncertain or incomplete information. This paper presents an efficient scheme for off-line recognition of large-set handwritten characters in the framework of stochastic models, the first-order hidden Markov models (HMMs). To facilitate the processing of unconnected patterns and patterns with isolated noises, four types of feature vectors based on the regional projection contour transformation (RPCT) are employed. The recognition system consists of two phases. For each character, in the training phase, multiple HMMs corresponding to different feature types of RPCT are built. In the classification phase, the results of individual classifiers to produce the final recognition result for an input character are integrated, where each individual HMM classifier produces one score that is the probability of generating the test observation sequence for each character model. In this paper, several methods for integrating the results of different classifiers are considered so that a better result could be obtained. In order to verify the effectiveness of the proposed scheme, the most frequently used 520 types of Hangul characters in Korea have been considered in the experiments. Experimental results indicate that the proposed scheme is very promising for the recognition of large-set handwritten characters with numerous variations.

KW - Hidden Markov model

KW - Large-set handwritten character recognition

KW - Multiple classifier combination

KW - Regional projection contour transformation

UR - http://www.scopus.com/inward/record.url?scp=0030081877&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030081877&partnerID=8YFLogxK

U2 - 10.1016/0031-3203(95)00081-X

DO - 10.1016/0031-3203(95)00081-X

M3 - Article

AN - SCOPUS:0030081877

VL - 29

SP - 231

EP - 244

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

IS - 2

ER -