离线手写字识别(HWR)使用单一上下文隐马尔可夫模型

Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Pub Date : 1992-06-15 DOI:10.1109/CVPR.1992.223205

Mou-Yen Chen, A. Kundu, Jian Zhou

{"title":"离线手写字识别(HWR)使用单一上下文隐马尔可夫模型","authors":"Mou-Yen Chen, A. Kundu, Jian Zhou","doi":"10.1109/CVPR.1992.223205","DOIUrl":null,"url":null,"abstract":"A complete scheme for totally unconstrained handwritten word recognition based on a single contextual hidden Markov model (HMM) is proposed. The scheme includes a morphology- and heuristics-based segmentation algorithm and a modified Viterbi algorithm that searches the (l+1)st globally best path based on the previous l best paths. The results of detailed experiments for which the overall recognition rate is up to 89.4% are reported.<<ETX>>","PeriodicalId":325476,"journal":{"name":"Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Off-line handwritten word recognition (HWR) using a single contextual hidden Markov model\",\"authors\":\"Mou-Yen Chen, A. Kundu, Jian Zhou\",\"doi\":\"10.1109/CVPR.1992.223205\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A complete scheme for totally unconstrained handwritten word recognition based on a single contextual hidden Markov model (HMM) is proposed. The scheme includes a morphology- and heuristics-based segmentation algorithm and a modified Viterbi algorithm that searches the (l+1)st globally best path based on the previous l best paths. The results of detailed experiments for which the overall recognition rate is up to 89.4% are reported.<<ETX>>\",\"PeriodicalId\":325476,\"journal\":{\"name\":\"Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CVPR.1992.223205\",\"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 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CVPR.1992.223205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 23

摘要

提出了一种基于单一上下文隐马尔可夫模型(HMM)的完全无约束手写体单词识别方案。该方案包括基于形态学和启发式的分割算法和改进的Viterbi算法，该算法基于前l个最佳路径搜索(l+1)个全局最佳路径。详细的实验结果表明，总体识别率高达89.4%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Off-line handwritten word recognition (HWR) using a single contextual hidden Markov model

A complete scheme for totally unconstrained handwritten word recognition based on a single contextual hidden Markov model (HMM) is proposed. The scheme includes a morphology- and heuristics-based segmentation algorithm and a modified Viterbi algorithm that searches the (l+1)st globally best path based on the previous l best paths. The results of detailed experiments for which the overall recognition rate is up to 89.4% are reported.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition

自引率

0.00%

发文量