Recognition of Hand-Drawn Graphs Using Digital-Geometric Techniques

A novel algorithm to recognize hand-drawn graphs is proposed. The algorithm uses properties of digital-geometric straightness combined with a new idea of Farey sequence, followed by geometric refinement, in order to speed up the recognition of graph edges. In the next phase, the nodes of the graph — which, being hand-drawn, are very grossly circular — are recognized using the annular regions containing the vertices of their corresponding isothetic covers. Results of the two phases are finally compiled using interval search to output the adjacency list of the graph. The problems of jaggedness, waviness, and similar unforeseen aberrations usually present in a hand-drawn graph are well-tackled by the adopted techniques, as verified by our experimentation on various hand-drawn graphs. Some results have been given in this paper to show the usability and efficiency of the proposed algorithm.

[1]  Sanjoy Pratihar,et al.  A Thinning-free Algorithm for Straight Edge Detection in a Gray-scale Image , 2009, 2009 Seventh International Conference on Advances in Pattern Recognition.

[2]  Azriel Rosenfeld,et al.  Digital straightness - a review , 2004, Discret. Appl. Math..

[3]  S. H. Joseph.  Processing of engineering line drawings for automatic input to CAD , 1989, Pattern Recognit..

[4]  Rafael C. González,et al.  Local Determination of a Moving Contrast Edge , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Manfred R. Schroeder,et al.  Fractions: Continued, Egyptian and Farey , 2009 .

[6]  Craig A. Knoblock,et al.  Extracting Road Vector Data from Raster Maps , 2009, GREC.

[7]  Theo Pavlidis,et al.  A vectorizer and feature extractor for document recognition , 1986 .

[8]  Ji Zhou,et al.  Vectorization of line drawings via contour matching , 1995, Other Conferences.

[9]  Craig A. Knoblock,et al.  An Approach to Automatic Road Vectorization of Raster Maps , 2009 .

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

[11]  Partha Bhowmick,et al.  TIPS: On Finding a Tight Isothetic Polygonal Shape Covering a 2D Object , 2005, SCIA.

[12]  Amit Kumar Das,et al.  Adjacency matrix generation from the image of graphs: a morphological approach , 1997, Machine Vision and Applications.

[13]  Sharlee Climer,et al.  Local Lines: A linear time line detector , 2003, Pattern Recognit. Lett..