Eleventh International Conference on Machine Vision (ICMV 2018) 2019
DOI: 10.1117/12.2522974
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic programming approach to template-based OCR

Abstract: In this paper we propose a dynamic programming solution to the template-based recognition task in OCR case. We formulate a problem of optimal position search for complex objects consisting of parts forming a sequence. We limit the distance between every two adjacent elements with predefined upper and lower thresholds. We choose the sum of penalties for each part in given position as a function to be minimized. We show that such a choice of restrictions allows a faster algorithm to be used than the one for the … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…Based on these components, such approaches restore the overall structure. Bottom-up group includes methods based on groups of connected components analysis, line segments identification [71], morphological image analysis for text components search [72], textual key points and relations between them [73], and methods based on Voronoi diagrams and Delaunay triangulation.…”
Section: Document Structure Analysis Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…Based on these components, such approaches restore the overall structure. Bottom-up group includes methods based on groups of connected components analysis, line segments identification [71], morphological image analysis for text components search [72], textual key points and relations between them [73], and methods based on Voronoi diagrams and Delaunay triangulation.…”
Section: Document Structure Analysis Algorithmsmentioning
confidence: 99%
“…In [125], the problem of a composite object segmentation with known constraints on the mutual arrangement of its elements is considered. In [72], the case when the constraint graph is a simple chain is considered, and by means of dynamic programming, the search of field boundaries for IDs and license plates is performed.…”
Section: Extraction Of Attributesmentioning
confidence: 99%
“…The method of segmentation could vary from zone to zone, depending on its structure: some zones could have fixed local coordinates of each individual object or field, specified in its configuration, and thus no additional search is required. Other zones may require a search of precise field coordinates with respect to a predefined pattern of fields [79], or even an application of a free-form text detection [80]. For the latter cases, similar quality metrics could be applied as for the task of document template location, such as Jaccard distance and other Intersection-Over-Union-based metrics [81] or, for independent analysis of text fields detection given their OCR results (see below), characterlevel metrics such as TedEval [82] or CLEval [83].…”
Section: C) Template Processingmentioning
confidence: 99%
“…Templates define the strictest constraints on the location of each zone and are most commonly used for identity documents. In [25,29,30], document templates are used for the localization and classification of document images, but they are also helpful in field segmentation [31]. Flexible form models are based on text segmentation and recognition result analysis and describe documents with soft restrictions on their structure.…”
Section: Document Image Quality Assessment Problem Statementmentioning
confidence: 99%