Tong-Hua Su, Tian-Wen Zhang, Hu-Jie Huang, Yu Zhou
{"title":"基于hmm的无分割中文手写文本识别方法","authors":"Tong-Hua Su, Tian-Wen Zhang, Hu-Jie Huang, Yu Zhou","doi":"10.1109/ICDAR.2007.133","DOIUrl":null,"url":null,"abstract":"A segmentation-free strategy based on hidden Markov models (HMMs) is presented for offline recognition of unconstrained Chinese handwriting. As the first step, handwritten textlines are converted to observation sequence by sliding windows and character segmentation stage is avoided prior to recognition. Following that, embedded Baum-Welch algorithm is adopted to train character HMMs. Finally, best character string maximizing the a posteriori is located through Viterbi algorithm. Experiments are conducted on the HIT-MW database written by more than 780 writers. The results show: First, our baseline recognizer outperforms one segmentation-based OCR product with 35% relative improvement; second, more discriminative feature and compact representation, and state-tying technique to alleviate the data sparsity can enhance the recognizer with high confidence. The final recognizer has improved the performance by 10.77% than the baseline system.","PeriodicalId":279268,"journal":{"name":"Ninth International Conference on Document Analysis and Recognition (ICDAR 2007)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"HMM-Based Recognizer with Segmentation-free Strategy for Unconstrained Chinese Handwritten Text\",\"authors\":\"Tong-Hua Su, Tian-Wen Zhang, Hu-Jie Huang, Yu Zhou\",\"doi\":\"10.1109/ICDAR.2007.133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A segmentation-free strategy based on hidden Markov models (HMMs) is presented for offline recognition of unconstrained Chinese handwriting. As the first step, handwritten textlines are converted to observation sequence by sliding windows and character segmentation stage is avoided prior to recognition. Following that, embedded Baum-Welch algorithm is adopted to train character HMMs. Finally, best character string maximizing the a posteriori is located through Viterbi algorithm. Experiments are conducted on the HIT-MW database written by more than 780 writers. The results show: First, our baseline recognizer outperforms one segmentation-based OCR product with 35% relative improvement; second, more discriminative feature and compact representation, and state-tying technique to alleviate the data sparsity can enhance the recognizer with high confidence. The final recognizer has improved the performance by 10.77% than the baseline system.\",\"PeriodicalId\":279268,\"journal\":{\"name\":\"Ninth International Conference on Document Analysis and Recognition (ICDAR 2007)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ninth International Conference on Document Analysis and Recognition (ICDAR 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDAR.2007.133\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ninth International Conference on Document Analysis and Recognition (ICDAR 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDAR.2007.133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
HMM-Based Recognizer with Segmentation-free Strategy for Unconstrained Chinese Handwritten Text
A segmentation-free strategy based on hidden Markov models (HMMs) is presented for offline recognition of unconstrained Chinese handwriting. As the first step, handwritten textlines are converted to observation sequence by sliding windows and character segmentation stage is avoided prior to recognition. Following that, embedded Baum-Welch algorithm is adopted to train character HMMs. Finally, best character string maximizing the a posteriori is located through Viterbi algorithm. Experiments are conducted on the HIT-MW database written by more than 780 writers. The results show: First, our baseline recognizer outperforms one segmentation-based OCR product with 35% relative improvement; second, more discriminative feature and compact representation, and state-tying technique to alleviate the data sparsity can enhance the recognizer with high confidence. The final recognizer has improved the performance by 10.77% than the baseline system.