Document Image Decoding

It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In the Iterated Complete Path (ICP) method, template matches are performed only along the best path found by dynamic programming on each iteration. When the best path stabilizes, the decoding is optimal and no more template matches need be performed. In this way, only a tiny fraction of potential template matches must be evaluated, and the computation time is typically dominated by the evaluation of the initial heuristic upper-bound for each template at each location in the image. The time to compute this bound depends on the resolution at which the matching scores are found. At lower resolution, the heuristic computation is reduced, but because a weaker bound is used, the number of Viterbi iterations is increased. We present the optimal (lowest upperbound) heuristic for any degree of subsampling of multilevel t...

• Type: Conference
• Year: 1994
• Where: ICIP
• Authors: Gary E. Kopec, Philip A. Chou
• Keywords: ICIP 1994, Image Processing, Overall Decoding Time, Template Matches, Template Subsampling