A variationally based weighted re-initialization method for geometric active contours

In geometric active contour algorithms, a re-initialization step must be performed by the level set function to remain close to a signed distance function, in order to avoid numerical instabilities. We propose a new re-initialization method that may be employed as a standalone method to recover the signed distance condition, or may be embedded directly into a variational framework as an additional term for the energy functional. Its purpose is to make the pixels near the propagating contour be less affected by the re-initialization. Experimental results show that whereas previous approaches change the position of the zero level set, our method keeps it virtually unchanged.

[1]  S. Osher,et al.  A level set approach for computing solutions to incompressible two-phase flow , 1994 .

[2]  Rachid Deriche,et al.  Geodesic Active Regions: A New Framework to Deal with Frame Partition Problems in Computer Vision , 2002, J. Vis. Commun. Image Represent..

[3]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Gjlles Aubert,et al.  Mathematical problems in image processing , 2001 .

[5]  Tony F. Chan,et al.  Active contours without edges , 2001, IEEE Trans. Image Process..

[6]  Carl-Fredrik Westin,et al.  Fast sub-voxel re-initialization of the distance map for level set methods , 2005, Pattern Recognit. Lett..

[7]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[8]  Chunming Li,et al.  Level set evolution without re-initialization: a new variational formulation , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).