A Relay Level Set Method for Automatic Image Segmentation

This paper presents a new image segmentation method that applies an edge-based level set method in a relay fashion. The proposed method segments an image in a series of nested subregions that are automatically created by shrinking the stabilized curves in their previous subregions. The final result is obtained by combining all boundaries detected in these subregions. The proposed method has the following three advantages: 1) It can be automatically executed without human-computer interactions; 2) it applies the edge-based level set method with relay fashion to detect all boundaries; and 3) it automatically obtains a full segmentation without specifying the number of relays in advance. The comparison experiments illustrate that the proposed method performs better than the representative level set methods, and it can obtain similar or better results compared with other popular segmentation algorithms.

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

[2]  Jerry L. Prince,et al.  Snakes, shapes, and gradient vector flow , 1998, IEEE Trans. Image Process..

[3]  Xuelong Li,et al.  Image Quality Assessment Based on Multiscale Geometric Analysis , 2009, IEEE Transactions on Image Processing.

[4]  G. Sapiro,et al.  Geometric partial differential equations and image analysis [Book Reviews] , 2001, IEEE Transactions on Medical Imaging.

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

[6]  Xuelong Li,et al.  Scene segmentation based on IPCA for visual surveillance , 2009, Neurocomputing.

[7]  Xindong Wu,et al.  Manifold elastic net: a unified framework for sparse dimension reduction , 2010, Data Mining and Knowledge Discovery.

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

[9]  S. Osher,et al.  A PDE-Based Fast Local Level Set Method 1 , 1998 .

[10]  Dacheng Tao,et al.  Biologically Inspired Feature Manifold for Scene Classification , 2010, IEEE Transactions on Image Processing.

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

[12]  Daoqiang Zhang,et al.  Robust image segmentation using FCM with spatial constraints based on new kernel-induced distance measure , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[13]  Lawrence O. Hall,et al.  A generic knowledge-guided image segmentation and labeling system using fuzzy clustering algorithms , 2002, IEEE Trans. Syst. Man Cybern. Part B.

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

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

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

[17]  Richa Singh,et al.  Improving Iris Recognition Performance Using Segmentation, Quality Enhancement, Match Score Fusion, and Indexing , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[18]  Huiyu Zhou,et al.  Level set image segmentation with Bayesian analysis , 2008, Neurocomputing.

[19]  Vladimir Kolmogorov,et al.  An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

[22]  Larry D. Hostetler,et al.  The estimation of the gradient of a density function, with applications in pattern recognition , 1975, IEEE Trans. Inf. Theory.

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

[24]  D. Chopp.  Computing Minimal Surfaces via Level Set Curvature Flow , 1993 .

[25]  Kecheng Liu,et al.  Shape recovery algorithms using level sets in 2-D/3-D medical imagery: a state-of-the-art review , 2002, IEEE Transactions on Information Technology in Biomedicine.

[26]  Xiao Han,et al.  A Topology Preserving Level Set Method for Geometric Deformable Models , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[27]  Yu-Jin Zhang,et al.  Advances in image and video segmentation , 2006 .

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

[29]  Nikolaos G. Bourbakis,et al.  Segmentation of color images using multiscale clustering and graph theoretic region synthesis , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[30]  Yizong Cheng,et al.  Mean Shift, Mode Seeking, and Clustering , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[31]  Hai Jin,et al.  Color Image Segmentation Based on Mean Shift and Normalized Cuts , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[33]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

[36]  Xuelong Li,et al.  A Unified Tensor Level Set for Image Segmentation , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).