Academia.eduAcademia.edu

Outline

Semi Automatic Digitizing of Contours from 1:25000 Scaled Maps

Abstract

It is an expensive and time consuming task to digitize 1:25000 scaled maps which are made in the past with analogue methods. The development in digital image processing depending on the development of hardware technology made this process less expensive and faster. This study is based on this reality. In this thesis a new algorithm which aims to decrease human work time by making the work carried out to digitize 1:25000 scaled maps easily and less time consuming was developed. The first step of the process is interactively rectification of the map. The grid network is used for rectification. Scanned maps at the scale of 1:25000 and the training area on this map which is given by the operator that is showing the elevation contour pixels are used as input data. The other elevation contour pixels are determined automatically. Elevation contours in vector format are created from the elevation contours in raster format. Produced vectors may contain errors depended on the topographic condition of the map area. Elevation contours with XY coordinates are generated after the manual editing. The Z values of these contours are given by the operator before the end of the process. Finally, produced data is saved in ASCII format which is supported by common CAD, GIS and engineering software. The output file contains X, Y, Z values delimited with comma (",").

Key takeaways
sparkles

AI

  1. The developed algorithm reduces digitizing time of 1:25000 scaled maps to 4 hours - 1 week.
  2. Using 200 dpi resolution scanned maps enables effective semi-automatic contour recognition.
  3. Contour recognition relies on interactive rectification and training sample collection.
  4. Software produces XYZ ASCII output compatible with CAD and GIS applications.
  5. The algorithm efficiently handles up to 2 million broken contours without increasing analysis time.

References (6)

  1. REFERENCES
  2. Chung Y., Prasanna V. K., Wang C., 1995. A Fast Asynchronous Algorithm for Linear Feature Extraction on IBM SP-2. Workshop on Computer Architecture for Machine Perception, September, pp. 294 -301.
  3. Costa R. D., John Starkey, 2001. Photolin: A Program To Identify And Analyze Linear Structures İn Aerial Photographs, Satellite Images And Maps. Computers & Geosciences 27, pp. 527 -534.
  4. Esposito F., Lanza A., Malerba D., Semeraro G., 1998. Information Capture from Topographic Maps Using Machine Learning. Proceedings of Joint Workshop of the Italian Association for Artificial Intelligence (AI*IA) and the International Association for Pattern Recognition -Italian Chapter (IAPR-IC) on "Artificial Intelligence and Pattern Recognition Techniques for Computer Vision", April 6-7, pp. 122-127.
  5. Wenyin, L., Dori D. 1999. From Raster to Vectors: Extracting Visual Information from Line Drawings. Pattern Analysis and Applications, 2(2), pp. 10-21.
  6. Wenyin L., Dori D., 1999. Principles Of Constructing A Performance Evaluation Protocol For Graphics Recognition Algorithms. Performance Characterization and Evaluation of Computer Vision Algorithms, Kluwer, pp.97-106.