• Publications
  • Influence
Fast Approximate Energy Minimization via Graph Cuts
We present 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. Expand
  • 4,756
  • 459
Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images
  • Yuri Boykov, M. Jolly
  • Mathematics, Computer Science
  • Proceedings Eighth IEEE International Conference…
  • 7 July 2001
In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images. Expand
  • 3,345
  • 347
Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images
In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images . Expand
  • 1,943
  • 294
  • PDF
Fast approximate energy minimization via graph cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. Expand
  • 3,160
  • 260
  • PDF
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Minimum cut/maximum flow algorithms on graphs have emerged as an increasingly useful tool for exactor approximate energy minimization in low-level vision. Expand
  • 3,392
  • 248
  • PDF
Graph Cuts and Efficient N-D Image Segmentation
This paper presents a detailed description of the basic combinatorial optimization framework for efficient object extraction from N-D image data using s/t graph cuts. Expand
  • 1,979
  • 167
  • PDF
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
This paper provides an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in low-level vision. Expand
  • 2,106
  • 94
Computing geodesics and minimal surfaces via graph cuts
  • Yuri Boykov, V. Kolmogorov
  • Mathematics, Computer Science
  • Proceedings Ninth IEEE International Conference…
  • 13 October 2003
We introduce a new segmentation method combining geodesic active contours and graph cuts. Expand
  • 650
  • 58
  • PDF
Fast Approximate Energy Minimization with Label Costs
The α-expansion algorithm has had a significant impact in computer vision due to its generality, effectiveness, and speed. Expand
  • 526
  • 48
  • PDF
Energy-Based Geometric Multi-model Fitting
We formulate geometric multi-model fitting as an optimal labeling problem with a global energy function balancing geometric errors and regularity of inlier clusters. Expand
  • 270
  • 47
  • PDF