基于hmm的在线手写识别的上下文相关子笔划模型

Jun-ichi Tokuno, Nobuhito Inami, Shigeki Matsuda, M. Nakai, H. Shimodaira, S. Sagayama
{"title":"基于hmm的在线手写识别的上下文相关子笔划模型","authors":"Jun-ichi Tokuno, Nobuhito Inami, Shigeki Matsuda, M. Nakai, H. Shimodaira, S. Sagayama","doi":"10.1109/IWFHR.2002.1030888","DOIUrl":null,"url":null,"abstract":"Describes context-dependent substroke hidden Markov models (HMMs)for on-line handwritten recognition of cursive Kanji and Hiragana characters. In order to tackle this problem, we have proposed the substroke HMM approach where a modeling unit \"substroke\" that is much smaller than a whole character is employed and each character is modeled as a concatenation of only 25 kinds of substroke HMMs. One of the drawbacks of this approach is that the recognition accuracy deteriorates in the case of scribbled characters, and characters where the shape of the substrokes varies a lot. We show that the context-dependent substroke modeling which depends on how the substroke connects to the adjacent substrokes is effective for achieving robust recognition of low quality characters, The successive state splitting algorithm which was mainly developed for speech recognition is employed to construct the context dependent substroke HMMs. Experimental results show that the correct recognition rate improved from 88% to 92% for cursive Kanji handwriting and from 90% to 98% for Hiragana handwriting.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"293 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":"{\"title\":\"Context-dependent substroke model for HMM-based on-line handwriting recognition\",\"authors\":\"Jun-ichi Tokuno, Nobuhito Inami, Shigeki Matsuda, M. Nakai, H. Shimodaira, S. Sagayama\",\"doi\":\"10.1109/IWFHR.2002.1030888\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Describes context-dependent substroke hidden Markov models (HMMs)for on-line handwritten recognition of cursive Kanji and Hiragana characters. In order to tackle this problem, we have proposed the substroke HMM approach where a modeling unit \\\"substroke\\\" that is much smaller than a whole character is employed and each character is modeled as a concatenation of only 25 kinds of substroke HMMs. One of the drawbacks of this approach is that the recognition accuracy deteriorates in the case of scribbled characters, and characters where the shape of the substrokes varies a lot. We show that the context-dependent substroke modeling which depends on how the substroke connects to the adjacent substrokes is effective for achieving robust recognition of low quality characters, The successive state splitting algorithm which was mainly developed for speech recognition is employed to construct the context dependent substroke HMMs. Experimental results show that the correct recognition rate improved from 88% to 92% for cursive Kanji handwriting and from 90% to 98% for Hiragana handwriting.\",\"PeriodicalId\":114017,\"journal\":{\"name\":\"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition\",\"volume\":\"293 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"43\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWFHR.2002.1030888\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWFHR.2002.1030888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43

摘要

描述基于上下文的隐马尔可夫模型(hmm)用于草书汉字和平假名字符的在线手写识别。为了解决这个问题,我们提出了子笔画HMM方法,其中使用了一个比整个字符小得多的建模单元“子笔画”,并且每个字符仅被建模为25种子笔画HMM的串联。该方法的缺点之一是,对于潦草的字符和下笔形状变化较大的字符,识别精度会下降。研究表明,基于上下文的子笔画模型可以有效地实现对低质量字符的鲁棒识别,并采用了语音识别领域的连续状态分裂算法来构建上下文相关的子笔画hmm模型。实验结果表明,草书汉字的正确率从88%提高到92%,平假名的正确率从90%提高到98%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Context-dependent substroke model for HMM-based on-line handwriting recognition
Describes context-dependent substroke hidden Markov models (HMMs)for on-line handwritten recognition of cursive Kanji and Hiragana characters. In order to tackle this problem, we have proposed the substroke HMM approach where a modeling unit "substroke" that is much smaller than a whole character is employed and each character is modeled as a concatenation of only 25 kinds of substroke HMMs. One of the drawbacks of this approach is that the recognition accuracy deteriorates in the case of scribbled characters, and characters where the shape of the substrokes varies a lot. We show that the context-dependent substroke modeling which depends on how the substroke connects to the adjacent substrokes is effective for achieving robust recognition of low quality characters, The successive state splitting algorithm which was mainly developed for speech recognition is employed to construct the context dependent substroke HMMs. Experimental results show that the correct recognition rate improved from 88% to 92% for cursive Kanji handwriting and from 90% to 98% for Hiragana handwriting.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信