666 search results - page 55 / 134 » Unbalanced Graph Cuts |
100
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
128
click to vote
MP
2006
15 years 2 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
114
click to vote
PAMI
2010
14 years 9 months ago
2010
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
157
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
150
click to vote
Presentation
A detailed presentation by Yuri Boykov, Daniel Cremers, Vladimir Kolmogorov, at the European Conference on Computer Vision (ECCV) 2006, that shows the difference between local and ...