By Topic

Relaxation Matching for Chinese Character Recognition Using Adjacency List

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xi Wang ; Comput. Sch. Commun., Univ. of China, Beijing, China ; Xianglin Huang ; Zhulin Tao

Due to the complexity in structure and the various distortions in different styles of Chinese characters, it is more suitable to use a structural matching algorithm for computer recognition of Chinese characters. Relaxation matching is a powerful technique which can tolerate considerable distortion. In this paper, we apply a new relaxation matching technique to character recognition based on constraint relation. The correlativity relation of strokes will be verified after the initialization matching. Several rules are devised for the relaxation matching. Adjacency list structure is use to storage the information of strokes. The structure makes matching more effective. The purpose is to achieve optimal matching.

Published in:

Management and Service Science, 2009. MASS '09. International Conference on

Date of Conference:

20-22 Sept. 2009