A Semi-incremental Recognition Method for On-Line Handwritten English Text

C. Nguyen, Bilan Zhu, M. Nakagawa
{"title":"A Semi-incremental Recognition Method for On-Line Handwritten English Text","authors":"C. Nguyen, Bilan Zhu, M. Nakagawa","doi":"10.1109/ICFHR.2014.47","DOIUrl":null,"url":null,"abstract":"This paper presents a semi-incremental recognition method for online handwritten English text. We employ local processing strategy and focus on a recent sequence of strokes defined as \"scope\". For the latest scope, we build and update a segmentation and recognition candidate lattice and advance the best-path search incrementally. We utilize the result of the best-path search in the previous scope to exclude unnecessary segmentation candidates. This reduces the number of candidate word recognition with the result of reduced processing time. We also reuse the segmentation and recognition candidate lattice in the previous scope for the latest scope. Moreover, triggering recognition processes every few strokes save CPU time. Experiment made on IAM-OnDB database shows the effectiveness of the proposed method not only in reduced processing time and waiting time, but also in recognition accuracy.","PeriodicalId":268688,"journal":{"name":"2014 14th International Conference on Frontiers in Handwriting Recognition","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 14th International Conference on Frontiers in Handwriting Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFHR.2014.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

This paper presents a semi-incremental recognition method for online handwritten English text. We employ local processing strategy and focus on a recent sequence of strokes defined as "scope". For the latest scope, we build and update a segmentation and recognition candidate lattice and advance the best-path search incrementally. We utilize the result of the best-path search in the previous scope to exclude unnecessary segmentation candidates. This reduces the number of candidate word recognition with the result of reduced processing time. We also reuse the segmentation and recognition candidate lattice in the previous scope for the latest scope. Moreover, triggering recognition processes every few strokes save CPU time. Experiment made on IAM-OnDB database shows the effectiveness of the proposed method not only in reduced processing time and waiting time, but also in recognition accuracy.
在线手写英语文本的半增量识别方法
提出了一种半增量的在线手写英语文本识别方法。我们采用局部处理策略,并专注于定义为“范围”的近期笔画序列。对于最新的范围,我们建立并更新了一个分割和识别候选格,并逐步推进最佳路径搜索。我们利用前一个范围内的最佳路径搜索结果来排除不必要的分割候选。这减少了候选词识别的数量,从而减少了处理时间。我们还将之前范围中的分割和识别候选格重用到最新范围中。此外,每隔几次触发识别过程可以节省CPU时间。在IAM-OnDB数据库上进行的实验表明,该方法不仅减少了处理时间和等待时间,而且提高了识别精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信