1115 search results - page 119 / 223 » Active Graph Cuts |
101
click to vote
FCT
2005
Springer
15 years 8 months ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
114
Voted
ICAPR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The aim of this paper is to present an improvement of a previously published algorithm. The proposed approach is performed in two steps. In the first step, we generate t...
80
Voted
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
109
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
We propose a category-independent method to produce a bag of regions and rank them, such that top-ranked regions are likely to be good segmentations of different objects. Our key ...
60
Voted
COLING
2008
15 years 4 months ago
2008
Treating classification as seeking minimum cuts in the appropriate graph has proven effective in a number of applications. The power of this approach lies in its ability to incorp...