Dynamic programming operation with skip mode for text line image decoding
US6594393B1 · kind B1 · utility
Inventors
Key dates
| Filing date | May 12, 2000 |
| Grant date | Jul 15, 2003 |
| Priority date | — |
| Expiry date | May 12, 2020 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99936
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In a text recognition system, the computational efficiency of a text line image decoding operation is improved by utilizing the characteristic of a graph known as the cut set. The branches of the data structure that represents the image are initially labeled with estimated scores. When estimated scores are used, the decoding operation must perform iteratively on a text line before producing the best path through the data structure. After each iteration, nodes in the best path are re-scored with actual scores. The decoding operation incorporates an operating mode called skip mode. When the number of consecutive image positions for which the change value of cumulative path scores between current and prior iterations is substantially constant and exceeds a threshold, this signals the presence of a cut set, and the score change value is added to a previously computed path score until a re-scored node is encountered, thereby eliminating the expensive computation of new cumulative path scores at those image positions.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.