基于字素分析的离线手写维吾尔文字识别

Xu Yamei, Panpan Du
{"title":"基于字素分析的离线手写维吾尔文字识别","authors":"Xu Yamei, Panpan Du","doi":"10.1109/ICSESS.2017.8343040","DOIUrl":null,"url":null,"abstract":"Handwritten Uighur characters contain a lot of small and random writing strokes, which make character recognition more complicated. For 128 Uighur characters, an efficient offline handwriting recognition algorithm based on grapheme (part of a character) analysis is proposed in this paper. Firstly, by dot stroke detection and component analysis, 128 character models are established by decomposing the Uighur characters as three type graphemes: dot, affix and main graphemes. Secondly, the Uighur characters are pre-classified into 12 subclasses through their grapheme compositions. Finally, different classifiers are designed for various types of graphemes. With the fusion coefficients of graphemes estimated, the character recognition result is given by fusing the graphemes classification outputs using the weighted naive Bayesian algorithm. Experimental results show that the algorithm can effectively identify the 128 unconstrained handwritten Uyghur characters.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Offline handwritten Uighur character recognition based on grapheme analysis\",\"authors\":\"Xu Yamei, Panpan Du\",\"doi\":\"10.1109/ICSESS.2017.8343040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Handwritten Uighur characters contain a lot of small and random writing strokes, which make character recognition more complicated. For 128 Uighur characters, an efficient offline handwriting recognition algorithm based on grapheme (part of a character) analysis is proposed in this paper. Firstly, by dot stroke detection and component analysis, 128 character models are established by decomposing the Uighur characters as three type graphemes: dot, affix and main graphemes. Secondly, the Uighur characters are pre-classified into 12 subclasses through their grapheme compositions. Finally, different classifiers are designed for various types of graphemes. With the fusion coefficients of graphemes estimated, the character recognition result is given by fusing the graphemes classification outputs using the weighted naive Bayesian algorithm. Experimental results show that the algorithm can effectively identify the 128 unconstrained handwritten Uyghur characters.\",\"PeriodicalId\":179815,\"journal\":{\"name\":\"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS.2017.8343040\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2017.8343040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

手写的维吾尔文字包含大量的小而随意的笔画,这使得汉字识别更加复杂。针对128个维吾尔文字,提出了一种基于字素分析的高效离线手写识别算法。首先,通过点画检测和成分分析,将维吾尔文字分解为点位、词缀和主位三种类型的字素,建立了128个汉字模型;其次,根据维吾尔文字的字素组成,将其预先划分为12个子类。最后,针对不同的字素类型设计了不同的分类器。在估计字素融合系数的基础上,利用加权朴素贝叶斯算法对字素分类输出进行融合,得到字符识别结果。实验结果表明,该算法能有效识别128个无约束手写维吾尔语字符。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Offline handwritten Uighur character recognition based on grapheme analysis
Handwritten Uighur characters contain a lot of small and random writing strokes, which make character recognition more complicated. For 128 Uighur characters, an efficient offline handwriting recognition algorithm based on grapheme (part of a character) analysis is proposed in this paper. Firstly, by dot stroke detection and component analysis, 128 character models are established by decomposing the Uighur characters as three type graphemes: dot, affix and main graphemes. Secondly, the Uighur characters are pre-classified into 12 subclasses through their grapheme compositions. Finally, different classifiers are designed for various types of graphemes. With the fusion coefficients of graphemes estimated, the character recognition result is given by fusing the graphemes classification outputs using the weighted naive Bayesian algorithm. Experimental results show that the algorithm can effectively identify the 128 unconstrained handwritten Uyghur characters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信