666 search results - page 2 / 134 » Unbalanced Graph Cuts |
ALENEX
2009
13 years 5 months ago
2009
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
ICCV
2003
IEEE
14 years 6 months ago
2003
IEEE
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We consider the following "multiway cut packing" problem in undirected graphs: we are given a graph G = (V, E) and k commodities, each corresponding to a set of terminal...
DMDW
2001
13 years 6 months ago
2001
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
ACCV
2009
Springer
13 years 11 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...