Graph Cut Segmentation with Nonlinear Shape Priors

Graph cut image segmentation with intensity information alone is prone to fail for objects with weak edges, in clutter, or under occlusion. Existing methods to incorporate shape are often too restrictive for highly varied shapes, use a single fixed shape which may be prone to misalignment, or are computationally intensive. In this note we show how highly variable nonlinear shape priors learned from training sets can be added to existing iterative graph cut methods for accurate and efficient segmentation of such objects. Using kernel principle component analysis, we demonstrate how a shape projection pre-image can induce an iteratively refined shape prior in a Bayesian manner. Examples of natural imagery show that both single-pass and iterative segmentation fail without such shape information.

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

[2]  Bernhard Schölkopf,et al.  Nonlinear Component Analysis as a Kernel Eigenvalue Problem , 1998, Neural Computation.

[3]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Vladimir Kolmogorov,et al.  What metrics can be approximated by geo-cuts, or global optimization of length/area and flux , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[5]  Amir Averbuch,et al.  Fast gradient methods based global motion estimation for video compression , 2002, Proceedings. International Conference on Image Processing.

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

[7]  Olga Veksler,et al.  Semiautomatic Segmentation with Compact Shapre Prior , 2006, The 3rd Canadian Conference on Computer and Robot Vision (CRV'06).

[8]  Gunnar Rätsch,et al.  Kernel PCA and De-Noising in Feature Spaces , 1998, NIPS.

[9]  Ning Xu,et al.  Object segmentation using graph cuts based active contours , 2007, Comput. Vis. Image Underst..

[10]  Timothy F. Cootes,et al.  A Unified Framework for Atlas Matching Using Active Appearance Models , 1999, IPMI.

[11]  Yogesh Rathi,et al.  Shape-Based Approach to Robust Image Segmentation using Kernel PCA , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[12]  Allen Tannenbaum,et al.  Statistical shape analysis using kernel PCA , 2006, Electronic Imaging.

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

[14]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[15]  Daniel Cremers,et al.  Shape statistics in kernel space for variational image segmentation , 2003, Pattern Recognit..

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

[17]  Ning Xu,et al.  Object segmentation using graph cuts based active contours , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[18]  Frank Y. Shih,et al.  Image Segmentation , 2007, Encyclopedia of Biometrics.

[19]  W. Eric L. Grimson,et al.  A shape-based approach to the segmentation of medical imagery using level sets , 2003, IEEE Transactions on Medical Imaging.

[20]  Vladimir Kolmogorov,et al.  "GrabCut": interactive foreground extraction using iterated graph cuts , 2004, ACM Trans. Graph..

[21]  Olga Veksler,et al.  Semiautomatic segmentation with compact shape prior , 2009, Image Vis. Comput..

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