47 search results - page 1 / 10 » What Energy Functions Can Be Minimized via Graph Cuts |
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...
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...
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...
ECCV
2002
Springer
14 years 6 months ago
2002
Springer
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
ICASSP
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...