{"citation":{"ama":"Kolmogorov V, Boykov Y, Rother C. Applications of parametric maxflow in computer vision. In: IEEE; 2007. doi:<a href=\"https://doi.org/10.1109/ICCV.2007.4408910\">10.1109/ICCV.2007.4408910</a>","short":"V. Kolmogorov, Y. Boykov, C. Rother, in:, IEEE, 2007.","mla":"Kolmogorov, Vladimir, et al. <i>Applications of Parametric Maxflow in Computer Vision</i>. IEEE, 2007, doi:<a href=\"https://doi.org/10.1109/ICCV.2007.4408910\">10.1109/ICCV.2007.4408910</a>.","ieee":"V. Kolmogorov, Y. Boykov, and C. Rother, “Applications of parametric maxflow in computer vision,” presented at the ICCV: International Conference on Computer Vision, 2007.","chicago":"Kolmogorov, Vladimir, Yuri Boykov, and Carsten Rother. “Applications of Parametric Maxflow in Computer Vision.” IEEE, 2007. <a href=\"https://doi.org/10.1109/ICCV.2007.4408910\">https://doi.org/10.1109/ICCV.2007.4408910</a>.","ista":"Kolmogorov V, Boykov Y, Rother C. 2007. Applications of parametric maxflow in computer vision. ICCV: International Conference on Computer Vision.","apa":"Kolmogorov, V., Boykov, Y., &#38; Rother, C. (2007). Applications of parametric maxflow in computer vision. Presented at the ICCV: International Conference on Computer Vision, IEEE. <a href=\"https://doi.org/10.1109/ICCV.2007.4408910\">https://doi.org/10.1109/ICCV.2007.4408910</a>"},"day":"26","type":"conference","_id":"3191","extern":1,"status":"public","year":"2007","doi":"10.1109/ICCV.2007.4408910","title":"Applications of parametric maxflow in computer vision","date_published":"2007-12-26T00:00:00Z","abstract":[{"text":"The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linearly on parameter lambda. In this paper we study vision applications for which it is important to solve the maxflow problem for different lambda's. An example is a weighting between data and regularization terms in image segmentation or stereo: it is desirable to vary it both during training (to learn lambda from ground truth data) and testing (to select best lambda using high-knowledge constraints, e.g. user input). We review algorithmic aspects of this parametric maximum flow problem previously unknown in vision, such as the ability to compute all breakpoints of lambda and corresponding optimal configurations infinite time. These results allow, in particular, to minimize the ratio of some geometric functional, such as flux of a vector field over length (or area). Previously, such functional were tackled with shortest path techniques applicable only in 2D. We give theoretical improvements for &quot;PDE cuts&quot; [5]. We present experimental results for image segmentation, 3D reconstruction, and the cosegmentation problem.","lang":"eng"}],"date_created":"2018-12-11T12:01:55Z","conference":{"name":"ICCV: International Conference on Computer Vision"},"date_updated":"2021-01-12T07:41:41Z","main_file_link":[{"open_access":"0","url":"http://research.microsoft.com/pubs/70474/iccv07-paramaxflow.pdf"}],"publist_id":"3489","publisher":"IEEE","quality_controlled":0,"month":"12","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","first_name":"Vladimir"},{"first_name":"Yuri","full_name":"Boykov, Yuri","last_name":"Boykov"},{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"}],"publication_status":"published"}