Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations
Journal of Computational Physics
Crystal growth and dendritic solidification
Journal of Computational Physics
Front propagation and phase field theory
SIAM Journal on Control and Optimization
Computing minimal surfaces via level set curvature flow
Journal of Computational Physics
Evolutionary fronts for topology-independent shape modeling and recovery
ECCV '94 Proceedings of the third European conference on Computer vision (vol. 1)
Shape Modeling with Front Propagation: A Level Set Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
A fast level set method for propagating interfaces
Journal of Computational Physics
International Journal of Computer Vision
International Journal of Computer Vision
The fast construction of extension velocities in level set methods
Journal of Computational Physics
Level Set Methods and the Stereo Problem
SCALE-SPACE '97 Proceedings of the First International Conference on Scale-Space Theory in Computer Vision
Volumetric Layer Segmentation Using Coupled Surfaces Propagation
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Gradient flows and geometric active contour models
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Efficient implementation of essentially non-oscillatory shock-capturing schemes, II
Journal of Computational Physics
Advanced algorithmic approaches to medical image segmentation
Hi-index | 0.00 |
This paper is concerned with the simulation of the Partial Differential Equation (PDE) 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 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 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? Etc... 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 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.