843 search results - page 25 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
PRICAI
2000
Springer
13 years 11 months ago
2000
Springer
This paper introduces the even-odd POMDP, an approximation to POMDPs in which the world is assumed to be fully observable every other time step. The even-odd POMDP can be converte...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
Recent work in structure from motion (SfM) has successfully built 3D models from large unstructured collections of images downloaded from the Internet. Most approaches use increme...
CCE
2005
13 years 7 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...