Sciweavers

39 search results - page 2 / 8
» Computing Geodesics and Minimal Surfaces via Graph Cuts
Sort
View
CVPR
2005
IEEE
14 years 7 months ago
Energy Minimization via Graph Cuts: Settling What is Possible
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
Daniel Freedman, Petros Drineas
CVPR
2010
IEEE
14 years 2 months ago
Geodesic Graph Cut for Interactive Image Segmentation
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
Brian Price, Bryan Morse, Scott Cohen
ICCV
1999
IEEE
14 years 7 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
CVPR
2003
IEEE
14 years 7 months ago
Surfaces with Occlusions from Layered Stereo
Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among th...
Michael H. Lin, Carlo Tomasi
ECCV
2002
Springer
14 years 7 months 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