{"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}
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.