Vladimir Kolmogorov

Computing visual correspondence with occlusions using graph cuts

Several new algorithms for visual correspondence based on graph cuts [7, 14, 17] have recently been developed. While these methods give very strong results in practice, they do ...

An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision

"GrabCut"

The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools us...

What energy functions can be minimized via graph cuts?

In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques construc...