666 search results - page 19 / 134 » Unbalanced Graph Cuts |
ACCV
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio...
CPC
2006
13 years 10 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
TAMC
2009
Springer
14 years 4 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
ICCV
2005
IEEE
14 years 12 months ago
2005
IEEE
ICPR
2004
IEEE
14 years 11 months ago
2004
IEEE