Neighborhood Aided Implicit Active Contours

We have developed a geometric deformable model that employs neighborhood influence to achieve robust segmentation for noisy and broken edges. The fundamental power of this strategy rests with the explicitly combination of regional inter-point constraints, image forces, and a priori boundary information for each geometric contour point within its adaptively determined local influence domain. This formulation thus naturally unifies the essences of the geometric and parametric snakes through automatic local scale selection, and exhibits their respective fundamental strengths of allowing stable boundary detection when the edge information is weak and possibly discontinuous, while maintaining the abilities to handle topological changes during front evolution. In particular, this paper presents an implementation of the method through local integration of the level set function and the image/prior-driven evolution forces, where the resulting partial differential equation is solved numerically using standard finite difference method. Experimental results on synthetic and real images demonstrate its superior performance.

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

[2]  R. Deriche,et al.  Coupled Geodesic Active Regions for Image Segmentation , 1999 .

[3]  Zhizhou Wang,et al.  Deformable Pedal Curves and Surfaces: Hybrid Geometric Active Models for Shape Recovery , 2004, International Journal of Computer Vision.

[4]  T. Hughes,et al.  The Galerkin/least-squares method for advective-diffusive equations , 1988 .

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

[6]  P. Lancaster,et al.  Surfaces generated by moving least squares methods , 1981 .

[7]  Demetri Terzopoulos,et al.  Topologically adaptable snakes , 1995, Proceedings of IEEE International Conference on Computer Vision.

[8]  Jitendra Malik,et al.  A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[9]  Kaleem Siddiqi,et al.  Area and length minimizing flows for shape segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

[11]  Anthony J. Yezzi,et al.  A Fully Global Approach to Image Segmentation via Coupled Curve Evolution Equations , 2002, J. Vis. Commun. Image Represent..

[12]  Jerry L. Prince,et al.  Generalized gradient vector flow external forces for active contours , 1998, Signal Process..

[13]  N. Paragios,et al.  Gradient vector flow fast geodesic active contours , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

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

[15]  Huafeng Liu,et al.  Level set active contours on unstructured point cloud , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

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

[17]  Anthony J. Yezzi,et al.  Sobolev Active Contours , 2005, VLSM.

[18]  Xianghua Xie,et al.  RAGS: region-aided geometric snake , 2004, IEEE Transactions on Image Processing.

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

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

[21]  Baba C. Vemuri,et al.  Shape Modeling with Front Propagation: A Level Set Approach , 1995, IEEE Trans. Pattern Anal. Mach. Intell..