Recognition of digital curves scanned from paper drawings using genetic algorithms

After analyzing the existing methods, based on holo-extraction method of information, this paper develops a recognition method of digital curves scanned from paper drawings for subsequent pattern recognition and 3D reconstruction. This method is first to construct the networks of single closed region (SCRs) of black pixels with all the information about both segments and their linking points, to classify all the digital contours represented by SCRs into three types: straight-line segments, circular arcs, and combined lines, and then to decompose the combined lines into least basic sub-lines or segments (straight-line segments or circular arcs) with least fitting errors using genetic algorithms with adaptive probabilities of crossover and mutation and to determine their relationships (intersecting or being tangential to each other). It is verified that the recognition method based on the networks of SCRs and the genetic algorithm is feasible and efficient. This method and its software prototype can be used as a base for further work on subsequent engineering drawing understanding and 3D reconstruction.

[1]  Roland T. Chin,et al.  Scale-Based Detection of Corners of Planar Curves , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

[3]  Geoff A. W. West,et al.  Nonparametric Segmentation of Curves into Various Representations , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Dov Dori,et al.  From engineering drawings to 3D models: are we ready now? , 1995, Comput. Aided Des..

[5]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[6]  A. H. Etemadi Robust segmentation of edge data , 1992 .

[7]  Weinan Chen,et al.  Corner Detection and Interpretation on Planar Curves Using Fuzzy Reasoning , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Hong Yan,et al.  A curve bend function based method to characterize contour shapes , 1997, Pattern Recognit..

[9]  Farzin Mokhtarian,et al.  A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

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

[11]  Yung-Nien Sun,et al.  Polygonal approximation using genetic algorithms , 1999, Pattern Recognit..

[12]  B. Rosenberg The analysis of convex blobs , 1972, Comput. Graph. Image Process..

[13]  Yiu-Tong Chan,et al.  A simple approach for the estimation of circular arc center and its radius , 1989, Comput. Vis. Graph. Image Process..

[14]  Azriel Rosenfeld,et al.  Angle Detection on Digital Curves , 1973, IEEE Transactions on Computers.

[15]  Naonori Ueda,et al.  Learning Visual Models from Shape Contours Using Multiscale Convex/Concave Structure Matching , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

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

[17]  P. Yin A new method for polygonal approximation using genetic algorithms , 1998, Pattern Recognit. Lett..

[18]  B. Rosenberg,et al.  Computing Dominant Points on Simple Shapes , 1974, Int. J. Man Mach. Stud..

[19]  Jose A. Ventura,et al.  Segmentation of Planar Curves into Straight-Line Segments and Elliptical Arcs , 1997, CVGIP Graph. Model. Image Process..

[20]  Xi-Wen Zhang,et al.  Holo-extraction of information from paper drawings for 3D reconstruction , 2002, Comput. Aided Des..

[21]  Joyce Snell,et al.  6. Alternative Methods of Regression , 1996 .

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