Smoothing and Compression of Lines Obtained by Raster-to-Vector Conversion

This paper presents analyses of different methods of post-processing lines that have resulted from the raster-to-vector conversion of black and white line drawing. Special attention was paid to the borders of connected components of maps. These methods are implemented with compression and smoothing algorithms. Smoothing algorithms can enhance accuracy, so using both smoothing and compression algorithms in succession gives a more accurate result than using only a compression algorithm. The paper also shows that a map in vector format may require more memory than a map in raster format. The Appendix contains a detailed description of the new smoothing method (continuous local weighted averaging) suggested by the authors.

[1]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[2]  Jack Sklansky,et al.  Fast polygonal approximation of digitized curves , 1980, Pattern Recognit..

[3]  Morakot Pilouk,et al.  Using local deviations of vectorization to enhance the performance of raster-to-vector conversion systems , 2000, International Journal on Document Analysis and Recognition.

[4]  Lawrence O'Gorman Basic Techniques and Symbol-Level Recognition - An Overview , 1995, GREC.

[5]  Sergey Ablameyko,et al.  Machine interpretation of line drawing images - technical drawings, maps and diagrams , 2000 .

[6]  Serguei Levachkine,et al.  Integrated technique for automated digitization of Raster maps , 2000 .

[7]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Comput. Graph. Image Process..

[8]  E. R. White Assessment of Line-Generalization Algorithms Using Characteristic Points , 1985 .

[9]  A. J. Filipski,et al.  Automated conversion of engineering drawings to CAD form , 1992, Proc. IEEE.

[10]  Sergey Ablameyko,et al.  Machine Interpretation of Line Drawing Images , 2000 .

[11]  Francis K. H. Quek An algorithm for the rapid computation of boundaries of run-length encoded regions , 2000, Pattern Recognit..

[12]  Michael Brady,et al.  The Curvature Primal Sketch , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  S. W. E. Earles,et al.  Optimal polygonal approximation of digitized curves , 1994 .

[14]  Robert B McMaster,et al.  Automated Line Generalization , 1987 .

[15]  Vincenzo Eramo,et al.  An interpretation system for land register maps , 1992, Computer.

[16]  Eugene Bodansky,et al.  Closing Gaps of Discontinuous Lines: A New Criterion for Choosing the Best Prolongation , 2002, Document Analysis Systems.

[17]  Urs Ramer Extraction of line structures from photographs of curved objects , 1975 .