Skip to main content
SpringerLink
Log in

Reconciling Distance Functions and Level Sets

  • Conference paper
  • First Online:
Scale-Space Theories in Computer Vision (Scale-Space 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1682))

Included in the following conference series:

Abstract

This paper is concerned with the simulation of the Par- tial Differential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natu- ral choice for the implicit representation is the signed distance function to the closed surface. Osher and Sethian propose to evolve the distance function with a Hamilton-Jacobi equation. Unfortunately the solution to this equation is not a distance function. As a consequence, the practi- cal application of the level set method is plagued with such questions as when do we have to “reinitialize” the distance function? How do we “reinitialize” the distance function? Etc... which reveal a disagreement between the theory and its implementation. This paper proposes an al- ternative to the use of Hamilton-Jacobi equations which eliminates this contradiction: in our method the implicit representation always remains a distance function by construction, and the implementation does not differ from the theory anymore. This is achieved through the introduc- tion of a new equation. Besides its theoretical advantages, the proposed method also has several practical advantages which we demonstrate in two applications: (i) the segmentation of the human cortex surfaces from MRI images using two coupled surfaces [26], (ii) the construction of a hierarchy of Euclidean skeletons of a 3D surface.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. D. Adalsteinsson and J. A. Sethian. A Fast Level Set Method for Propagating Interfaces. Journal of Computational Physics, 118(2):269–277, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Adalsteinsson and J. A. Sethian. The fast construction of extension velocities in level set methods. Journal of Computational Physics, 1(148):2–22, 1999.

    Article  MathSciNet  Google Scholar 

  3. L. Ambrosio and C. Mantegazza. Curvature and distance function from a manifold. J. Geom. Anal., 1996. To appear.

    Google Scholar 

  4. V. I. Arnold. Geometrical Methods in the Theory of Ordinary Differential Equations. Springer-Verlag New York Inc., 1983.

    MATH  Google Scholar 

  5. G. Barles, H.M. Soner, and P.E. Souganidis. Front propagation and phase field theory. SIAM J. Control and Optimization, 31(2):439–469, March 1993.

    Article  MATH  MathSciNet  Google Scholar 

  6. Harry Blum and Roger N. Nagel. Shape description using weighted symmetric axis features. Pattern Recog., 10:167–180, 1978.

    Article  MATH  Google Scholar 

  7. V. Caselles, R. Kimmel, and G. Sapiro. Geodesic active contours. In Proceedings of the 5th International Conference on Computer Vision, pages 694–699, Boston, MA, June 1995. IEEE Computer Society Press.

    Google Scholar 

  8. V. Caselles, R. Kimmel, and G. Sapiro. Geodesic active contours. The International Journal of Computer Vision, 22(1):61–79, 1997.

    Article  MATH  Google Scholar 

  9. Y.G. Chen, Y. Giga, and S. Goto. Uniqueness and existence of viscosity solutions of generalized mean curvature flow equations. J. Differential Geometry, 33:749–786, 1991.

    MATH  MathSciNet  Google Scholar 

  10. David L. Chopp. Computing minimal surfaces via level set curvature flow. Journal of Computational Physics, 106:77–91, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  11. Frederic Devernay. Vision stéréoscopique et propriétés differentielles des surfaces. PhD thesis, École Polytechnique, February 97.

    Google Scholar 

  12. O. Faugeras and R. Keriven. Level set methods and the stereo problem. In Bartter Haar Romeny, Luc Florack, Jan Koenderink, and Max Viergever, editors, Proc. of First International Conference on Scale-Space Theory in Computer Vision, volume 1252 of Lecture Notes in Computer Science, pages 272–283. Springer, 1997.

    Google Scholar 

  13. M. Gage and R.S. Hamilton. The heat equation shrinking convex plane curves. J. of Differential Geometry, 23:69–96, 1986.

    MATH  MathSciNet  Google Scholar 

  14. M. Grayson. The heat equation shrinks embedded plane curves to round points. J. of Differential Geometry, 26:285–314, 1987.

    MATH  MathSciNet  Google Scholar 

  15. M. Kass, A. Witkin, and D. Terzopoulos. SNAKES: Active contour models. The International Journal of Computer Vision, 1:321–332, January 1988.

    Article  Google Scholar 

  16. S. Kichenassamy, A. Kumar, P. Olver, A. Tannenbaum, and A. Yezzi. Gradient flows and geometric active contour models. In Proceedings of the 5th International Conference on Computer Vision, Boston, MA, June 1995. IEEE Computer Society Press.

    Google Scholar 

  17. B. Kimia, A. R. Tannenbaum, and S. W. Zucker. Shapes, schoks and deformations i: The components of two-dimensional shape and the reaction-diffusion space. ijcv, 15:189–224, 1995.

    Article  Google Scholar 

  18. G. Malandain and S. Fernandez-Vidal. Euclidean skeletons. Image and Vision Computing, 16:317–327, 1998.

    Article  Google Scholar 

  19. R. Malladi, J. A. Sethian, and B.C. Vemuri. Evolutionary fronts for topology-independent shape modeling and recovery. In J-O. Eklundh, editor, Proceedings of the 3rd European Conference on Computer Vision, volume 800 of Lecture Notes in Computer Science, Stockholm, Sweden, May 1994. Springer-Verlag.

    Google Scholar 

  20. R. Malladi, J. A. Sethian, and B.C. Vemuri. Shape modeling with front propagation: A level set approach. PAMI, 17(2):158–175, February 1995.

    Google Scholar 

  21. S. Osher and J. Sethian. Fronts propagating with curvature dependent speed: algorithms based on the Hamilton-Jacobi formulation. Journal of Computational Physics, 79:12–49, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  22. Jean Serra. Image Analysis and Mathematical Morphology. Academic Press, London, 1982.

    MATH  Google Scholar 

  23. J. A. Sethian. Level Set Methods. Cambridge University Press, 1996.

    Google Scholar 

  24. J.A. Sethian and J. Strain. Crystal growth and dendritic solidification. Journal of Computational Physics, 98:231–253, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  25. C. W. Shu and S. Osher. Effcient implementation of essentially non-oscillatory shock-capturing schemes, ii. Journal of Computational Physics, 83:32–78, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  26. X. Zeng, L. H. Staib, R. T. Schultz, and J. S. Duncan. Volumetric layer segmentation using coupled surfaces propagation. In Proceedings of the International Conference on Computer Vision and Pattern Recognition, Santa Barbara, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. I.N.R.I.A, BP. 93, 2004 Route des Lucioles, 06902 Sophia Antipolis Cedex, France

    José Gomes & Olivier Faugeras

Authors
  1. José Gomes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olivier Faugeras
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The IT University in Copenhagen, Glentevej 67, DK-2400, Copenhagen NV, Denmark

    Mads Nielsen

  2. Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen OE, Denmark

    Peter Johansen  & Ole Fogh Olsen  & 

  3. Department of Mathematics and Computer Science, University of Mannheim, D-68131, Mannheim, Germany

    Joachim Weickert

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gomes, J., Faugeras, O. (1999). Reconciling Distance Functions and Level Sets. In: Nielsen, M., Johansen, P., Olsen, O.F., Weickert, J. (eds) Scale-Space Theories in Computer Vision. Scale-Space 1999. Lecture Notes in Computer Science, vol 1682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48236-9_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48236-9_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66498-7

  • Online ISBN: 978-3-540-48236-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation