190 search results - page 3 / 38 » A New Algorithm for Energy Minimization with Discontinuities |
EMMCVPR
2001
Springer
13 years 12 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-...
ICCV
1999
IEEE
14 years 9 months ago
1999
IEEE
Slanted surfaces pose a problem for correspondence algorithms utilizing search because of the greatly increased number of possibilities, when compared with frontoparallel surfaces...
ICCAD
2004
IEEE
14 years 4 months ago
2004
IEEE
New embedded systems offer rich power management features in the form of multiple operational and non-operational power modes. While they offer mechanisms for better energy effic...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...