This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Evolutionary Search for Faces from Line Drawings
June 2005 (vol. 27 no. 6)
pp. 861-872
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] T. Marill, “Emulating the Human Interpretation of Line-Drawings as Three-Dimensional Objects,” Int'l J. Computer Vision, vol. 6, no. 2, pp. 147-161, 1991.
[2] Y.G. Leclerc and M.A. Fischler, “An Optimization-Based Approach to the Interpretation of Single Line Drawings as 3D Wire Frames,” Int'l J. Computer Vision, vol. 9, no. 2, pp. 113-136, 1992.
[3] H. Lipson and M. Shpitalni, “Optimization-Based Reconstruction of a 3D Object from a Single Freehand Line Drawing,” Computer-Aided Design, vol. 28, no. 8, pp. 651-663, 1996.
[4] K. Sugihara, “A Necessary and Sufficient Condition for a Picture to Represent a Polyhedral Scene,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 5, pp. 578-586, 1984.
[5] P.E. Debevec, C.J. Yaylor, and J. Malik, “Modeling and Rendering Architecture from Photographs: A Hybrid Geometry- and Image-Based Approach,” Proc. SIGGRAPH '96 Conf., pp. 11-20, 1996.
[6] A. Turner, D. Chapman, and A. Penn, “Sketching Space,” Computers & Graphics, vol. 24, pp. 869-879, 2000.
[7] A.P. Vicent, P.C. Calleja, and R.R. Martin, “Skewed Mirror Symmetry in the 3D Reconstruction of Polyhedral Models,” J. Winter School on Computer Graphics, vol. 11, no. 3, pp. 504-511, 2003.
[8] M. Shpitalni and H. Lipson, “Identification of Faces in a 2D Line Drawing Projection of a Wireframe Object,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 10, pp. 1000-1012, Oct. 1996.
[9] J. Liu and Y.T. Lee, “A Graph-Based Method for Face Identification from a Single 2D Line Drawing,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1106-1119, Oct. 2001.
[10] E.M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms: Theory and Practices. Prentice-Hall, 1977.
[11] M. Gen and R. Cheng, Genetic Algorithms and Engineering Optimization. New York: John Wiley & Sons, 2000.
[12] K.F. Man, K.S. Tang, and S. Kwong, Genetic Algorithms: Concepts and Designs. New York: Springer, 1999.
[13] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. New York: Springer-Verlag, 1996.
[14] D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, Mass.: Addison-Wesley, 1989.
[15] G. Chartrand and O.R. Oellermann, Applied and Algorithmic Graph Theory. New York: McGraw-Hill, 1993.
[16] M. Mantyla, An Introduction to Solid Modeling. Computer Science Press, 1988.
[17] D.A. Huffman, “Impossible Objects as Nonsense Sentences,” Machine Intelligence, B. Meltzer and D. Mitchie, eds., vol. 6, pp. 295-323, 1971.
[18] M.B. Clowes, “On Seeing Things,” Artificial Intelligence, vol. 2, pp. 79-116, 1971.
[19] D. Waltz, “Understanding Line Drawings of Scenes with Shadows,” Psychology of Computer Vision, P.H. Winston, ed., pp. 19-91, New York: McGraw-Hill, 1975.
[20] R. Haralick and L. Shapira, “The Consistent Labeling Problem: Part 1,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, no. 2, pp. 173-184, 1979.
[21] J. Malik, “Interpreting Line Drawings of Curved Objects,” Int'l J. Computer Vision, vol. 1, pp. 73-103, 1987.
[22] M.C. Cooper, “Interpretation of Line Drawings of Complex Objects,” Image and Vision Computing, vol. 11, no. 2, pp. 82-90, 1993.
[23] M.C. Cooper, “The Interpretations of Line Drawings with Contrast Failure and Shadows,” Int'l J. Computer Vision, vol. 43, no. 2, pp. 75-97, 2001.
[24] R. Lequette, “Automatic Construction of Curvilinear Solid from Wireframe Views,” Computer-Aided Design, vol. 20, no. 4, pp. 171-180, 1988.
[25] S. Ablameyko, V. Bereishik, A. Gorelik, and S. Medvedev, “3D Object Reconstruction from Engineering Drawing Projections,” Computing & Control Eng. J., vol. 10, no. 6, pp. 277-284, 1999.
[26] M.H. Kuo, “Reconstruction of Quadric Surface Solid from Three-View Engineering Drawings,” Computer-Aided Design, vol. 30, no. 7, pp. 517-527, 1998.
[27] G. Markowsky and M.A. Wesley, “Fleshing Out Wire-Frames,” IBM J. Research and Development, vol. 24, no. 5, pp. 582-597, 1980.
[28] P.M. Hanrahan, “Creating Volume Models from Edge-Vertex Graphs,” Computer Graphics, vol. 16, no. 3, pp. 77-84, 1982.
[29] R.D. Dutton and R.C. Brigham, “Efficiently Identifying the Faces of a Solid,” Computer and Graphics in Mechanical Eng., vol. 7, no. 2, pp. 143-147, 1983.
[30] M.A. Ganter and J.J. Uicker, “From Wire-Frame to Solid Geometric: Automated Conversion of Data Representations,” Computer in Mechanical Eng., vol. 2, no. 2, pp. 40-45, 1983.
[31] J.S. Hojnicki and P.R. White, “Converting CAD Wireframe Data to Surfaced Representations,” Computers in Mechanical Eng., pp. 19-25, Mar./Apr. 1988.
[32] S.C. Agarwal and J.W.N. Waggenspack, “Decomposition Method for Extracting Face Topologies from Wireframe Models,” Computer-Aided Design, vol 24, no. 3, pp. 123-140, 1992.
[33] J. Liu, Y.T. Lee, and W.-K. Cham, “Identifying Faces in a 2D Line Drawing Representing a Manifold Object,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 12, pp. 1579-1593, Dec. 2002.
[34] J. Liu, “Efficient Search of Faces from Complex Line Drawings,” technical report, the Multimedia Lab, Dept. of IE, the Chinese Univ. of Hong Kong, 2003.
[35] K.A. Dowsland, “Simulated Annealing,” Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves, ed. pp. 20-69, Halsted Press, 1993.

Index Terms:
Three-dimensional object reconstruction, face identification, genetic algorithms, line drawing, minimal edge face phenomenon, simulated annealing.
Citation:
Jianzhuang Liu, Xiaoou Tang, "Evolutionary Search for Faces from Line Drawings," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 6, pp. 861-872, June 2005, doi:10.1109/TPAMI.2005.119
Usage of this product signifies your acceptance of the Terms of Use.