Precise selection of candidates for handwritten character recognition using feature regions

Fang Sun, Shi N.Ichiro Omachi, Hirotomo Aso

Research output: Contribution to journalArticlepeer-review

29 Citations (Scopus)


In this paper, a new algorithm for selection of candidates for handwritten character recognition is presented. Since we adopt the concept of the marginal radius to examine the confidence of candidates, the evaluation function is required to describe the pattern distribution correctly. For this reason, we propose Simpliβed Mahalanobis distance and observe its behavior by simulation. In the proposed algorithm, first, for each character, two types of feature regions (multi-dimensional one and one-dimensional one) are estimated from training samples statistically. Then, by referring to the feature regions, candidates are selected and verified. Using two types of feature regions is a principal characteristic of our method. If parameters are estimated accurately, the multi-dimensional feature region is extremely effective for character recognition. But generally, estimation errors in parameters occur, especially with a small number of sample patterns. Although the recognition ability of onedimensional feature region is not so high, it can express the distribution comparatively precisely in one-dimensional space. By combining these feature regions, they will work concurrently to overcome the defects of each other. The effectiveness of the method is shown with the results of experiments.

Original languageEnglish
Pages (from-to)510-515
Number of pages6
JournalIEICE Transactions on Information and Systems
Issue number5
Publication statusPublished - 1996


  • Character recognition
  • Database etl9b
  • Feature region
  • Mahalanobis distance
  • Simplified mahalanobis distance


Dive into the research topics of 'Precise selection of candidates for handwritten character recognition using feature regions'. Together they form a unique fingerprint.

Cite this