Reconciling distance functions and level sets

This paper is concerned with the simulation of the partial differential equation driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher and Sethian have proposed 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 practical 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?, which reveal a disagreement between the theory and its implementation. This paper proposes an alternative 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 introduction of a new equation. Besides its theoretical advantages, the proposed method also has several practical advantages which we demonstrate in three applications: (i) the segmentation of the human cortex surfaces from MRI images using two coupled surfaces (X. Zeng, et al., in Proceedings of the International Conference on Computer Vision and Pattern Recognition, June 1998), (ii) the construction of a hierarchy of Euclidean skeletons of a 3D surface, (iii) the reconstruction of the surface of 3D objects through stereo (O. Faugeras and R. Keriven, Lecture Notes in Computer Science, Vol. 1252, pp. 272-283). (C) 2000 Academic Press.