首页> 外文期刊>Pattern recognition letters >Convolutional pyramid of bidirectional character sequences for the recognition of handwritten words
【24h】

Convolutional pyramid of bidirectional character sequences for the recognition of handwritten words

机译:双向字符序列的卷积金字塔用于手写单词的识别

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Handwritten word recognition is a challenging task due to the large intra-class variability of handwritten shapes and the complexity of modeling and segmenting sequences of overlapping characters. This work proposes a novel approach based on deep convolutional neural networks (CNNs), which does not require the explicit segmentation of characters and can learn a suitable representation for handwritten data in an automated way. The proposed approach uses a CNN to learn the mapping from word images to a robust representation, called pyramid of bidirectional character sequences. This novel representation encodes sub-sequences of characters in a hierarchical manner, considering both forward and backward directions. An efficient inference technique is then employed to find the most likely word in a lexicon, based on the CNN output probabilities. By implicitly modeling the distribution of character sub-sequences in the data, our approach can transfer knowledge across words containing the same sub-sequences. The proposed approach achieves a word error rate of 8.83% on the IAM database and 6.22% on the RIEMS database, outperforming recent methods for this task. (C) 2018 Elsevier B.V. All rights reserved.
机译:手写单词识别是一项具有挑战性的任务,因为手写形状的类内差异很大,并且重叠字符的建模和分段序列非常复杂。这项工作提出了一种基于深度卷积神经网络(CNN)的新颖方法,该方法不需要显式的字符分割,并且可以自动方式为手写数据学习合适的表示形式。所提出的方法使用CNN来学习从单词图像到鲁棒表示的映射,称为双向字符序列金字塔。这种新颖的表示方式考虑了向前和向后的方向,以分层的方式对字符的子序列进行编码。然后,基于CNN输出概率,采用有效的推理技术在词典中找到最可能的单词。通过对数据中字符子序列的分布进行隐式建模,我们的方法可以跨包含相同子序列的单词传递知识。所提出的方法在IAM数据库上实现了8.83%的单词错误率,在RIEMS数据库上实现了6.22%的单词错误率,胜过该任务的最新方法。 (C)2018 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号