By Topic

Consistent relaxation matching for handwritten Chinese character recognition

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 $31
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)
Jin, L.W. ; Hong Kong Univ., Hong Kong ; Chan, K.P. ; Xu, B.-Z.

Due to the complexity in structure and the various distortions (translation, rotation, shifting, and deformation) in different writing styles of handwritten Chinese characters (HCCs), it is more suitable to use a structural matching algorithm for computer recognition of HCC. Relaxation matching is a powerful technique which can tolerate considerable distortion. However, most relaxation techniques so far developed for handwritten Chinese Character recognition (HCCR) are based on a probabilistic relaxation scheme. In the paper, based on local constraint of relaxation labelling and optimization theory, the authors apply a new relaxation matching technique to handwritten character recognition. From the properties of the compatibility constraints, several rules are devised to guide the design of the compatibility function, which plays an important role in the relaxation process. By parallel use of local contextual information of geometric relaxationship among strokes of two characters, the ambiguity between them can be relaxed iteratively to achieve optimal consistent matching

Published in:

Image Processing and its Applications, 1995., Fifth International Conference on

Date of Conference:

4-6 Jul 1995