Vision-Based Image Processing of Digitized Cadastral Maps

This paper presents an automatic method for processing digitized images of cadastral maps. The method includes two major algorithms: a segmentation and a Raster-to-Vector conversion. Those algorithms use a simple data-list structure for recording data created during single-pass, row-majority scanning and line tracing. The segmentation algorithm obtains the positions and sizes of symbols and characters, in addition to completing map segmentation and proving useful for pattern recognition. The Raster-to-Vector conversion alprithm obtains topological information necessary to relate cadastral map spatial data to line start points, midpoints, intersection points, and termination points. It consists of four integrated sub-algorithms that remove noise, unify run-length coordinates, and perform synchronous line approximations and logical linkage of line breaks. Straight, angled, and curved lines can then be completely reconstructed for display. Also presented are six indices that verify algorithm and experimental results.

[1]  Theo Pavlidis,et al.  Algorithms for Graphics and Imag , 1983 .

[2]  Linda G. Shapiro,et al.  Computer and Robot Vision , 1991 .

[3]  Charles M. Williams,et al.  An Efficient Algorithm for the Piecewise Linear Approximation of Planar Curves , 1978 .

[4]  James Robergé A data reduction algorithm for planar curves , 1985, Comput. Vis. Graph. Image Process..

[5]  K. Ramachandran,et al.  Coding method for vector representation of engineering drawings , 1980, Proceedings of the IEEE.

[6]  Donna J. Peuquet,et al.  An Examination Of Techniques For Reformatting Digital Cartographic Data / Part 2: The Vector-To-Raster Process , 1981 .

[7]  Linda G. Shapiro,et al.  A new connected components algorithm for virtual memory computers , 1983, Comput. Vis. Graph. Image Process..

[8]  Mohamad T. Musavi,et al.  A vision based method to automate map processing , 1988, Pattern Recognit..

[9]  Hiromitsu Yamada,et al.  MAP: Multi-angled parallelism for feature extraction from topographical maps , 1991, Pattern Recognit..

[10]  Noshir A. Langrana,et al.  Engineering Drawing Processing and Vectorization System , 1990, Comput. Vis. Graph. Image Process..

[11]  Toru Kaneko Line structure extraction from line-drawing images , 1992, Pattern Recognit..

[12]  Larry S. Davis,et al.  A Corner-Finding Algorithm for Chain-Coded Curves , 1977, IEEE Transactions on Computers.

[13]  Roland T. Chin,et al.  On the Detection of Dominant Points on Digital Curves , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Hiromitsu Yamada,et al.  Directional Mathematical Morphology and Reformalized Hough Transformation for the Analysis of Topographic Maps , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[16]  Christian Ronse,et al.  Book-Review - Connected Components in Binary Images - the Detection Problem , 1984 .

[17]  Michael S. Landy,et al.  Vectorgraph coding: Efficient coding of line drawings , 1985, Comput. Vis. Graph. Image Process..

[18]  Karin Wall,et al.  A fast sequential method for polygonal approximation of digitized curves , 1984, Comput. Vis. Graph. Image Process..

[19]  Azriel Rosenfeld,et al.  An Improved Method of Angle Detection on Digital Curves , 1975, IEEE Transactions on Computers.

[20]  T. Pavlidis Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.