Efficient Implementation of the Chan-Vese Models Without Solving PDEs

Efficient implementation methods are proposed for Chan-Vese models. The proposed methods do not require solutions of PDEs and are therefore fast. The advantages of level set methods, such as automatic handling of topological changes, are preserved. These methods utilize region information to guide the evolution of initial curves. Gaussian smoothing is applied to regularize the evolving curves. These algorithms are able to automatically and efficiently segment objects in complicated images. Experimental results show that the proposed methods work efficiently for images without strong noise. However, they still have initialization problems, as do the Chan-Vese models

[1]  J. Sethian.  Advances in fast marching and level set methods for propagating interfaces , 1999 .

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

[3]  Baba C. Vemuri,et al.  Evolutionary Fronts for Topology-Independent Shape Modeling and Recoveery , 1994, ECCV.

[4]  W. Clem Karl,et al.  A fast level set method without solving PDEs [image segmentation applications] , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

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

[6]  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.

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

[8]  Alan L. Yuille,et al.  Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Benjamin B. Kimia,et al.  Shapes, shocks, and deformations I: The components of two-dimensional shape and the reaction-diffusion space , 1995, International Journal of Computer Vision.

[10]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[11]  Anthony J. Yezzi,et al.  Curve evolution implementation of the Mumford-Shah functional for image segmentation, denoising, interpolation, and magnification , 2001, IEEE Trans. Image Process..

[12]  Rachid Deriche,et al.  Coupled Geodesic Active Regions for Image Segmentation: A Level Set Approach , 2000, ECCV.

[13]  Tien D. Bui,et al.  Image segmentation and selective smoothing by using Mumford-Shah model , 2005, IEEE Transactions on Image Processing.

[14]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[15]  Anthony J. Yezzi,et al.  Gradient flows and geometric active contour models , 1995, Proceedings of IEEE International Conference on Computer Vision.

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

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

[18]  Ron Kimmel,et al.  Fast Edge Integration , 2003 .

[19]  V. Caselles,et al.  A geometric model for active contours in image processing , 1993 .