利用循环信念传播辅助模糊离线手写识别

Yilan Li, Zhe Li, Qinru Qiu
{"title":"利用循环信念传播辅助模糊离线手写识别","authors":"Yilan Li, Zhe Li, Qinru Qiu","doi":"10.1109/SSCI.2016.7850026","DOIUrl":null,"url":null,"abstract":"Recognizing handwritten texts is a challenging task due to many different writing styles and lack of clear boundary between adjacent characters. This problem has been tackled by many previous researchers using techniques such as deep learning networks and hidden Markov Models (HMM), etc. In this work we aim at offline fuzzy recognition of handwritten texts. A probabilistic inference network that performs recurrent belief propagation is developed to post process the recognition results of deep convolutional neural network (CNN) (e.g. LeNet) and form individual characters to words. The post processing has the capability of correcting deletion, insertion and replacement errors in a noisy input. The output of the inference network is a set of words with their probability of being the correct one. To limit the size of candidate words, a series of improvements have been made to the probabilistic inference network, including using a post Gaussian Mixture Estimation model to prune insignificant words. The experiments show that this model gives a competitively average accuracy of 85.5%, and the improvements provides 46.57% reduction of invalid candidate words.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Assisting fuzzy offline handwriting recognition using recurrent belief propagation\",\"authors\":\"Yilan Li, Zhe Li, Qinru Qiu\",\"doi\":\"10.1109/SSCI.2016.7850026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recognizing handwritten texts is a challenging task due to many different writing styles and lack of clear boundary between adjacent characters. This problem has been tackled by many previous researchers using techniques such as deep learning networks and hidden Markov Models (HMM), etc. In this work we aim at offline fuzzy recognition of handwritten texts. A probabilistic inference network that performs recurrent belief propagation is developed to post process the recognition results of deep convolutional neural network (CNN) (e.g. LeNet) and form individual characters to words. The post processing has the capability of correcting deletion, insertion and replacement errors in a noisy input. The output of the inference network is a set of words with their probability of being the correct one. To limit the size of candidate words, a series of improvements have been made to the probabilistic inference network, including using a post Gaussian Mixture Estimation model to prune insignificant words. The experiments show that this model gives a competitively average accuracy of 85.5%, and the improvements provides 46.57% reduction of invalid candidate words.\",\"PeriodicalId\":120288,\"journal\":{\"name\":\"2016 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSCI.2016.7850026\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSCI.2016.7850026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

手写文本的识别是一项具有挑战性的任务,因为书写风格不同,相邻字符之间缺乏清晰的边界。许多研究者使用深度学习网络和隐马尔可夫模型(HMM)等技术解决了这个问题。在这项工作中,我们的目标是手写文本的离线模糊识别。开发了一种循环信念传播的概率推理网络,对深度卷积神经网络(CNN)(如LeNet)的识别结果进行后处理,形成单个字符到单词。后置处理具有校正噪声输入中的删除、插入和替换错误的能力。推理网络的输出是一组具有正确概率的单词。为了限制候选词的大小,对概率推理网络进行了一系列改进,包括使用后高斯混合估计模型来修剪不重要的词。实验表明,该模型的竞争平均准确率为85.5%,改进后的无效候选词减少了46.57%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Assisting fuzzy offline handwriting recognition using recurrent belief propagation
Recognizing handwritten texts is a challenging task due to many different writing styles and lack of clear boundary between adjacent characters. This problem has been tackled by many previous researchers using techniques such as deep learning networks and hidden Markov Models (HMM), etc. In this work we aim at offline fuzzy recognition of handwritten texts. A probabilistic inference network that performs recurrent belief propagation is developed to post process the recognition results of deep convolutional neural network (CNN) (e.g. LeNet) and form individual characters to words. The post processing has the capability of correcting deletion, insertion and replacement errors in a noisy input. The output of the inference network is a set of words with their probability of being the correct one. To limit the size of candidate words, a series of improvements have been made to the probabilistic inference network, including using a post Gaussian Mixture Estimation model to prune insignificant words. The experiments show that this model gives a competitively average accuracy of 85.5%, and the improvements provides 46.57% reduction of invalid candidate words.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信