English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this paper we propose a dynamic programming solution to the template-basedrecognition task in OCR case. We formulate a problem of optimal position searchfor complex objects consisting of parts forming a sequence. We limit thedistance between every two adjacent elements with predefined upper and lowerthresholds. We choose the sum of penalties for each part in given position as afunction to be minimized. We show that such a choice of restrictions allows afaster algorithm to be used than the one for the general form of deformationpenalties. We named this algorithm Dynamic Squeezeboxes Packing (DSP) andapplied it to solve the two OCR problems: text fields extraction from an imageof document Visual Inspection Zone (VIZ) and license plate segmentation. Thequality and the performance of resulting solutions were experimentally provedto meet the requirements of the state-of-the-art industrial recognitionsystems.

Dynamic Programming Approach to Template-based OCR