Skip to main content

A scheme for the shape-from-shading model with “black shadows”

  • Conference paper
Numerical Mathematics and Advanced Applications

Summary

We propose an approximation scheme for the shape-from-shading (SFS) model which can handle “black shadows” in the image. The approach is global and does not require additional boundary conditions on the interfaces between light and black shadow areas. We analyze properties of the fully discrete scheme and show that the algorithm converges, under appropriate assumptions, to a unique solution by a fixed-point iteration. We present and discuss numerical tests.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bardi, M., Capuzzo-Dolcetta, I. (1997): Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations. Birkhäuser Boston, Boston, MA

    Book  MATH  Google Scholar 

  2. Camilli, E, Falcone, M. (1996): An approximation scheme for the maximal solution of the shape-from-shading model. In: International conference on image processing, 1996. Proceedings. Vol. I. IEEE, Piscataway, NJ, pp. 49–52

    Google Scholar 

  3. Camilli, F, Grüne, L. (2000): Numerical approximation of the maximal solutions for a class of degenerate Hamilton-Jacobi equations. SIAM J. Numer. Anal. 38, 1540–1560

    Article  MathSciNet  MATH  Google Scholar 

  4. Camilli, R, Siconolfi, A. (1999): Maximal subsolutions for a class of degenerate Hamilton-Jacobi problems. Indiana Univ. Math. J. 48, 1111–1131

    Article  MathSciNet  MATH  Google Scholar 

  5. Daniel, P (2000): Pent-on extraire le relief d'une seul image? Thèse de doctorat. Université Paul Sabatier, Toulouse

    Google Scholar 

  6. Descombes, X., Durou, J.-D., Petit, D. (2001): Recuit simulé pour le “shape-from-shading”. In: Actes du 18e Colloque GRETSI'01. Vols. 1,2. [CNES] Toulouse, pp. 513–516

    Google Scholar 

  7. Durou, J.-D., Falcone, M., Sagona, M.: A survey on numerical methods for shape-from-shading, in preparation

    Google Scholar 

  8. Falcone, M. (1994): The minimum time problem and its applications to front propagation. In: Visintin, A., Buttazzo, G. (eds.): Motion by mean curvature and related topics. De Gruyter, Berhn, pp. 70–88

    Google Scholar 

  9. Falcone, M. (1997): Numerical solution of dynamic programming equations. In [1], pp. 472–504

    Google Scholar 

  10. Falcone, M., Sagona, M. (1997): An algorithm for the global solution of the shape-from-shading model. In: del Bimbo, A. (ed.): Image analysis and processing. (Lecture Notes in Computer Sciences, vol. 1310). Springer, Berlin, pp. 596–603

    Chapter  Google Scholar 

  11. Falcone, M., Makridakis, Ch. (eds.) (2001): Numerical methods for viscosity solutions and applications. World Scientific, Singapore

    MATH  Google Scholar 

  12. Horn, B.K.P., Brooks, M.J. (1986): The variational approach to shape-from-shading. Comput. Vision, Graphics Image Process. 33, 174–208

    Article  MATH  Google Scholar 

  13. Horn, B.K.R, Brooks, M.J. (eds.) (1989): Shape-from-shading. MIT Press, Cambridge, MA

    Google Scholar 

  14. Ishii, H., Ramaswamy, M. (1995): Uniqueness results for a class of Hamilton-Jacobi equations with singular coefficients. Comm. Partial Differential Equations 20, 2187–2213

    Article  MathSciNet  MATH  Google Scholar 

  15. Kimmel, R., Bruckstein, A.M. (1993): Global shape-from-shading. Center for Intelligent System Report CIS #9327, Technion — Israel Inst, of Tech., Israel

    Google Scholar 

  16. Lions, P.-L. (1982): Generalized solutions of Hamilton-Jacobi equations. Pitman, London

    MATH  Google Scholar 

  17. Lions, P.-L., Rouy, E., Tourin, A. (1993): Shape-from-shading, viscosity solutions and edges. Numer. Math. 64, 323–353

    Article  MathSciNet  MATH  Google Scholar 

  18. Rouy, E., Tourin, A. (1992): A viscosity solutions approach to shape-from-shading. SIAM J. Numer. Anal. 29, 867–884

    Article  MathSciNet  MATH  Google Scholar 

  19. Oliensis, J., Dupuis, P. (1993): A global algorithm for shape-from-shading. In: Fourth international conference on computer vision. Proceedings. IEEE, Piscataway, NJ, pp. 692–701

    Google Scholar 

  20. Sagona, M. (2001): Numerical methods for degenerate Eikonal type equations and applications. Tesi di Dottorato. Universitá di Napoli “Federico II”, Naples

    Google Scholar 

  21. Sagona, M., Seghini, A. (2001): An adaptive scheme on unstructured grids for the shape-from-shading problem. In [11], pp. 197–219

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Italia

About this paper

Cite this paper

Falcone, M., Sagona, M., Seghini, A. (2003). A scheme for the shape-from-shading model with “black shadows”. In: Brezzi, F., Buffa, A., Corsaro, S., Murli, A. (eds) Numerical Mathematics and Advanced Applications. Springer, Milano. https://doi.org/10.1007/978-88-470-2089-4_47

Download citation

  • DOI: https://doi.org/10.1007/978-88-470-2089-4_47

  • Publisher Name: Springer, Milano

  • Print ISBN: 978-88-470-2167-9

  • Online ISBN: 978-88-470-2089-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics