Title
A Segment Extraction Algorithm Based on Polygonal Approximation for On-Line Chinese Character Recognition
Abstract
In this paper, a segment extraction algorithm based on polygonal approximation for On-Line Chinese Characters Recognition (OLCCR) is presented. With this method, the point with the smallest interior angle is detected and the whole stroke is split into two adjacent curves by this point, which is called as a cut-off point or an inflexion. To each of the two curves, the same step is performed to detect the cut-off points respectively. The same operations are performed iteratively until the smallest interior angle in all the curves is larger than an appointed threshold value. All the cut-off points and the start-end points compose the stroke and every pair of adjacent points constructs a segment. Experiments proved that this method has the advantages of less computing complexity and better approximating effect then other methods. An OLCCR system with this segment extraction algorithm has achieved the speed of 20/s and the recognition rate of 97.2%.
Year
DOI
Venue
2008
10.1109/FCST.2008.23
FCST
Keywords
Field
DocType
segment extraction algorithm,olccr system,on-line chinese character recognition,on-line chinese characters recognition,polygonal approximation,appointed threshold value,adjacent curve,whole stroke,adjacent point,smallest interior angle,cut-off point,start-end point,image segmentation,interior angle,inflexion,approximation algorithms,data mining,computational complexity,feature extraction,classification algorithms,approximation theory,natural language processing,stroke
Approximation algorithm,Polygon,Character recognition,Pattern recognition,Extraction algorithm,Computer science,Approximation theory,Feature extraction,Image segmentation,Artificial intelligence,Statistical classification
Conference
Citations 
PageRank 
References 
1
0.41
6
Authors
6
Name
Order
Citations
PageRank
Xinqiao Lu111.09
Xiaojuan Liu210.75
Guoqiang Xiao373.64
Enmin Song410.75
Ping Li510.41
Qiaoling Luo610.75