Raster to Vector Conversion in a Map Interpretation System

This paper describesthe two components: thinning and vectorization,at the front end of a GeographicInformation System. The raster dataset associatedwith a map is very large. A small D-sized drawinggives a 120Mpixel document. The amount of page faultsencountered by a typical conventional thinning algorithm is so large that the run timeisdominatedby disk110time. TheContour Generation Thinning Algorithm based on chain codes has been adopted and the amount of page faults are reduced by a factor equal to the total number of iterations. The skeletonis vectorized by traversing the chain codes and examining the raster. A tagging scheme isused that allows the vectorization process to identify all the end points and multiply-connected nodes.

• Type: Conference
• Year: 1990
• Where: MVA
• Authors: Paul C. K. Kwok, T. John Turner
• Keywords: Conventional Thinning Algorithm, Generation Thinning Algorithm, MVA 1990, MVA 2007, Thinning Algorithm