手書き片仮名文字を対象としたストリング化の一手法

元データ 山口大学

概要

In syntactical pattern recognition, a pattern must be represented by a sentence (or string) in a language. So string representation of a input pattern is important pre-processing for syntactical pattern recognition. In this paper, we propose a method of string representation for handwritten katakana characters. Each character is a continuous line pattern on a 20×20 mesh. Starting from its upper right corner, each input pattern is chain-coded cell by cell. Namely, each successive cell is coded as A, B, C or D according to its position relative to that of the current one. After three consecutive cells have been coded one of four primitives a, b, c and d, by using four concatenation relations ×, +, *, : and the parentheses ( ), the concatenation of branches, which is a string representation, completes. From some experimental results, the validity of our method is discussed.

著者

浜本 義彦 山口大学工学部知能情報システム工学
浜本 義彦 山口大 工
金岡 泰保 電子工学科
岡田 敏彦 電子工学科
富田 真吾 電子工学科
富田 真吾 山口大 工
衣松 博 電子工学科
浜本 義彦 大学院電子工学
衣松 博 電子工学科:(現)日本製鋼所

関連論文

▼もっと見る