文字認識を目的とした分岐標準パターンを持つ1次元-2次元DPマッチング

概要

論文の詳細を見る
Dynamic programming based Rubber String Matching (RSM) algorithm, originally proposed by Sakoe, is a promising method for dealing with topological variations in input characters. But the problem is that it is too rigid with respect to the line direction and thus may fail to deal with abrupt aberrations of input pattern points. The situation drastically improves by the importation of Flexible Rubber String Matching (FRSM) algorithm, at the expense of a substantial in crease of recognition time. In this paper, we investigate another alternative algorithm, called the Branched Reference RSM, in which, as the name suggests, the reference pattern can have optional branches one of which is selected during matching for the highest similarity value.
社団法人電子情報通信学会の論文
1995-03-27