194 search results - page 26 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
119
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
124
click to vote
ECCV
2002
Springer
16 years 2 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...
96
Voted
SIAMDM
2008
15 years 11 days ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
118
Voted
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper addresses the problem of efficiently solving large-scale energy minimization problems encountered in computer vision. We propose an energy-aware method for merging ran...
94
Voted
ACSC
2007
IEEE
15 years 6 months ago
2007
IEEE
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...