DocumentCode :
3327110
Title :
The iterated complete path algorithm
Author :
Kam, Anthony C. ; Kopec, Gary E.
Author_Institution :
Caliper Corp., Newton, MA, USA
Volume :
2
fYear :
1995
fDate :
14-16 Aug 1995
Firstpage :
1088
Abstract :
The iterated complete path (ICP) algorithm is a heuristic search procedure for finding the best path through a weighted trellis. ICP is intended for problems in which the cost of computing the edge weights dominates the cost of finding the path given the weights. This paper describes ICP and its application to document image decoding
Keywords :
document image processing; dynamic programming; search problems; ICP; best path; document image decoding; edge weights; heuristic search procedure; iterated complete path; weighted trellis; Computational efficiency; Cost function; Data structures; Decoding; Dynamic programming; Heuristic algorithms; Iterative closest point algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Document Analysis and Recognition, 1995., Proceedings of the Third International Conference on
Conference_Location :
Montreal, Que.
Print_ISBN :
0-8186-7128-9
Type :
conf
DOI :
10.1109/ICDAR.1995.602098
Filename :
602098
Link To Document :
بازگشت