This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
3D Shape Reconstruction by Using Vanishing Points
February 1996 (vol. 18 no. 2)
pp. 211-217

Abstract—This paper investigates the quantitative reconstruction of the 3D structure of a scene from a line drawing, by using the geometrical constraints provided by the location of vanishing points. The additional information on vanishing points allows the design of an algorithm which has several advantages with respect to the usual approach based on a reduction to Linear Programming (Sugihara, 1982). These advantages range from a lower computational complexity to error tolerance and exact reconstruction of the 3D-geometry of the objects. These features make the algorithm a useful tool for the quantitative analysis of real-world images, which is useful for several tasks from scene understanding to automatic vehicle guidance.

[1] D.A. Huffman, "Impossible objects as nonsense sentences," Machine Intelligence, vol. 6, pp. 295-323, 1971.
[2] M.B. Clowes, "On seeing things," Artificial Intelligence, vol. 2, pp. 79-116, 1971.
[3] D. Waltz, "Understanding line-drawings of scenes with shadows," Artificial Intelligence, vol. 2, pp. 79-116, 1971.
[4] K. Sugihara, "A necessary and sufficient condition for a picture to represent a polyhedral scene," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 5, pp. 578-586, 1984.
[5] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: Addison-Wesley, 1992.
[6] R.M. Karp and V. Ramachandran, "Parallel Algorithms for Shared-Memory Machines," Handbook of Theoretical Computer Science, J. van Leeuwen, ed., vol. A, pp. 869-941.Amsterdam: NorthHolland, 1990.
[7] L.M. Kirousis and C.H. Papadimitriou, "The complexity of recognizing polyhedral scenes," J. Computer and System Sciences, vol. 37, pp. 14-38, 1988.
[8] M. Straforini et al., “The Recovery and Understanding of a Line Drawing from Indoor Scenes,” IEEE Trans. Pattern Analysis and Machnine Intelligence, vol. 14, pp. 298-303, Feb. 1992.
[9] B. Brillault and B. O'Mahony, New Method for Vanishing Point Detection Computer Vision, Graphics and Image Processing: Image Understanding, vol. 54, no. 2, pp. 289-300, 1991.
[10] H. Nakatani and T. Kitahashi, "Determination of vanishing point in outdoor scene," Trans. IEICE, vol. 64, no. 5, pp. 357-358, 1981.
[11] S.T. Barnard, "Interpreting prospective images," Artificial Intelligence J., vol. 21, no. 4, pp. 435-462, 1983.
[12] L. Quan and R. Mohr, "Determining perspective structures using hierarchical Hough transformation," Pattern Recognition Letters, vol. 9, pp. 279-286, 1989.
[13] M.J. Magee and J.K. Aggarwal, "Determining vanishing points form perspective images," Computer Vision, Graphics, and Image Processing, vol. 26, pp. 256-267, 1984.
[14] P. Parodi and V. Torre, "On the complexity of labeling line drawings of polyhedral scenes," Artificial Intelligence, vol. 70, pp. 239-276, 1994.
[15] T. Kanade, "A theory of origami world," Artificial Intelligence, vol. 13, pp. 279-311, 1980.
[16] J. Malik, "Interpreting line drawings of curved objects," Int'l J. Computer Vision, vol. 1, pp. 73-103, 1987.
[17] A.K. Mackworth, "Interpreting pictures of polyhedral scenes," Artificial Intelligence, vol. 4, pp. 121-137, 1984.
[18] J. Canny, “A Computational Approach to Edge Detection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 6, pp. 679-698, June 1986.
[19] T. Pavlidis, Algorithms for Graphics and Image Processing, pp. 199-201 Rockville, Md.: Computer Science Press, 1982.
[20] M. Straforini, C. Coelho, and M. Campani, "Extraction of vanishing points of images of indoor and outdoor scenes," Image Vision Computing, vol. 11, no. 2, pp. 91-100, 1993.
[21] M. Gatti, P. Olivieri, M. Straforini, and V. Torre, "Robust recovery of the 3D structure of indoor scenes," Second Int'l Workshop on Robust Computer Vision, pp. 401-412,Bonn, Germany, 1992.
[22] B. Caprile and V. Torre, “Using Vanishing Points for Camera Calibration,” Int'l J. Computer Vision, vol. 4, no. 2, pp. 127-140, Mar. 1990.
[23] K. Kadono, M. Asada, and Y. Shirai, "Context-constrained matching of hierarchical cad-based models for outdoor scene interpretation," Proc. IEEE Workshop on Directions in Automated CAD-Based Vision, pp. 186-195,Hawaii, 1991.
[24] M. Campani, M. Cappello, G. Piccioli, E. Reggio, M. Straforini, and V. Torre, "Visual routines for outdoor navigation," Proc. Intelligent Vehicles Symp., pp. 107-112,Tokyo, 1993.
[25] P. Parodi, "Labeling perspective projections of origami scenes," Asian Conf. Computer Vision, ACCV '93, pp. 446-449,Osaka, Japan, 1993.
[26] P. Parodi, "The complexity of understanding of origami scenes," Int'l J. Computer Vision, in press.
[27] T. Kanade, "From a real chair to a negative chair," Artificial Intelligence, vol. 59, no. 1-2, pp. 95-101, 1993.
[28] D. Dobkin, R.J. Lipton, and S. Reiss, "Linear programming is log-space hard for p. Inf. Process. Lett., vol. 9, pp. 96-97, 1979.
[29] N. Dendris and P. Parodi, "Parallel algorithms for the interpretation of line drawings," 1994. Unpublished.

Index Terms:
Reconstruction of 3D shape, vanishing point, line drawing, incidence structure, spatial structure, labeling, realizability.
Citation:
Pietro Parodi, Giulia Piccioli, "3D Shape Reconstruction by Using Vanishing Points," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 2, pp. 211-217, Feb. 1996, doi:10.1109/34.481545
Usage of this product signifies your acceptance of the Terms of Use.