2527 search results - page 334 / 506 » Discrete optimization in computer vision |
215
click to vote
CVPR
2012
IEEE
13 years 7 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...
129
Voted
NIPS
2007
15 years 6 months ago
2007
The classical hypothesis, that bottom-up saliency is a center-surround process, is combined with a more recent hypothesis that all saliency decisions are optimal in a decision-the...
132
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
134
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
2010
Eurographics
We present an automatic method to recover high-resolution texture over an object by mapping detailed photographs onto its surface. Such high-resolution detail often reveals inaccu...
145
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...