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