Results 1 
1 of
1
Computing geodesics and minimal surfaces via graph cuts
 in International Conference on Computer Vision
, 2003
"... Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D ..."
Abstract

Cited by 180 (22 self)
 Add to MetaCart
Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D). We show 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. There are two interesting consequences of this technical result. First, graph cut algorithms can be used to find globally minimum geodesic contours (minimal surfaces in 3D) under arbitrary Riemannian metric for a given set of boundary conditions. Second, we show how to minimize metrication artifacts in existing graphcut based methods in vision. Theoretically speaking, our work provides an interesting link between several branches of mathematicsdifferential geometry, integral geometry, and combinatorial optimization. The main technical problem is solved using CauchyCrofton formula from integral geometry. 1.