One Dimensional-Two Dimensional Dynamic Programming Matching Algorithm for Character Recognition

Hiroaki SAKOE  Muhammad Masroor ALI  Yoshinori KATAYAMA  

IEICE TRANSACTIONS on Information and Systems   Vol.E77-D   No.9   pp.1047-1054
Publication Date: 1994/09/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Image Processing, Computer Graphics and Pattern Recognition
character recognition,  dynamic programming,  rubber string matching,  pattern matching,  structural analysis,  

Full Text: PDF>>
Buy this Article

Dynamic programming based one dimensional-two dimensional adaptive pattern matching methods were investigated. In these methods, the reference pattern is represented as a sequence of directional vectors and the input pattern as two dimensional dot pattern. The input pattern needs no preskeletization or local feature analysis, and thus stroke order free top-down pattern matching is carried out. As the starting point, Rubber String Matching algorithm using fixed direction vectors was newly investigated. At latter stages, the reference pattern vectors were permitted some freedom in their directions to cope with abrupt aberrations in input pattern line segments, improving the flexibility of matching. Two cases were considered, allowing 45and approximately 20deviations from the vector directions. The 20version gave the best recognition score.