Sciweavers

244 search results - page 22 / 49
» Image Thresholding Using Graph Cuts
Sort
View
CVPR
2009
IEEE
15 years 6 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
ECCV
2002
Springer
15 years 24 days ago
Multi-camera Scene Reconstruction via Graph Cuts
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
Vladimir Kolmogorov, Ramin Zabih
ICCV
2009
IEEE
15 years 3 months ago
Higher-Order Gradient Descent by Fusion-Move Graph Cut
Markov Random Field is now ubiquitous in many formulations of various vision problems. Recently, optimization of higher-order potentials became practical using higherorder graph...
Hiroshi Ishikawa
SCALESPACE
2009
Springer
14 years 3 months ago
Semi-supervised Segmentation Based on Non-local Continuous Min-Cut
We propose a semi-supervised image segmentation method that relies on a non-local continuous version of the min-cut algorithm and labels or seeds provided by a user. The segmentati...
Nawal Houhou, Xavier Bresson, Arthur Szlam, Tony F...
ECCV
2008
Springer
15 years 25 days ago
Image Segmentation by Branch-and-Mincut
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
Victor S. Lempitsky, Andrew Blake, Carsten Rother