302 search results - page 26 / 61 » Reducing graphs in graph cut segmentation |
132
click to vote
ECCV
2004
Springer
16 years 1 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
108
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
In this paper, we propose an approach to accurately localize detected objects. The goal is to predict which features pertain to the object and define the object extent with segme...
118
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
DAGM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Autonomous collision avoidance in vehicles requires an accurate seperation of obstacles from the background, particularly near the focus of expansion. In this paper, we p...