ICDAR 2003 robust reading competitions
ICDAR 2003 robust reading competitions
复制标题
DOI：
10.1109/icdar.2003.1227749
复制
发表时间：
2003-08
期刊：
影响因子：
--
通讯作者：
S. Lucas;A. Panaretos;Luis Sosa;Anthony Tang;Shirley Wong;Robert Young
中科院分区：
文献类型：
--
作者：
S. Lucas;A. Panaretos;Luis Sosa;Anthony Tang;Shirley Wong;Robert Young
本文描述了icdar 2003的稳健阅读竞赛。随着近年来自然场景文本识别研究的快速发展，迫切需要建立一些通用的基准数据集，并对当前的技术状况有一个清晰的认识。我们使用稳健读取一词来指超出当前商用ocr软件包能力的文本图像。我们选择将稳健阅读问题分解为三个子问题，并对每个阶段进行比赛，同时也进行最佳整体系统的比赛。我们选择的子问题是文本定位、字符识别和单词识别。通过以这种方式分解问题，我们希望更好地理解每个子问题的现状。此外，我们的方法包括存储将每种算法应用于数据集中的每个图像的详细结果，使研究人员能够深入研究每种算法的优缺点。文本定位比赛是唯一有参赛作品的比赛。我们报告了这次比赛的结果，并展示了领先算法的成功和失败的案例。
This paper describes the robust reading competitions forICDAR 2003. With the rapid growth in research over thelast few years on recognizing text in natural scenes, thereis an urgent need to establish some common benchmarkdatasets, and gain a clear understanding of the current stateof the art. We use the term robust reading to refer to text imagesthat are beyond the capabilities of current commercialOCR packages. We chose to break down the robust readingproblem into three sub-problems, and run competitionsfor each stage, and also a competition for the best overallsystem. The sub-problems we chose were text locating,character recognition and word recognition.By breaking down the problem in this way, we hope togain a better understanding of the state of the art in eachof the sub-problems. Furthermore, our methodology involvesstoring detailed results of applying each algorithm toeach image in the data sets, allowing researchers to study indepth the strengths and weaknesses of each algorithm. Thetext locating contest was the only one to have any entries.We report the results of this contest, and show cases wherethe leading algorithms succeed and fail.