494 search results - page 28 / 99 » Optimal Carpet Cutting |
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...
CVPR
2010
IEEE
13 years 8 months ago
2010
IEEE
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
OL
2011
12 years 11 months ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Presentation
A detailed presentation by Yuri Boykov, Daniel Cremers, Vladimir Kolmogorov, at the European Conference on Computer Vision (ECCV) 2006, that shows the difference between local and ...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...