Paper
15 March 2019 Dynamic programming approach to template-based OCR
Author Affiliations +
Proceedings Volume 11041, Eleventh International Conference on Machine Vision (ICMV 2018); 110411T (2019) https://doi.org/10.1117/12.2522974
Event: Eleventh International Conference on Machine Vision (ICMV 2018), 2018, Munich, Germany
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 general form of deformation penalties. We named this algorithm Dynamic Squeezeboxes Packing (DSP) and applied it to solve the two OCR problems: text fields extraction from an image of document Visual Inspection Zone (VIZ) and license plate segmentation. The quality and the performance of resulting solutions were experimentally proved to meet the requirements of the state-of-the-art industrial recognition systems.
© (2019) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mikhail A. Povolotskiy and Daniil V. Tropin "Dynamic programming approach to template-based OCR", Proc. SPIE 11041, Eleventh International Conference on Machine Vision (ICMV 2018), 110411T (15 March 2019); https://doi.org/10.1117/12.2522974
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital signal processing

Image segmentation

Optical character recognition

Computer programming

Detection and tracking algorithms

Image processing algorithms and systems

Animal model studies

Back to Top