666 search results - page 67 / 134 » Unbalanced Graph Cuts |
DAGM
2007
Springer
14 years 4 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...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 10 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
ECCV
2004
Springer
15 years 4 hour 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...
TVCG
2008
13 years 10 months ago
2008
Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorit...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...