{"title":"Handwritten numeral string recognition with stroke grouping","authors":"C. E. Cheong, Ho-Yon Kim, J. Suh, J. H. Kim","doi":"10.1109/ICDAR.1999.791895","DOIUrl":null,"url":null,"abstract":"In this paper a framework for off-line handwritten numeral string recognition based on stroke grouping is proposed. In our approach, strokes are aligned into a sequence of strokes and then a segmentation process is performed to partition strokes in the sequence into possible-digits, that is, groups of strokes which may be a digit. As a result of stroke grouping, grouping-hypotheses, which imply possible segmentation, are generated. An input numeral string is recognized by a dynamic programming scheme, in which the best grouping-hypothesis with maximum matching score is chosen. The framework also provides a systematic way of reducing computational complexity by embedding external knowledge into the framework. The experimental results to evaluate the proposed framework are shown.","PeriodicalId":130039,"journal":{"name":"Proceedings of the Fifth International Conference on Document Analysis and Recognition. ICDAR '99 (Cat. No.PR00318)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth International Conference on Document Analysis and Recognition. ICDAR '99 (Cat. No.PR00318)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDAR.1999.791895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper a framework for off-line handwritten numeral string recognition based on stroke grouping is proposed. In our approach, strokes are aligned into a sequence of strokes and then a segmentation process is performed to partition strokes in the sequence into possible-digits, that is, groups of strokes which may be a digit. As a result of stroke grouping, grouping-hypotheses, which imply possible segmentation, are generated. An input numeral string is recognized by a dynamic programming scheme, in which the best grouping-hypothesis with maximum matching score is chosen. The framework also provides a systematic way of reducing computational complexity by embedding external knowledge into the framework. The experimental results to evaluate the proposed framework are shown.