Image Segmentation Based on Level Set Method

Abstract Level set method can be effectively used to solve topology problems during the evolution of curves while the previous algorithms cannot deal with them. In recent years, there are many image segmentation algorithms based on level set method. For different applications of image processing, people have put forward the corresponding solutions, and a large number of researchers also continue to improve and enhance the efficiency and effectiveness of these algorithms. In this article, according to the development of the image segmentation methods based on level set, an overview is given for readers of different backgrounds in this field to use, and their characteristics are discussed.

[1]  Laurent D. Cohen,et al.  On active contour models and balloons , 1991, CVGIP Image Underst..

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

[3]  Rémi Ronfard,et al.  Region-based strategies for active contour models , 1994, International Journal of Computer Vision.

[4]  Tony F. Chan,et al.  A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model , 2002, International Journal of Computer Vision.

[5]  J. Sethian,et al.  A Fast Level Set Method for Propagating Interfaces , 1995 .

[6]  James S. Duncan,et al.  Deformable boundary finding in medical images by integrating gradient and region information , 1996, IEEE Trans. Medical Imaging.

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

[8]  J. Sethian.  Numerical algorithms for propagating interfaces: Hamilton-Jacobi equations and conservation laws , 1990 .

[9]  Timothy F. Cootes,et al.  Active Shape Models-Their Training and Application , 1995, Comput. Vis. Image Underst..

[10]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[11]  Laurent D. Cohen,et al.  Global Minimum for Active Contour Models: A Minimal Path Approach , 1997, International Journal of Computer Vision.

[12]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

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

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

[15]  James S. Duncan,et al.  Boundary Finding with Parametrically Deformable Models , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

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

[17]  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).