6 search results - page 1 / 2 » An Experimental Comparison of Min-cut Max-flow Algorithms fo... |
EMMCVPR
2001
Springer
13 years 11 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
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-...
ICCVW
1999
Springer
13 years 11 months ago
1999
Springer
While many algorithms for computing stereo correspondence have been proposed, there has been very little work on experimentally evaluating algorithm performance, especially using r...
ECCV
2010
Springer
14 years 11 days ago
2010
Springer
The level set representation of shapes is useful for shape evolution and is widely used for the minimization of energies with respect to shapes. Many algorithms consider energies d...
ICCV
2007
IEEE
14 years 1 months ago
2007
IEEE
Surface gradients are useful to surface reconstruction in single view modeling, shape-from-shading, and photometric stereo. Previous algorithms minimize a complex, nonlinear energ...