Semiautomatic Segmentation with Compact Shapre Prior

We present a semiautomatic segmentation algorithm, that can segment an object of interest from its background based on a single user selected seed. We are able to obtain reliable and robust segmentation with such low user interaction by assuming that the object to be segmented is of compact shape (we define this assumption later). We base our work on the powerful Graph Cut segmentation algorithm of Boykov and Jolly [2]. As additional benefit of incorporating the compact shape prior we are able to bias the graph cuts segmentation framework towards larger objects. It helps to counteract the well known bias of [2] to shorter segmentation boundaries. Segmentation results are quite sensitive to the choice of parameters, and so another contribution of our paper is that we show how to select the parameters automatically. We demonstrate the effectiveness of our method on the challenging industrial application of transistor gate segmentation in an integrated chip, for which it produces highly accurate results in realtime.

[1]  Ian H. Jermyn,et al.  Globally Optimal Regions and Boundaries as Minimum Ratio Weight Cycles , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Gregory G. Slabaugh,et al.  Graph cuts segmentation using an elliptical shape prior , 2005, IEEE International Conference on Image Processing 2005.

[3]  David Salesin,et al.  Interactive digital photomontage , 2004, SIGGRAPH 2004.

[4]  BoykovYuri,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006 .

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

[6]  Ramesh C. Jain,et al.  Using Dynamic Programming for Solving Variational Problems in Vision , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Nikos Paragios,et al.  Shape Priors for Level Set Representations , 2002, ECCV.

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

[9]  Tao Zhang,et al.  Interactive graph cut based segmentation with shape priors , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[10]  William A. Barrett,et al.  Interactive Segmentation with Intelligent Scissors , 1998, Graph. Model. Image Process..

[11]  Suk Ho Lee,et al.  Level set-based bimodal segmentation with stationary global minimum , 2006, IEEE Transactions on Image Processing.

[12]  IEEE conference on computer vision and pattern recognition , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[13]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  Olga Veksler,et al.  Image segmentation by nested cuts , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[15]  Marie-Pierre Jolly,et al.  Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.

[16]  Jun Wang,et al.  Salient closed boundary extraction with ratio contour , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[19]  Daniel Cremers Nonlinear Dynamical Shape Priors for Level Set Segmentation , 2007, CVPR.

[20]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[21]  Patrick Pérez,et al.  Interactive Image Segmentation Using an Adaptive GMMRF Model , 2004, ECCV.

[22]  Richard M. Leahy,et al.  An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Jian Sun,et al.  Lazy snapping , 2004, SIGGRAPH 2004.

[24]  Olga Veksler,et al.  Stereo Correspondence with Compact Windows via Minimum Ratio Cycle , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[25]  O. Faugeras,et al.  Statistical shape influence in geodesic active contours , 2002, 5th IEEE EMBS International Summer School on Biomedical Imaging, 2002..

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

[27]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

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

[29]  Daniel P. Huttenlocher,et al.  Efficient Graph-Based Image Segmentation , 2004, International Journal of Computer Vision.

[30]  Marie-Pierre Jolly,et al.  Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[31]  Rafael C. González,et al.  Local Determination of a Moving Contrast Edge , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[32]  Leo Grady,et al.  Isoperimetric graph partitioning for image segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[33]  Daniel Cremers,et al.  Kernel Density Estimation and Intrinsic Alignment for Shape Priors in Level Set Segmentation , 2006, International Journal of Computer Vision.

[34]  Jayaram K. Udupa,et al.  User-Steered Image Segmentation Paradigms: Live Wire and Live Lane , 1998, Graph. Model. Image Process..

[35]  Gareth Funka-Lea,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.

[36]  W. Eric L. Grimson,et al.  Model-based curve evolution technique for image segmentation , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[37]  Andrew Zisserman,et al.  OBJ CUT , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).