666 search results - page 102 / 134 » Unbalanced Graph Cuts |
207
click to vote
MICCAI
2010
Springer
15 years 6 months ago
2010
Springer
While there has been substantial progress in segmenting natural im-
ages, state-of-the-art methods that perform well in such tasks unfortunately tend
to underperform ...
FCT
2005
Springer
15 years 6 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...
100
Voted
ICAPR
2005
Springer
15 years 6 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...
69
Voted
FOCS
2003
IEEE
15 years 6 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 (Ç´...
96
Voted
ECCV
2010
Springer
15 years 5 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 ...