1133 search results - page 52 / 227 » Basics of Graph Cuts |
100
click to vote
ECCC
2000
14 years 9 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...
MICCAI
2008
Springer
15 years 11 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...
EMSOFT
2010
Springer
14 years 7 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
The detection of abrupt shot changes ("cuts") in videos is a basic step in video content analysis. Many cut detection algorithms based on histogram differences have been...