Sciweavers

843 search results - page 6 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
ECCV
2008
Springer
14 years 5 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
ICIP
2007
IEEE
14 years 9 months ago
Modeling of Front Evolution with Graph Cut Optimization
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
Hang Chang, Qing Yang, Manfred Auer, Bahram Parvin
ICIP
2002
IEEE
14 years 9 months ago
Object contour tracking using graph cuts based active contours
In this paper, we present an object contour tracking approach using graph cuts based active contours (GCBAC). Our proposed algorithm does not need any a priori global shape model,...
Ning Xu, Narendra Ahuja
3DPVT
2006
IEEE
203views Visualization» more  3DPVT 2006»
14 years 1 months ago
Graph Cut Based Multiple View Segmentation for 3D Reconstruction
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...
Mario Sormann, Christopher Zach, Konrad F. Karner
ECCV
2002
Springer
14 years 9 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih