Applied Mathematics and Mechanics

, Volume 24, Issue 8, pp 950–960 | Cite as

Level set methods based on distance function

  • Wang De-jun
  • Tang Yun
  • Yu Hong-chuan
  • Tang Ze-sheng
Article
  • 38 Downloads

Abstract

Some basic problems on the level set methods were discussed, such as the method used to preserve the distance function, the existence and uniqueness of solution for the level set equations. The main contribution is to prove that in a neighborhood of the initial zero level set, the level set equations with the restriction of the distance function have a unique solution, which must be the signed distance function with respect to the evolving surface. Some skillful approaches were used: Noticing that any solution for the original equation was a distance function, the original level set equations were transformed into a simpler alternative form. Moreover, since the new system was not a classical one, the system was transformed into an ordinary one, for which the implicit function method was adopted.

Key words

level set methods distance function existence and uniqueness of the solution 

Chinese Library Classification

O175.29 

2000 Mathematics Subject Classification

35M99 35G25 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Osher S, Sethian J A. Fronts propagating with curvature-dependent speed: algorithms based on the Hamilton-Jacobi formulation[J].Journal of Computational Physics, 1988,79(1):12–49.MATHMathSciNetCrossRefGoogle Scholar
  2. [2]
    Kass M, Witkin A, Terzopoulos D. SNADES: Active contour models[J].Int'l Journal of Computer Vision, 1988,1(3):321–332.CrossRefGoogle Scholar
  3. [3]
    Cohen L, Cohen I. Finite element methods for active contour models and balloons for 2D and 3D images[J].IEEE Transaction on Pattern Analysis and Machine Intelligence, 1993,15(11):1131–1147.CrossRefGoogle Scholar
  4. [4]
    McInerney T, Terzopoulos D. Topologically adaptable snakes[A]. In:IEEE Proc 5th Int'l Conf Computer Vision[C]. Boston, M A: IEEE Computer Society Press, 1995, 694–699.Google Scholar
  5. [5]
    Sethian J A, Strain J. Crystal growth and dendritic solidification[J].Journal of Computational Physics, 1992,98(2):231–253.MATHMathSciNetCrossRefGoogle Scholar
  6. [6]
    Zeng X, Staib L, Schultz R T,et al. Volumetric layer segmentation using coupled surfaces propagation[A]. In:IEEE Proc Int'l Conf Computer Vision & Pattern Recognition[C]. Santa Barbara, C A: IEEE Computer Society Press, 1998, 708–715.Google Scholar
  7. [7]
    Gomes J, Faugeras O. Level sets and distance functions[A]. In: David Vernon Ed..Proc 6th European Conference Computer Vision[C]. LNCS 1842, Berlin: Springer-Verlag, 2000, 588–602.Google Scholar
  8. [8]
    Sethian J A.Level Set Methods and Fast Matching Methods[M]. Cambridge, U K: Cambridge University Press, 1999.Google Scholar
  9. [9]
    ZHANG Zhi-fen, YU Tong-ren, DONG Jin-zhu,et al. Qualitative Theory of Differential Equations[M]. Beijing: Science Press, 1985. (in Chinese)Google Scholar

Copyright information

© Editorial Committee of Applied Mathematics and Mechanics 2003

Authors and Affiliations

  • Wang De-jun
    • 1
  • Tang Yun
    • 2
  • Yu Hong-chuan
    • 1
  • Tang Ze-sheng
    • 1
  1. 1.Institute of Software, Department of Computer SciencesTsinghua UniversityBeijingPR China
  2. 2.Department of Mathematical SciencesTsinghua UniversityBeijingPR China

Personalised recommendations