The Community for Technology Leaders
Green Image
Issue No. 09 - September (1996 vol. 18)
ISSN: 0162-8828
pp: 945-950
ABSTRACT
<p><b>Abstract</b>—This correspondence describes an approach to reducing the computational cost of document image decoding by viewing it as a heuristic search problem. The kernel of the approach is a modified dynamic programming (DP) algorithm, called the <it>iterated complete path</it> (ICP) algorithm, that is intended for use with separable source models. A set of heuristic functions are presented for decoding formatted text with ICP. Speedups of 3-25 over DP have been observed when decoding text columns and telephone yellow pages using ICP and the proposed heuristics.</p>
INDEX TERMS
Document image decoding, Markov models, heuristic search, dynamic programming.
CITATION

G. E. Kopec and A. C. Kam, "Document Image Decoding by Heuristic Search," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 18, no. , pp. 945-950, 1996.
doi:10.1109/34.537350
93 ms
(Ver 3.3 (11022016))