Share Email Print

Proceedings Paper

Matching algorithm for radical-based online Chinese character recognition
Author(s): Quen-Zong Wu; I-Chang Jou; Bor-Shenn Jeng; Chao-Hao Lee; Miin-Luen Day; Nai-Jen Cheng
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 21 April 1995
PDF: 8 pages
Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); doi: 10.1117/12.206749
Show Author Affiliations
Quen-Zong Wu, Telecommunication Labs. (Taiwan)
I-Chang Jou, Telecommunication Labs. (Taiwan)
Bor-Shenn Jeng, Telecommunication Labs. (Taiwan)
Chao-Hao Lee, National Central Univ. (Taiwan)
Miin-Luen Day, Telecommunication Labs. (Taiwan)
Nai-Jen Cheng, Telecommunication Labs. (Taiwan)

Published in SPIE Proceedings Vol. 2501:
Visual Communications and Image Processing '95
Lance T. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top