BIPARTITE WEIGHTED MATCHING FOR ONLINE HANDWRITTEN CHINESE CHARACTER-RECOGNITION

NCU Institutional Repository > 資訊電機學院 > 資訊工程研究所 > 期刊論文 > Item 987654321/29222

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29222

题名:	BIPARTITE WEIGHTED MATCHING FOR ONLINE HANDWRITTEN CHINESE CHARACTER-RECOGNITION
作者:	HSIEH,AJ;FAN,KC;FAN,TI
贡献者:	資訊工程研究所
关键词:	RELAXATION
日期:	1995
上传时间:	2010-06-29 20:16:46 (UTC+8)
出版者:	中央大學
摘要:	The matching of line segments between input and prototype characters can be formulated as bipartite weighted matching problem. Under the assumption that the distance of the two line segments and the unmatched penalty of any line segment are given, the matching goal is to find a matching such that the sum of the weights of matching edges and the penalties of unmatched vertices is minimum. In this paper, the Hungarian method is applied to solve the matching problem by a reduction algorithm. Moreover, a greedy algorithm based on the Hungarian method is proposed by restricting the above matching which satisfies the constraints of geometric relation. For each iteration in the greedy algorithm, a matched pair is deleted if the relation of their neighbors does not match and a new matching is then found by applying Hungarian method. Finally, we can find a stable matching that preserves the geometric relation. We have implemented this method to recognize on-line Chinese handwritten characters permitting both stroke-order variation and stroke-number variation and a 91% recognition rate is attained.
關聯:	PATTERN RECOGNITION
显示于类别:	[資訊工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	562	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing