Hedgehog Shape Priors for Multi-Object Segmentation

Star-convexity prior is popular for interactive single object segmentation due to its simplicity and amenability to binary graph cut optimization. We propose a more general multi-object segmentation approach. Moreover, each object can be constrained by a more descriptive shape prior, "hedgehog". Each hedgehog shape has its surface normals locally constrained by an arbitrary given vector field, e.g. gradient of the user-scribble distance transform. In contrast to star-convexity, the tightness of our normal constraint can be changed giving better control over allowed shapes. For example, looser constraints, i.e. wider cones of allowed normals, give more relaxed hedgehog shapes. On the other hand, the tightest constraint enforces skeleton consistency with the scribbles. In general, hedgehog shapes are more descriptive than a star, which is only a special case corresponding to a radial vector field and weakest tightness. Our approach has significantly more applications than standard single star-convex segmentation, e.g. in medical data we can separate multiple non-star organs with similar appearances and weak edges. Optimization is done by our modified -expansion moves shown to be submodular for multi-hedgehog shapes.

[1]  Paul A. Yushkevich,et al.  Deformable M-Reps for 3D Medical Image Segmentation , 2003, International Journal of Computer Vision.

[2]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[3]  Guillermo Sapiro,et al.  Geodesic Matting: A Framework for Fast Interactive Image and Video Segmentation and Matting , 2009, International Journal of Computer Vision.

[4]  Ghassan Hamarneh,et al.  Convex multi-region probabilistic segmentation with shape prior in the isometric log-ratio transformation space , 2011, 2011 International Conference on Computer Vision.

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

[6]  Xiaodong Wu,et al.  Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[8]  Vladimir Kolmogorov,et al.  Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[9]  Hiroshi Ishikawa,et al.  Exact Optimization for Markov Random Fields with Convex Priors , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Olga Veksler,et al.  Star Shape Prior for Graph-Cut Image Segmentation , 2008, ECCV.

[11]  B. S. Manjunath,et al.  Shape prior segmentation of multiple objects with graph cuts , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[12]  Kaleem Siddiqi,et al.  Sampled medial loci for 3D shape representation , 2011, Comput. Vis. Image Underst..

[13]  Yuri Boykov,et al.  Energy-Based Geometric Multi-model Fitting , 2012, International Journal of Computer Vision.

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

[15]  Yuri Boykov,et al.  Globally optimal segmentation of multi-region objects , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[16]  Olga Veksler,et al.  Tiered scene labeling with dynamic programming , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[17]  Anton Osokin,et al.  Fast Approximate Energy Minimization with Label Costs , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[18]  Kaleem Siddiqi,et al.  Medial Representations: Mathematics, Algorithms and Applications , 2008 .

[19]  Guillermo Sapiro,et al.  Interactive Image Segmentation via Adaptive Weighted Distances , 2007, IEEE Transactions on Image Processing.

[20]  James N. Damon,et al.  Determining the Geometry of Boundaries of Objects from Medial Data , 2005, International Journal of Computer Vision.

[21]  Olga Veksler,et al.  A-expansion for multiple "hedgehog" shapes , 2016, ArXiv.

[22]  Gábor Székely,et al.  Multiscale Medial Loci and Their Properties , 2003, International Journal of Computer Vision.

[23]  Andrew Blake,et al.  Geodesic star convexity for interactive image segmentation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.