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

Hiroaki SAKOE; Muhammad Masroor ALI; Yoshinori KATAYAMA

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

Hiroaki SAKOE, Muhammad Masroor ALI, Yoshinori KATAYAMA

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Information Vol.E77-D No.9 pp.1047-1054

Publication Date: 1994/09/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Image Processing, Computer Graphics and Pattern Recognition

Cite this

Copy

Hiroaki SAKOE, Muhammad Masroor ALI, Yoshinori KATAYAMA, "One Dimensional-Two Dimensional Dynamic Programming Matching Algorithm for Character Recognition" in IEICE TRANSACTIONS on Information, vol. E77-D, no. 9, pp. 1047-1054, September 1994, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e77-d_9_1047/_p

Copy

@ARTICLE{e77-d_9_1047,
author={Hiroaki SAKOE, Muhammad Masroor ALI, Yoshinori KATAYAMA, },
journal={IEICE TRANSACTIONS on Information},
title={One Dimensional-Two Dimensional Dynamic Programming Matching Algorithm for Character Recognition},
year={1994},
volume={E77-D},
number={9},
pages={1047-1054},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={September},}

Copy

TY - JOUR
TI - One Dimensional-Two Dimensional Dynamic Programming Matching Algorithm for Character Recognition
T2 - IEICE TRANSACTIONS on Information
SP - 1047
EP - 1054
AU - Hiroaki SAKOE
AU - Muhammad Masroor ALI
AU - Yoshinori KATAYAMA
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E77-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 1994
AB - 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.
ER -