Patch-Cuts: A Graph-Based Image Segmentation Method Using Patch Features and Spatial Relations

In this paper, we present a graph-based image segmentation method (patch-cuts) that incorporates features and spatial relations obtained from image patches. In the first step, patch-cuts extracts a set of patches that can assume arbitrary shape and size. Patches are determined by a combination of intensity quantization and morphological operations and render the proposed method robust against noise. Upon patch extraction, a set of intensity, texture and shape features are computed for each patch. These features are integrated and minimized simultaneously in a tunable energy function. Patch-cuts explores the benefit of information theory-based measures such as the Kullback-Leibler and the Jensen-Shannon divergence in its energy terms. In our experiments, we applied patchcuts to general images as well as to non-contrast Computed Tomography heart scans.

[1]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Harry Shum,et al.  Lazy snapping , 2004, ACM Trans. Graph..

[3]  Zhuowen Tu,et al.  Graph-shifts: Natural image labeling by dynamic hierarchical computing , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[4]  Yogesh Rathi,et al.  Graph Cut Segmentation with Nonlinear Shape Priors , 2007, 2007 IEEE International Conference on Image Processing.

[5]  Gareth Funka-Lea,et al.  Automatic heart isolation for CT coronary visualization using graph-cuts , 2006, 3rd IEEE International Symposium on Biomedical Imaging: Nano to Macro, 2006..

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

[7]  Derek Hoiem,et al.  Learning CRFs Using Graph Cuts , 2008, ECCV.

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

[9]  Michal Irani,et al.  What Is a Good Image Segment? A Unified Approach to Segment Extraction , 2008, ECCV.

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

[11]  C.-C. Jay Kuo,et al.  Automatic target-shape recognition via deformable wavelet templates , 1996, Defense, Security, and Sensing.

[12]  Robert M. Haralick,et al.  Textural Features for Image Classification , 1973, IEEE Trans. Syst. Man Cybern..

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

[14]  Song-Chun Zhu,et al.  Equivalence of Julesz and Gibbs texture ensembles , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[15]  Andreas Krause,et al.  Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.

[16]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[17]  Jeffrey M. Zacks,et al.  Event structure in perception and conception. , 2001, Psychological bulletin.

[18]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

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

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

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

[22]  Huaiyu Zhu.  On Information and Sufficiency , 1997 .

[23]  Vladimir Kolmogorov,et al.  Visual correspondence using energy minimization and mutual information , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.