Computing approximate geodesics and minimal surfaces using watershed and graph-cuts
Jean Stawiaski, Étienne Decencière, François Bidault · Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research) · 2007
Geodesics and minimal surfaces are widely used for medical image segmentation. At least two different approaches are used to compute such segmentations. First, geodesic active contours use differential geometry to compute optimal contours minimizing a given Riemannian metric. Second, Boykov and Kolmogorov have proposed a method based on integral geometry to compute similar contours using a graph representation of the image and combinatorial optimization. In this paper we present a technique to compute approximate geodesics and minimal surfaces using a low-level segmentation and graph-cuts optimization. Our approach speeds-up the computation of minimal surfaces when a low-level segmentation is available.