21 April 1995 Matching algorithm for radical-based online Chinese character recognition
Author Affiliations +
Proceedings Volume 2501, Visual Communications and Image Processing '95; (1995) https://doi.org/10.1117/12.206749
Event: Visual Communications and Image Processing '95, 1995, Taipei, Taiwan
Abstract
In this paper, we propose a matching algorithm for radical-based on-line Chinese character recognition. The major effort of this paper is to demonstrate recognition procedures for subcharacters, such as radicals and residual subcharacters, and nonradical characters. Since a Chinese character could have front radical, rear radical or none of them, the matching algorithm should be able to take care of all these conditions. Furthermore, instead of picking up the front/rear radical strokes from the input character before the matching process is taken, our matching algorithm determines how many strokes the front/rear radical should be during the matching process; it thus enjoys the property of flexibility. After the radical type and the number of strokes of the radical are figured out, the residual subcharacter can be picked up and submitted for matching again. By sequentially recognizing the types of front/rear radicals and the types of residual subcharacters, we can determine what the input characters are.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Quen-Zong Wu, Quen-Zong Wu, I-Chang Jou, I-Chang Jou, Bor-Shenn Jeng, Bor-Shenn Jeng, Chao-Hao Lee, Chao-Hao Lee, Miin-Luen Day, Miin-Luen Day, Nai-Jen Cheng, Nai-Jen Cheng, } "Matching algorithm for radical-based online Chinese character recognition", Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); doi: 10.1117/12.206749; https://doi.org/10.1117/12.206749
PROCEEDINGS
8 PAGES


SHARE
Back to Top