1115 search results - page 48 / 223 » Active Graph Cuts |
124
click to vote
JGO
2010
15 years 27 days ago
2010
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
MP
2010
15 years 26 days ago
2010
Adding cuts based on copositive matrices, we propose to improve Lov´asz’ bound θ on the clique number and its tightening θ introduced by McEliece, Rodemich, Rumsey, and Schri...
126
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
137
click to vote
ECCC
2000
15 years 2 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
124
Voted
MICCAI
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...