Dynamic Programming Based One Dimensional-Two Dimensional Character Recognition Algorithm with Branched References

スポンサーリンク

概要

• 論文の詳細を見る

• Dynamic Programming based elastic pattern matching method called Branched Reference Rubber String Matching was investigated. As in Rubber String Matching, the reference pattern is represented as a sequence of direction specified vectors and the input pattern as two dimensional dot pattern. In order to improve the coping of topological variations in input pattern, the reference patterns allow partial pattern alternatives and misses. Effect on the recognition time is almost negligible. Experimental results show the effectiveness of the proposed algorithm.

• 社団法人電子情報通信学会の論文
• 1995-10-25

著者

• ALI Muhammad

  Department of Applied Chemistry and Biotechnology, Faculty of Engineering, Yamanashi University

• Sakoe H

  Kyushu Univ. Fukuoka‐shi Jpn

• Sakoe Hiroaki

  Department of Computer Science and Communication Engineering, Kyushu University

• Ali Muhammad

  Department Of Computer Science And Communication Engineering Kyushu University

• Ali Muhammad

  Department Of Applied Chemistry And Biotechnology Faculty Of Engineering Yamanashi University

関連論文

• Simple Simultaneous Determination of Soluble and Insoluble Trace Metal Components in Sea Salts by a Combined Coprecipitation/X-Ray Fluorescence Method
• Dynamic Programming Based One Dimensional-Two Dimensional Character Recognition Algorithm with Branched References
• Analysis of Dislocations Generated during Metal--Organic Vapor Phase Epitaxy of GaN on Patterned Templates

スポンサーリンク