One dimensional-two dimensional dynamic programming matching algorithm for character recognition

Hiroaki Sakoe, Muhammad Masroor Ali, Yoshinori Katayama

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


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 45° and approximately 20° deviations from the vector directions. The 20° version gave the best recognition score.

Original languageEnglish
Pages (from-to)1047-1054
Number of pages8
JournalIEICE Transactions on Information and Systems
Issue number9
Publication statusPublished - Sept 1994

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence


Dive into the research topics of 'One dimensional-two dimensional dynamic programming matching algorithm for character recognition'. Together they form a unique fingerprint.

Cite this