{"_id":"3170","volume":1,"publication_status":"published","day":"30","extern":1,"status":"public","conference":{"name":"ICCV: International Conference on Computer Vision"},"date_updated":"2021-01-12T07:41:33Z","date_published":"2003-09-30T00:00:00Z","citation":{"ieee":"Y. Boykov and V. Kolmogorov, “Computing geodesics and minimal surfaces via graph cuts,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 1, pp. 26–33.","ama":"Boykov Y, Kolmogorov V. Computing geodesics and minimal surfaces via graph cuts. In: Vol 1. IEEE; 2003:26-33. doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">10.1109/ICCV.2003.1238310</a>","ista":"Boykov Y, Kolmogorov V. 2003. Computing geodesics and minimal surfaces via graph cuts. ICCV: International Conference on Computer Vision vol. 1, 26–33.","short":"Y. Boykov, V. Kolmogorov, in:, IEEE, 2003, pp. 26–33.","apa":"Boykov, Y., &#38; Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts (Vol. 1, pp. 26–33). Presented at the ICCV: International Conference on Computer Vision, IEEE. <a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">https://doi.org/10.1109/ICCV.2003.1238310</a>","chicago":"Boykov, Yuri, and Vladimir Kolmogorov. “Computing Geodesics and Minimal Surfaces via Graph Cuts,” 1:26–33. IEEE, 2003. <a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">https://doi.org/10.1109/ICCV.2003.1238310</a>.","mla":"Boykov, Yuri, and Vladimir Kolmogorov. <i>Computing Geodesics and Minimal Surfaces via Graph Cuts</i>. Vol. 1, IEEE, 2003, pp. 26–33, doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">10.1109/ICCV.2003.1238310</a>."},"intvolume":"         1","title":"Computing geodesics and minimal surfaces via graph cuts","quality_controlled":0,"date_created":"2018-12-11T12:01:48Z","publist_id":"3511","month":"09","publisher":"IEEE","type":"conference","page":"26 - 33","doi":"10.1109/ICCV.2003.1238310","abstract":[{"lang":"eng","text":"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 graph-cut based methods in vision. Theoretically speaking, our work provides an interesting link between several branches of mathematics -differential geometry, integral geometry, and combinatorial optimization. The main technical problem is solved using Cauchy-Crofton formula from integral geometry."}],"author":[{"first_name":"Yuri","last_name":"Boykov","full_name":"Boykov, Yuri"},{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov"}],"year":"2003"}