Share Email Print

Proceedings Paper

Dynamic programming approach to template-based OCR
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 15 March 2019
PDF: 8 pages
Proc. SPIE 11041, Eleventh International Conference on Machine Vision (ICMV 2018), 110411T (15 March 2019); doi: 10.1117/12.2522974
Show Author Affiliations
Mikhail A. Povolotskiy, Institute for Information Transmission Problems (Russian Federation)
Moscow Institute of Physics and Technology (Russian Federation)
Daniil V. Tropin, Moscow Institute of Physics and Technology (Russian Federation)
Smart Engines Ltd. (Russian Federation)

Published in SPIE Proceedings Vol. 11041:
Eleventh International Conference on Machine Vision (ICMV 2018)
Antanas Verikas; Dmitry P. Nikolaev; Petia Radeva; Jianhong Zhou, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?