This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Overcoming Superstrictness in Line Drawing Interpretation
April 2002 (vol. 24 no. 4)
pp. 456-466

This paper presents a new algorithm for correcting incorrect line drawings—incorrect projections of a polyhedral scene. Such incorrect drawings arise, e.g., when an image of a polyhedral world is taken, the edges and vertices are extracted, and a drawing is synthesized. Along the way, the true positions of the vertices in the 2D projection are perturbed due to digitization errors and the preprocessing. As most available algorithms for interpreting line drawings are “superstrict,” they judge these noisy inputs as incorrect and fail to reconstruct a three-dimensional scene from them. The presented method overcomes this problem by moving the positions of all vertices until a very close correct drawing is found. The closeness criterion is to minimize the sum of squared distances from each vertex in the input drawing to its corrected position. With this tool, any superstrict method for line drawing interpretation is now practical, as it can be applied to the corrected version of the input drawing.

[1] L. Ros and F. Thomas, “Correcting Polyhedral Projections for Scene Reconstruction,” Proc. IEEE Int'l Conf. Robotics and Automation, vol. II, pp. 2126-2133, May 2001.
[2] A.K. Mackworth, “Interpreting Pictures of Polyhedral Scenes,” Artificial Intelligence, vol. 4, pp. 121-137, 1973.
[3] K. Sugihara, “Mathematical Structures of Line Drawings of polyhedrons—Towards Man-Machine Communication by Means of Line Drawings,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 4, pp. 458-469, 1982.
[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, pp. 578-586, 1984.
[5] K. Sugihara, Machine Interpretation of Line Drawings. The MIT Press, 1986.
[6] W. Whiteley, “Weavings, Sections and Projections of Spherical Polyhedra,” Discrete Applied Math., vol. 32, pp. 275-294, 1991.
[7] L. Ros, “A Kinematic-Geometric Approach to Spatial Interpretation of Line Drawings,” PhD thesis, Polytechnic Univ. of Catalonia, May 2000, Available athttp://www.iri.upc.es/peopleros.
[8] L. Ros and F. Thomas, “Analysing Spatial Realizability of Line Drawings through Edge-Concurrence Tests,” Proc. IEEE Int'l Conf. Robotics and Automation, vol. IV, pp. 3559-3566, May 1998.
[9] L.S. Penrose and R. Penrose, “Impossible Objects: A Special Type of Visual Illusion,” British J. of Psychology, vol. 49, pp. 31-33, 1958.
[10] S.W. Draper, “The Penrose Triangle and a Family of Related Figures,” Perception, vol. 7, pp. 283-296, 1978.
[11] D.A. Huffman, “Impossible Objects as Nonsense Sentences,” Machine Intelligence, vol. 6, pp. 295-323, 1971.
[12] B. Ernst, Adventures with Impossible Figures. Parkwest Publications, May 1987.
[13] L.M. Kirousis and C.H. Papadimitriou, "The complexity of recognizing polyhedral scenes," J. Computer and System Sciences, vol. 37, pp. 14-38, 1988.
[14] D. Waltz, “Understanding Line Drawings of Scenes with Shadows,” The Psychology of Computer Vision, P.H. Winston, ed., pp. 19-91, McGraw Hill, 1975.
[15] E.R. Hancock and J. Kittler, "Edge-Labeling Using Dictionary-Based Relaxation," IEEE Trans Pattern Analysis and Machine Intelligence, vol. 12, no. 2, pp. 165-181, 1990.
[16] R. Myers and E.R. Hancock, “Genetic Algorithms for Ambiguous Labelling Problems,” Pattern Recognition, vol. 33, pp. 685-704, 2000.
[17] P. Parodi and V. Torre, "On the complexity of labeling line drawings of polyhedral scenes," Artificial Intelligence, vol. 70, pp. 239-276, 1994.
[18] P. Parodi, R. Lancewicki, A. Vijh, and J.K. Tsotsos, “Empirically-Derived Estimates of the Complexity of Labelling Line Drawings of Polyhedral Scenes,” Artificial Intelligence, vol. 105, no. 1-2, pp. 47-75, 1998.
[19] D.A. Huffman, “Realizable Configurations of Lines in Pictures of Polyhedra,” Machine Intelligence, vol. 8, 1977.
[20] J.C. Maxwell, “On Reciprocal Figures and Diagrams of Forces,” Philosophical Magazine, series 4, vol. 27, pp. 250-261, 1864.
[21] J. Ponce and I. Shimshoni, “An Algebraic Approach to Line-Drawing Analysis in the Presence of Uncertainty,” Proc. IEEE Int'l Conf. Robotics and Automation, pp. 1786-1791, May 1992.
[22] I. Shimshoni, “Interpreting Images of Polyhedral Objects in the Presence of Uncertainty,” PhD thesis, Univ. of Illinois at Urbana-Champaign, 1995.
[23] W. Whiteley, “Some Matroids on Hypergraphs with Applications to Scene Analysis and Geometry,” Discrete and Computational Geometry, vol. 4, pp. 75-95, 1988.
[24] W. Whiteley, “From a Line Drawing to a Polyhedron,” J. Math. Psychology, vol. 31, pp. 441-448, 1987.
[25] W. Whiteley, “How to Design or Describe a Polyhedron,” J. Intelligent and Robotic Systems, vol. 11, pp. 135-160, 1994.
[26] H. Crapo and W. Whiteley, “Plane Self Stresses and Projected Polyhedra I: The Basic Pattern,” Structural Topology, vol. 20, pp. 55-78, 1993.
[27] T. Schlik and A. Fogelson, “TNPACK-A Truncated Newton Minimization Package for Large-Scale Problems: I. Algorithm and Usage,” ACM Trans. Math. Software, vol. 18, no. 1, pp. 46-70, Mar. 1992.
[28] K. Sugihara, “Resolvable Representation of Polyhedra,” Discrete and Computational Geometry, vol. 21, no. 2, pp. 243-255, 1999.
[29] E. Hansen, “Pure and Applied Mathematics,” Global Optimization Using Interval Analysis. New York: Marcel Decker, Inc., 1992.
[30] C. Bombín, L. Ros, and F. Thomas, “A Concise Bézier Clipping Technique for Solving Inverse Kinematics Problems,” Advances in Robot Kinematics, J. Lenarcic and M.M. Stanisic, eds., pp. 53-60, Kluwer Academic, 2000.

Index Terms:
line drawing interpretation, superstrictness, scene understanding, correction algorithms
Citation:
L. Ros, F. Thomas, "Overcoming Superstrictness in Line Drawing Interpretation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 456-466, April 2002, doi:10.1109/34.993554
Usage of this product signifies your acceptance of the Terms of Use.