How to deal with point correspondences and tangential velocities in the level set framework

In this paper, we overcome a major drawback of the level set framework: the lack of point correspondences. We maintain explicit backward correspondences from the evolving interface to the initial one by advecting the initial point coordinates with the same speed as the level set function. Our method leads to a system of coupled Eulerian partial differential equations. We show in a variety of numerical experiments that it can handle both normal and tangential velocities, large deformations, shocks, rarefactions and topological changes. Applications are many in computer vision and elsewhere since our method can upgrade virtually any level set evolution. We complement our work with the design of non zero tangential velocities that preserve the relative area of interface patches; this feature may be crucial in such applications as computational geometry, grid generation or unfolding of the organs' surfaces, e.g. brain, in medical imaging.

[1]  R. LeVeque High-resolution conservative algorithms for advection in incompressible flow , 1996 .

[2]  Steven Haker,et al.  On Area Preserving Mappings of Minimal Distortion , 2000 .

[3]  Alain Trouvé,et al.  Diffeomorphisms Groups and Pattern Matching in Image Analysis , 1998, International Journal of Computer Vision.

[4]  Olivier D. Faugeras,et al.  Unfolding the Cerebral Cortex Using Level Set Methods , 1999, Scale-Space.

[5]  S. Osher,et al.  Regular Article: A PDE-Based Fast Local Level Set Method , 1999 .

[6]  H. Piaggio Differential Geometry of Curves and Surfaces , 1952, Nature.

[7]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[8]  A. Siamj.,et al.  EVOLUTION OF PLANE CURVES DRIVEN BY A NONLINEAR FUNCTION OF CURVATURE AND ANISOTROPY , 1999 .

[9]  J. Sethian,et al.  Transport and diffusion of material quantities on propagating interfaces via level set methods , 2003 .

[10]  Danping Peng,et al.  Weighted ENO Schemes for Hamilton-Jacobi Equations , 1999, SIAM J. Sci. Comput..

[11]  S. Osher,et al.  A PDE-Based Fast Local Level Set Method 1 , 1998 .

[12]  Manfredo P. do Carmo,et al.  Differential geometry of curves and surfaces , 1976 .

[13]  Guillermo Sapiro,et al.  Region Tracking on Surfaces Deforming via Level-Sets Methods , 1999, Scale-Space.

[14]  G. M.,et al.  Partial Differential Equations I , 2023, Applied Mathematical Sciences.

[15]  Paul Dupuis,et al.  Variational problems on ows of di eomorphisms for image matching , 1998 .

[16]  Chi-Wang Shu,et al.  Efficient Implementation of Weighted ENO Schemes , 1995 .

[17]  Guillermo Sapiro,et al.  Variational Problems and Partial Differential Equations on Implicit Surfaces: Bye Bye Triangulated Surfaces? , 2003 .

[18]  Karol Mikula,et al.  Evolution of Plane Curves Driven by a Nonlinear Function of Curvature and Anisotropy , 2001, SIAM J. Appl. Math..

[19]  Hongkai Zhao,et al.  An Eulerian Formulation for Solving Partial Differential Equations Along a Moving Interface , 2003, J. Sci. Comput..

[20]  B. Vemuri,et al.  A level-set based approach to image registration , 2000, Proceedings IEEE Workshop on Mathematical Methods in Biomedical Image Analysis. MMBIA-2000 (Cat. No.PR00737).

[21]  S. Osher,et al.  Algorithms Based on Hamilton-Jacobi Formulations , 1988 .

[22]  Ron Kikinis,et al.  On the Laplace-Beltrami operator and brain surface flattening , 1999, IEEE Transactions on Medical Imaging.

[23]  Alex M. Andrew,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science (2nd edition) , 2000 .

[24]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .