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

Hiroaki Sakoe, Muhammad Masroor Ali, Yoshinori Katayama

研究成果: ジャーナルへの寄稿学術誌査読

5 被引用数 (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.

ジャーナルIEICE Transactions on Information and Systems
出版ステータス出版済み - 9月 1 1994

!!!All Science Journal Classification (ASJC) codes

  • ソフトウェア
  • ハードウェアとアーキテクチャ
  • コンピュータ ビジョンおよびパターン認識
  • 電子工学および電気工学
  • 人工知能


「One dimensional-two dimensional dynamic programming matching algorithm for character recognition」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。