arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.03337cs.CVcs.LGstat.ML

现代与历史手写数字串识别的端到端方法

An End-to-End Approach for Recognition of Modern and Historical Handwritten Numeral Strings

Pontifícia Universidade Católica do Paraná(巴拉那天主教大学);Universidade Federal do Paraná(巴拉那联邦大学);École de Technologie Supérieure(高等技术学院)

Andre G. Hochuli, Alceu S. Britto, Jean P. Barddal, Luiz E. S. Oliveira, Robert Sabourin

AI总结:

本文提出一种基于YoLo模型的端到端手写数字串识别方法,将数字串视为自动检测和识别的对象,避免了启发式预处理、分割和特定长度约束,在多个数据集上验证了其可行性与低复杂性。

摘要:

本文提出了一种用于手写数字串识别的端到端解决方案,其中数字串被视为由基于YoLo的模型自动检测和识别的对象所组成。本文的主要贡献在于避免了基于启发式的字符串预处理和分割方法,无需面向任务的分类器,并且不使用与字符串长度相关的特定约束。基于多个数字串数据集(包括一个由历史文档组成的数据集)的鲁棒实验协议表明,所提出的方法是数字串识别的可行端到端解决方案。此外,它大幅降低了字符串识别任务的复杂性,因为它舍弃了经典步骤,特别是预处理、分割以及一组专用于特定长度字符串的分类器。

英文摘要:

An end-to-end solution for handwritten numeral string recognition is proposed, in which the numeral string is considered as composed of objects automatically detected and recognized by a YoLo-based model. The main contribution of this paper is to avoid heuristic-based methods for string preprocessing and segmentation, the need for task-oriented classifiers, and also the use of specific constraints related to the string length. A robust experimental protocol based on several numeral string datasets, including one composed of historical documents, has shown that the proposed method is a feasible end-to-end solution for numeral string recognition. Besides, it reduces the complexity of the string recognition task considerably since it drops out classical steps, in special preprocessing, segmentation, and a set of classifiers devoted to strings with a specific length.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑