QQ客服 官方微博 反馈留言

	Automatic correspondence finding for chinese characters using graph matching
	Wang, Chenxi ; Lian, Zhouhui ; Tang, Yingmin ; Xiao, Jianguo
	2013
英文摘要	Automatically establishing correspondence between Chinese characters is a challenging task. In this paper, we propose a novel method to solve this problem. Given two Chinese characters, we first extract and properly prune the skeleton of each character to get the key points and the connectivity relations of these points. Then, the similarity between each pair of key points is calculated via the comparison of their local features. Afterwards, a set of edges are constructed by considering both the connectivity relations and k nearest neighbors (k-nn) of each point. Finally, correspondence between two characters is established by applying a guided graph matching algorithm. Experimental results demonstrate the effectiveness of our method for the correspondence problem of Chinese characters in both printing and handwritten styles. Moreover, we also show that our method can be utilized to automatically extract strokes from Chinese characters. ? 2013 IEEE.; EI; 0
语种	英语
DOI标识	10.1109/ICIG.2013.115
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/321367]
专题	计算机科学技术研究所
推荐引用方式 GB/T 7714	Wang, Chenxi,Lian, Zhouhui,Tang, Yingmin,et al. Automatic correspondence finding for chinese characters using graph matching. 2013-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。