Evolutionary Search for Faces from Line Drawings

Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction of its 3D geometry. Two recently proposed methods for face identification from line drawings are based on two steps: finding a set of circuits that may be faces and searching for real faces from the set according to some criteria. The two steps, however, involve two combinatorial problems. The number of the circuits generated in the first step grows exponentially with the number of edges of a line drawing. These circuits are then used as the input to the second combinatorial search step. When dealing with objects having more faces, the combinatorial explosion prevents these methods from finding solutions within feasible time. This paper proposes a new method to tackle the face identification problem by a variable-length genetic algorithm with a novel heuristic and geometric constraints incorporated for local search. The hybrid GA solves the two combinatorial problems simultaneously. Experimental results show that our algorithm can find the faces of a line drawing having more than 30 faces much more efficiently. In addition, simulated annealing for solving the face identification problem is also implemented for comparison.

[1]  Hod Lipson,et al.  Optimization-based reconstruction of a 3D object from a single freehand line drawing , 1996, Comput. Aided Des..

[2]  Martin C. Cooper.  The Interpretation of Line Drawings with Contrast Failure and Shadows , 2001, International Journal of Computer Vision.

[3]  Warren N. Waggenspack,et al.  Decomposition method for extracting face topologies from wireframe models , 1992, Comput. Aided Des..

[4]  E. Reingold,et al.  Combinatorial Algorithms: Theory and Practice , 1977 .

[5]  Réi Lequette,et al.  Automatic construction of curvilinear solids from wireframe views , 1988 .

[6]  Jitendra Malik,et al.  Modeling and Rendering Architecture from Photographs: A hybrid geometry- and image-based approach , 1996, SIGGRAPH.

[7]  Martti Mäntylä,et al.  Introduction to Solid Modeling , 1988 .

[8]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[9]  Sergey Ablameyko,et al.  3D object reconstruction from engineering drawing projections , 1999 .

[10]  Alasdair Turner,et al.  Sketching space , 2000, Comput. Graph..

[11]  S. Sutherland.  Seeing things , 1989, Nature.

[12]  Mark A. Ganter,et al.  FROM WIRE-FRAME TO SOLID-GEOMETRIC , 1983 .

[13]  Ralph R. Martin,et al.  Skewed Mirror Symmetry in the 3D Reconstruction of Polyhedral Models , 2003, WSCG.

[14]  Xiaoou Tang,et al.  Efficient search of faces from complex line drawings , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[15]  Paul Debevec,et al.  Modeling and Rendering Architecture from Photographs , 1996, SIGGRAPH 1996.

[16]  Thomas Marill,et al.  Emulating the human interpretation of line-drawings as three-dimensional objects , 1991, International Journal of Computer Vision.

[17]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[18]  Gary Chartrand,et al.  Applied and algorithmic graph theory , 1992 .

[19]  Pat Hanrahan,et al.  Creating volume models from edge-vertex graphs , 1982, SIGGRAPH.

[20]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[21]  Martin A. Fischler,et al.  An optimization-based approach to the interpretation of single line drawings as 3D wire frames , 1992, International Journal of Computer Vision.

[22]  M. H. Kuo.  Reconstruction of quadric surface solids from three-view engineering drawings , 1998, Comput. Aided Des..

[23]  Jitendra Malik,et al.  Interpreting line drawings of curved objects , 1986, International Journal of Computer Vision.

[24]  R M Haralick,et al.  The consistent labeling problem: part I. , 1979, IEEE transactions on pattern analysis and machine intelligence.

[25]  Sam Kwong,et al.  Genetic Algorithms : Concepts and Designs , 1998 .

[26]  Ronald D. Dutton,et al.  Efficiently identifying the faces of a solid , 1983, Comput. Graph..

[27]  Xiaoou Tang,et al.  Efficient search of faces from complex line drawings , 2004, CVPR 2004.

[28]  Jianzhuang Liu,et al.  Identifying Faces in a 2D Line Drawing Representing a Manifold Object , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Kokichi Sugihara,et al.  A Necessary and Sufficient Condition for a Picture to Represent a Polyhedral Scene , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[30]  Hod Lipson,et al.  Identification of Faces in a 2D Line Drawing Projection of a Wireframe Object , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[31]  Martin C. Cooper.  Interpretation of line drawings of complex objects , 1993, Image Vis. Comput..

[32]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[33]  George Markowsky,et al.  Fleshing Out Wire Frames , 1980, IBM J. Res. Dev..

[34]  K. S. Tang,et al.  Genetic Algorithms: Concepts and Designs with Disk , 1999 .

[35]  Jianzhuang Liu,et al.  A Graph-Based Method for Face Identification from a Single 2D Line Drawing , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[36]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .