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
相关论文
共 50 条
  • [31] Feature Points Extraction of Chinese Characters Based on Blob Algorithm
    Huang, Xiaoyin
    Fang, Ning
    MATERIALS SCIENCE AND INFORMATION TECHNOLOGY, PTS 1-8, 2012, 433-440 : 4214 - +
  • [32] Block-run run-length coding of handwriting and bilevel graphics based on quadtree segmentation
    Yuen, H
    Hanzo, L
    PATTERN RECOGNITION LETTERS, 1997, 18 (02) : 187 - 191
  • [33] Stroke extraction as pre-processing step to improve thinning results of Chinese characters
    He, R
    Yan, H
    PATTERN RECOGNITION LETTERS, 2000, 21 (09) : 817 - 825
  • [34] Stroke extraction based on ambiguous zone detection: a preprocessing step to recover dynamic information from handwritten Chinese characters
    Zhewen Su
    Zhongsheng Cao
    Yuanzhen Wang
    International Journal on Document Analysis and Recognition (IJDAR), 2009, 12 : 109 - 121
  • [35] Stroke extraction based on ambiguous zone detection: a preprocessing step to recover dynamic information from handwritten Chinese characters
    Su, Zhewen
    Cao, Zhongsheng
    Wang, Yuanzhen
    INTERNATIONAL JOURNAL ON DOCUMENT ANALYSIS AND RECOGNITION, 2009, 12 (02) : 109 - 121
  • [36] The Chinese Characters Extraction Method Based on Area Voronoi diagram in Inscription
    Wang, Chen
    Qi, Yue
    Wang, Xiaoqing
    2015 5TH INTERNATIONAL CONFERENCE ON VIRTUAL REALITY AND VISUALIZATION (ICVRV 2015), 2015, : 109 - 116
  • [37] A new stroke-based directional feature extraction approach for handwritten Chinese character recognition
    Gao, X
    Jin, LW
    Yin, JX
    Huang, JC
    SIXTH INTERNATIONAL CONFERENCE ON DOCUMENT ANALYSIS AND RECOGNITION, PROCEEDINGS, 2001, : 635 - 639
  • [38] New stroke-based directional feature extraction approach for handwritten Chinese character recognition
    Gao, Xue
    Jin, Lian-Wen
    Yin, Jun-Xun
    Huang, Jian-Cheng
    Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2003, 31 (03):
  • [39] JOINT OPTIMIZATION OF RUN-LENGTH CODING, CONTEXT-BASED ARITHMETIC CODING AND QUANTIZATION STEP SIZES
    Yang, En-hui
    Wang, Longji
    2009 IEEE 22ND CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1 AND 2, 2009, : 950 - +
  • [40] Fast detection method of quick response code based on run-length coding
    Li, Shiren
    Shang, Jiayu
    Duan, Zhikui
    Huang, Junwei
    IET IMAGE PROCESSING, 2018, 12 (04) : 546 - 551