666 search results - page 62 / 134 » Unbalanced Graph Cuts |
CVPR
2011
IEEE
13 years 6 months ago
2011
IEEE
We present a modification of “Normalized Cuts” to incorporate priors which can be used for constrained image segmentation. Compared to previous generalizations of “Normaliz...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
CVPR
2010
IEEE
14 years 2 months ago
2010
IEEE
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
IWOMP
2007
Springer
14 years 4 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...