Sciweavers

Share
ECCV
2006
Springer

Comparison of Energy Minimization Algorithms for Highly Connected Graphs

11 years 1 months ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
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-connected 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 s...
Vladimir Kolmogorov, Carsten Rother
Added 16 Oct 2009
Updated 16 Oct 2009
Type Conference
Year 2006
Where ECCV
Authors Vladimir Kolmogorov, Carsten Rother
Comments (0)
books