48 search results - page 1 / 10 » Fast Approximate Energy Minimization via Graph Cuts |
ICCV
1999
IEEE
14 years 6 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
CVPR
2005
IEEE
14 years 6 months ago
2005
IEEE
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
ECCV
2002
Springer
14 years 6 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...
ICCV
2003
IEEE
14 years 6 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
IJCV
2012
11 years 7 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...