759 search results - page 30 / 152 » Optimal Graph Search with Iterated Graph Cuts |
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
119
click to vote
ECCV
2010
Springer
14 years 9 months ago
2010
Springer
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
112
click to vote
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
71
Voted
SIAMDM
2008
14 years 9 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...