A run-length-coding-based approach to stroke extraction of Chinese characters

被引:29
作者
Fan, KC [1 ]
Wu, WH [1 ]
机构
[1] Natl Cent Univ, Inst Comp Sci & Informat Engn, Chungli 32054, Taiwan
关键词
stroke extraction; run-length coding; attributed graph; junction matrix;
D O I
10.1016/S0031-3203(99)00173-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Traditional stroke extraction approach usually adopts thinning technique as the preprocessing method in obtaining the skeletons of Chinese characters. However, thinning may produce spurious branches and multiple fork points at junctions. Such distortion will make stroke extraction process more complicate and unreliable. This paper proposes a novel run-length-based stroke extraction approach without using the thinning method. Besides, the proposed approach does not need to trace the skeleton pixel by pixel in obtaining the skeletons of Chinese characters. In our approach, run-length coding technique is first employed to get a special skeleton which only owns disjoint line segments without including fork points. Then, an attributed graph is constructed from the skeleton. The attribute between two nodes is determined according to the distance, connectivity and orientation difference between the two corresponding line segments. Intersection relation among line segments is represented by a junction matrix and its associating graph. While stroke extraction is performed, fork points can also be found. Experimental results show that the proposed approach is feasible and efficient in extracting strokes of Chinese characters. (C) 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:1881 / 1895
页数:15
相关论文
共 10 条