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

作者:

Highlights:

摘要

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.

论文关键词:Stroke extraction,Run-length coding,Attributed graph,Junction matrix

论文评审过程:Received 15 January 1999, Revised 12 July 1999, Accepted 12 July 1999, Available online 7 June 2001.

论文官网地址:https://doi.org/10.1016/S0031-3203(99)00173-9