{"citation":{"apa":"Kolmogorov, V., &#38; Rother, C. (2006). Comparison of energy minimization algorithms for highly connected graphs (Vol. 3952 LNCS, pp. 1–15). Presented at the ECCV: European Conference on Computer Vision, Springer. <a href=\"https://doi.org/10.1007/11744047_1\">https://doi.org/10.1007/11744047_1</a>","chicago":"Kolmogorov, Vladimir, and Carsten Rother. “Comparison of Energy Minimization Algorithms for Highly Connected Graphs,” 3952 LNCS:1–15. Springer, 2006. <a href=\"https://doi.org/10.1007/11744047_1\">https://doi.org/10.1007/11744047_1</a>.","ama":"Kolmogorov V, Rother C. Comparison of energy minimization algorithms for highly connected graphs. In: Vol 3952 LNCS. Springer; 2006:1-15. doi:<a href=\"https://doi.org/10.1007/11744047_1\">10.1007/11744047_1</a>","ieee":"V. Kolmogorov and C. Rother, “Comparison of energy minimization algorithms for highly connected graphs,” presented at the ECCV: European Conference on Computer Vision, 2006, vol. 3952 LNCS, pp. 1–15.","ista":"Kolmogorov V, Rother C. 2006. Comparison of energy minimization algorithms for highly connected graphs. ECCV: European Conference on Computer Vision, LNCS, vol. 3952 LNCS, 1–15.","mla":"Kolmogorov, Vladimir, and Carsten Rother. <i>Comparison of Energy Minimization Algorithms for Highly Connected Graphs</i>. Vol. 3952 LNCS, Springer, 2006, pp. 1–15, doi:<a href=\"https://doi.org/10.1007/11744047_1\">10.1007/11744047_1</a>.","short":"V. Kolmogorov, C. Rother, in:, Springer, 2006, pp. 1–15."},"publist_id":"3498","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","first_name":"Vladimir"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"}],"abstract":[{"text":"Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-reweighted message passing (TRW). So far, the standard benchmark for their comparison has been a 4-connected grid-graph arising in pixel-labelling stereo. This minimization problem, however, has been largely solved: recent work shows that for many scenes TRW finds the global optimum. Furthermore, it is known that a 4-connecled grid-graph is a poor stereo model since it does not take occlusions into account. We propose the problem of stereo with occlusions as a new test bed for minimization algorithms. This is a more challenging graph since it has much larger connectivity, and it also serves as a better stereo model. An attractive feature of this problem is that increased connectivity does not result in increased complexity of message passing algorithms. Indeed, one contribution of this paper is to show that sophisticated implementations of BP and TRW have the same time and memory complexity as that of 4-connecled grid-graph stereo. The main conclusion of our experimental study is that for our problem graph cut outperforms both TRW and BP considerably. TRW achieves consistently a lower energy than BP. However, as connectivity increases the speed of convergence of TRW becomes slower. Unlike 4-connected grids, the difference between the energy of the best optimization method and the lower bound of TRW appears significant. This shows the hardness of the problem and motivates future research.","lang":"eng"}],"type":"conference","_id":"3184","year":"2006","volume":"3952 LNCS","quality_controlled":0,"extern":1,"date_published":"2006-05-03T00:00:00Z","month":"05","date_updated":"2021-01-12T07:41:39Z","title":"Comparison of energy minimization algorithms for highly connected graphs","publisher":"Springer","page":"1 - 15","doi":"10.1007/11744047_1","status":"public","main_file_link":[{"open_access":"0","url":"http://research.microsoft.com/pubs/67889/paper_eccv06-trw.pdf"}],"alternative_title":["LNCS"],"day":"03","publication_status":"published","conference":{"name":"ECCV: European Conference on Computer Vision"},"date_created":"2018-12-11T12:01:52Z"}