{"quality_controlled":0,"title":"What metrics can be approximated by geo cuts or global optimization of length area and flux","citation":{"short":"V. Kolmogorov, Y. Boykov, in:, IEEE, 2005, pp. 564–571.","ista":"Kolmogorov V, Boykov Y. 2005. What metrics can be approximated by geo cuts or global optimization of length area and flux. ICCV: International Conference on Computer Vision vol. 1, 564–571.","apa":"Kolmogorov, V., &#38; Boykov, Y. (2005). What metrics can be approximated by geo cuts or global optimization of length area and flux (Vol. 1, pp. 564–571). Presented at the ICCV: International Conference on Computer Vision, IEEE. <a href=\"https://doi.org/10.1109/ICCV.2005.252\">https://doi.org/10.1109/ICCV.2005.252</a>","chicago":"Kolmogorov, Vladimir, and Yuri Boykov. “What Metrics Can Be Approximated by Geo Cuts or Global Optimization of Length Area and Flux,” 1:564–71. IEEE, 2005. <a href=\"https://doi.org/10.1109/ICCV.2005.252\">https://doi.org/10.1109/ICCV.2005.252</a>.","mla":"Kolmogorov, Vladimir, and Yuri Boykov. <i>What Metrics Can Be Approximated by Geo Cuts or Global Optimization of Length Area and Flux</i>. Vol. 1, IEEE, 2005, pp. 564–71, doi:<a href=\"https://doi.org/10.1109/ICCV.2005.252\">10.1109/ICCV.2005.252</a>.","ieee":"V. Kolmogorov and Y. Boykov, “What metrics can be approximated by geo cuts or global optimization of length area and flux,” presented at the ICCV: International Conference on Computer Vision, 2005, vol. 1, pp. 564–571.","ama":"Kolmogorov V, Boykov Y. What metrics can be approximated by geo cuts or global optimization of length area and flux. In: Vol 1. IEEE; 2005:564-571. doi:<a href=\"https://doi.org/10.1109/ICCV.2005.252\">10.1109/ICCV.2005.252</a>"},"intvolume":"         1","date_created":"2018-12-11T12:01:52Z","status":"public","conference":{"name":"ICCV: International Conference on Computer Vision"},"date_published":"2005-12-05T00:00:00Z","date_updated":"2021-01-12T07:41:38Z","day":"05","extern":1,"_id":"3182","publication_status":"published","volume":1,"abstract":[{"text":"In the work of the authors (2003), we showed that graph cuts can find hypersurfaces of globally minimal length (or area) under any Riemannian metric. Here we show that graph cuts on directed regular grids can approximate a significantly more general class of continuous non-symmetric metrics. Using submodularity condition (Boros and Hammer, 2002 and Kolmogorov and Zabih, 2004), we obtain a tight characterization of graph-representable metrics. Such &quot;submodular&quot; metrics have an elegant geometric interpretation via hypersurface functionals combining length/area and flux. Practically speaking, we attend 'geo-cuts' algorithm to a wider class of geometrically motivated hypersurface functionals and show how to globally optimize any combination of length/area and flux of a given vector field. The concept of flux was recently introduced into computer vision by Vasilevskiy and Siddiqi (2002) but it was mainly studied within variational framework so far. We are first to show that flux can be integrated into graph cuts as well. Combining geometric concepts of flux and length/area within the global optimization framework of graph cuts allows principled discrete segmentation models and advances the slate of the art for the graph cuts methods in vision. In particular we address the &quot;shrinking&quot; problem of graph cuts, improve segmentation of long thin objects, and introduce useful shape constraints.","lang":"eng"}],"doi":"10.1109/ICCV.2005.252","year":"2005","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov"},{"full_name":"Boykov, Yuri","first_name":"Yuri","last_name":"Boykov"}],"page":"564 - 571","type":"conference","month":"12","publisher":"IEEE","publist_id":"3501"}