This work presents two algorithms based on graph cuts that efficiently find a local minimum with respect to two types of large moves, namely expansion moves and swap moves that allow important cases of discontinuity preserving energies.Expand

This paper proposes two algorithms that use graph cuts to compute a local minimum even when very large moves are allowed, and generates a labeling such that there is no expansion move that decreases the energy.Expand

IEEE Transactions on Pattern Analysis and Machine…

1 June 2008

TLDR

A set of energy minimization benchmarks are described and used to compare the solution quality and runtime of several common energy minimizations algorithms and a general-purpose software interface is provided that allows vision researchers to easily switch between optimization methods.Expand

This paper shows that the maximum a posteriori estimate of such an MRF can be obtained by solving a multiway minimum cut problem on a graph, and develops efficient algorithms for computing good approximations to the minimum multiway, cut.Expand

This work forms the superpixel partitioning problem in an energy minimization framework, and explores variations of the basic energy, which allow a trade-off between a less regular tessellation but more accurate boundaries or better efficiency.Expand

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.Expand

Energy minimization is an elegant approach to computer vision. Vision problems usually have many solutions due to uncertainties in the imaging process and ambiguities in visual interpretation. The… Expand

A set of energy minimization benchmarks, which are used to compare the solution quality and running time of several common energy minimizations algorithms, as well as a general-purpose software interface that allows vision researchers to easily switch between optimization methods with minimal overhead.Expand

This work proposes a new energy term explicitly measuring L1 distance between the object and background appearance models that can be globally maximized in one graph cut and shows that in many applications this simple term makes NP-hard segmentation functionals unnecessary.Expand

A fast and accurate variable window approach based on the integral image technique, which allows computation of the window cost over any rectangular window in constant time, regardless of window size.Expand