Iterated Graph Cuts for Image Segmentation

  title={Iterated Graph Cuts for Image Segmentation},
  author={Bo Peng and Lei Zhang and Jian Yang},
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often leads to many segmentation errors and the parameter λ in the energy function is hard to select. In this paper, we propose an iterated graph cuts algorithm, which starts from the sub-graph that comprises the user labeled foreground/background regions and works iteratively to label the surrounding un-segmented regions. In… 
A Novel Graph Cut Algorithm for Weak Boundary Object Segmentation
The standard graph cut algorithm is extended by taking into account the gradient direction of neighboring pixels as an additional cue, and a new energy function is proposed to fuse the intensity and gradient cues.
A Survey on Traditional and Graph Theoretical Techniques for Image Segmentation
This review paper carried out an organized survey of many image segmentation techniques which are flexible, cost effective and computationally more efficient.
User interactive segmentation with partially growing random forest
  • Jongwon Choi, J. Choi
  • Computer Science
    2015 IEEE International Conference on Image Processing (ICIP)
  • 2015
A non-parametric approach based on random forest to handle the biased initialization problem is developed and a new structure of random forest referred to as partially growing random forest is designed to reduce the training time.
Automatic Image Segmentation by Dynamic Region Merging
The proposed dynamic region-merging algorithm formulates the image segmentation as an inference problem, where the final segmentation is established based on the observed image and it is proved that the produced segmentation satisfies certain global properties.
Recent Advances on Graph-Based Image Segmentation Techniques
This chapter mainly focuses on the most up-to-date research achievements in graph-based image segmentation published in top journals and conferences in computer vision community.
Interactive image segmentation based on hierarchical superpixels initialization and region merging
An interactive image segmentation method based on the hierarchical superpixels initialization and region merging that can rapidly extract the object from the background is presented and experiments verify the effectiveness of the proposed hierarchical framework to generate desiredsuperpixels.
Bottom-Up Merging Segmentation for Color Images With Complex Areas
This paper focuses on detecting hybrid cues of color image to segment complex scene in a bottom-up framework and indicates that the segmentation effectiveness of the proposed method is more robust and accurate than conventional methods.


Graph Cuts and Efficient N-D Image Segmentation
This application epitomizes the best features of combinatorial graph cuts methods in vision: global optima, practical efficiency, numerical robustness, ability to fuse a wide range of visual cues and constraints, unrestricted topological properties of segments, and applicability to N-D problems.
Parameter Selection for Graph Cut Based Image Segmentation
An algorithm for automatic parameter selection for graph cut segmentation, designed and developed using AdaBoost, and a new way to normalize feature weights for the AdaBoost based classifier which is particularly suitable for the framework.
"GrabCut": interactive foreground extraction using iterated graph cuts
A more powerful, iterative version of the optimisation of the graph-cut approach is developed and the power of the iterative algorithm is used to simplify substantially the user interaction needed for a given quality of result.
A multilevel banded graph cuts method for fast image segmentation
A multilevel banded heuristic for computation of graph cuts that is motivated by the well-known narrow band algorithm in level set computation is introduced that drastically reduces both the running time and the memory consumption of graph cut while producing nearly the same segmentation result as the conventional graph cuts.
Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images
  • Yuri Boykov, M. Jolly
  • Computer Science
    Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001
  • 2001
A new technique for general purpose interactive segmentation of N-dimensional images where the user marks certain pixels as "object" or "background" to provide hard constraints for segmentation.
Semiautomatic segmentation with compact shape prior
Star Shape Prior for Graph-Cut Image Segmentation
This paper shows how to implement a star shape prior into graph cut segmentation, a generic shape prior that applies to a wide class of objects, in particular to convex objects, and shows that in many cases, it can achieve an accurate object segmentation with only a single pixel, the center of the object, provided by the user, which is rarely possible with standard graph cut interactive segmentation.
Interactive graph cut based segmentation with shape priors
  • D. Freedman, Tao Zhang
  • Computer Science
    2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)
  • 2005
This work devise a graph cut algorithm for interactive segmentation which incorporates shape priors, and positive results on both medical and natural images are demonstrated.
Computing geodesics and minimal surfaces via graph cuts
  • Yuri Boykov, V. Kolmogorov
  • Mathematics, Computer Science
    Proceedings Ninth IEEE International Conference on Computer Vision
  • 2003
This work shows how to build a grid graph and set its edge weights so that the cost of cuts is arbitrarily close to the length (area) of the corresponding contours (surfaces) for any anisotropic Riemannian metric.
Video object cut and paste
This paper presents a system for cutting a moving object out from a video clip using a new 3D graph cut based segmentation approach on the spatial-temporal video volume and provides brush tools for the user to control the object boundary precisely wherever needed.