Xinqiao Lu, Xiaojuan Liu, Guoqiang Xiao, E. Song, Ping Li, Qiaoling Luo
{"title":"基于多边形逼近的在线汉字识别片段提取算法","authors":"Xinqiao Lu, Xiaojuan Liu, Guoqiang Xiao, E. Song, Ping Li, Qiaoling Luo","doi":"10.1109/FCST.2008.23","DOIUrl":null,"url":null,"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%.","PeriodicalId":206207,"journal":{"name":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Segment Extraction Algorithm Based on Polygonal Approximation for On-Line Chinese Character Recognition\",\"authors\":\"Xinqiao Lu, Xiaojuan Liu, Guoqiang Xiao, E. Song, Ping Li, Qiaoling Luo\",\"doi\":\"10.1109/FCST.2008.23\",\"DOIUrl\":null,\"url\":null,\"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%.\",\"PeriodicalId\":206207,\"journal\":{\"name\":\"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FCST.2008.23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FCST.2008.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Segment Extraction Algorithm Based on Polygonal Approximation for On-Line Chinese Character Recognition
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%.