Run-time Behavior of Contour Tracing Algorithms for Document Conversion

low cost and reliable system. In this paper, we present the run-time behavior of contour tracing algorithms for processing large documents, in a contemporary workstation environment. The performance criteria examined are processing time, memory usage, and the number of page faults. A new contour tracing algorithm based on Capson's algorithm is proposed and it is compared with other algorithms. It is observed that for the set of document images under test, the new algorithm consumes the least amount of memory, has the smallest number of page faults and is slightly faster than Capson's algorithm.