1133 search results - page 72 / 227 » Basics of Graph Cuts |
ECCV
2004
Springer
14 years 12 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...
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...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...
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...
JGAA
2007
13 years 10 months ago
2007
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...