Level Set Method without Reinitialization

Variational Level Set Method without Reinitialization

Advantages of this method:

No reinitialization, implementation is consistent with theoretical formulation.*
Allows large time step, faster curve evolution.
Flexible and efficient initialization.
Very simple numerical scheme and easy implementation.

Click here to download the paper and source code of this method.

* Note: As pointed out by Gomes and Faugeras [4], using reinitialization to repair the evolving level set function is a disagreement between the theory and the implementation.

References:

[1] Chunming Li, Chenyang Xu, Changfeng Gui, and Martin D. Fox, “Level Set Evolution Without Re-initialization: A New Variational Formulation”, IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), vol. 1, pp. 430-436, San Diego, 2005 (Oral presentation acceptance ratio: 74 out of 1200).

[2] V. Caselles, R. Kimmel, and G. Sapiro, “Geodesic Active Contours”, Int'l J. Comp. Vis., vol. 22, pp. 61-79, 1997.

[3] R. Malladi, J. Sethian, and B. Vemuri, ``Shape modeling with front propagation: a level set approach", IEEE Trans. Patt. Anal. Mach. Intell., vol. 17, pp. 158-175, 1995.

[4] J. Gomes and O. Faugeras, "Reconciling distance functions and level sets," in Lecture Notes in Computer Science, M. Nielsen, P. Johansen, O. F. Olsen, and J. Weickert, Eds. Berlin, Germany, 1999, vol. 1682, Scale-Space Theories in Computer Vision, pp. 70--81.