Abstract
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.
| Original language | English |
|---|---|
| Pages | 361-364 |
| Number of pages | 4 |
| Publication status | Published - 1996 |
| Event | 5th IAPR Workshop on Machine Vision Applications, MVA 1996 - Tokyo, Japan Duration: 12 Nov 1996 → 14 Nov 1996 |
Conference
| Conference | 5th IAPR Workshop on Machine Vision Applications, MVA 1996 |
|---|---|
| Country/Territory | Japan |
| City | Tokyo |
| Period | 12/11/96 → 14/11/96 |