Skip to main content
Log in

The Interpretation of Line Drawings with Contrast Failure and Shadows

  • Published:
International Journal of Computer Vision Aims and scope Submit manuscript

Abstract

In line drawings derived from real images, lines may be missing due to contrast failure and objects with curved surfaces may cast shadows from multiple light sources.

This paper shows that it is the presence of shadows, rather than contrast failure, that renders the line drawing labelling problem NP-complete. However, shadows are a valuable visual cue, since their presence is formally shown to reduce the average ambiguity of drawings. This is especially true when constraints concerning shadow formation are employed to differentiate shadow and non-shadow lines.

The extended junction constraint, concerning straight lines colinear with junctions, compensates the loss of information caused by contrast failure. In fact, we observe the contrast failure paradox: a drawing is sometimes less ambiguous when lines are partly missing due to contrast failure.

It is known that the coplanarity of sets of object vertices can be deduced from the presence of straight lines in the drawing. This paper shows that these coplanarity constraints are robust to the presence of contrast failure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Clowes, M.B. 1971. On seeing things. Artificial Intelligence, 2:79-116.

    Google Scholar 

  • Cooper, M.C. 1993. Interpretation of line drawings of complex objects. Image and Vision Computing, 11(2):82-90.

    Google Scholar 

  • Cooper, M.C. 1997a. Interpreting line drawings of curved objects with tangential edges and surfaces. Image and Vision Computing, 15:263-276.

    Google Scholar 

  • Cooper, M.C. 1997b. Fundamental properties of neighbourhood substitution in constraint satisfaction problems. Artificial Intelligence 90:1-24.

    Google Scholar 

  • Cooper, M.C. 1999. Linear-time algorithms for testing the realisability of line drawings of curved objects. Artificial Intelligence, 108:31-67.

    Google Scholar 

  • Cooper, M.C. 2000. Linear constraints for the interpretation of line drawings of curved objects. Artificial Intelligence, 119:235-258.

    Google Scholar 

  • Cooper M.C. Not yet published. Reduction operations in fuzzy and valued constraint satisfaction, Fuzzy Sets and Systems.

  • Faugeras, O. 1993. Three-Dimensional Computer Vision. MIT Press: Cambridge, MA, USA.

    Google Scholar 

  • Freuder, E.C. 1991. Eliminating interchangeable values in constraint satisfaction problems. In Proceedings AAAI-91, Anaheim, CA, pp. 227-233.

  • Huffman, D.A. 1971. Impossible objects as nonsense sentences. In Machine Intelligence, Vol. 6, B. Meltzer and D. Mitchie (Eds.). Edinburgh University Press: UK, pp. 295-323.

    Google Scholar 

  • Kirousis, L.M. and Papadimitriou, C.H. 1988. The complexity of recognizing polyhedral scenes. Journal of Computer and System Sciences, 37(1):14-38.

    Google Scholar 

  • Lichtenstein, D. 1982. Planar formulae and their uses. SIAM J. Computing, 11:329-343.

    Google Scholar 

  • Malik, J. 1987. Interpreting line drawings of curved objects. International Journal of Computer Vision, 1:73-103.

    Google Scholar 

  • Malik, J. and Maydan, D. 1989. Recovering three-dimensional shape from a single image of curved objects. IEEE Trans. Pattern Analysis and Machine Intelligence, 11(6):555-566.

    Google Scholar 

  • Melhorn, K. 1974. Graph Algorithms and NP-Completeness, EACTS. Springer-Verlag: Berlin.

    Google Scholar 

  • Nalwa, V.S. 1988. Line drawing interpretation: A mathematical framework. International Journal of Computer Vision, 2(2):103-124.

    Google Scholar 

  • Parodi, P. and Torre, V. 1994. On the complexity of labeling perspective projections of polyhedral scenes. Artificial Intelligence, 70:239-276.

    Google Scholar 

  • Rubin, J.M. and Richards, W.A. 1982. Color vision and image intensities: When are changes material. Biological Cybernetics, 45:215-226.

    Google Scholar 

  • Shimshoni, I. and Ponce, J. 1997. Recovering the shape of polyhedra using line-drawing analysis and complex reflectance models. Computer Vision and Image Understanding, 65(2):296-310.

    Google Scholar 

  • Straforini, M., Coelha, C., and Campani, M. 1993. Extraction of vanishing points from images of indoor and outdoor scenes. Image and Vision Computing, 11(2):91-99.

    Google Scholar 

  • Sugihara, K. 1982. Mathematical structures of line drawings of polyhedrons–Towards man-machine communication by means of line drawings. IEEE Trans. Pattern Analysis and Machine Intelligence, 4(5):458-469.

    Google Scholar 

  • Sugihara, K. 1984. A necessary and sufficient condition for a picture to represent a polyhedral scene. IEEE Trans. Pattern Analysis and Machine Intelligence, 6(5):578-586.

    Google Scholar 

  • Sugihara, K. 1986. Machine Interpretation of Line Drawings. MIT Press: Cambridge, MA.

    Google Scholar 

  • Tai, A., Kittler, J., Petrou, M., and Windeatt, T. 1993.Vanishing point detection. Image and Vision Computing, 11(4):240-245.

    Google Scholar 

  • Tsang, E. 1993. Foundations of Constraint Satisfaction. Academic Press: San Diego.

    Google Scholar 

  • Waltz, D. 1975. Understanding line drawings of scenes with shadows. In Psychology of Computer Vision, P.H. Winston (Ed.). McGraw-Hill, New York, pp. 19-91.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cooper, M.C. The Interpretation of Line Drawings with Contrast Failure and Shadows. International Journal of Computer Vision 43, 75–97 (2001). https://doi.org/10.1023/A:1011166601983

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011166601983

Navigation