Sciweavers

39 search results - page 1 / 8
» Computing Geodesics and Minimal Surfaces via Graph Cuts
Sort
View
ICCV
2003
IEEE
14 years 6 months ago
Computing Geodesics and Minimal Surfaces via Graph Cuts
Yuri Boykov, Vladimir Kolmogorov
ICCV
2007
IEEE
14 years 6 months ago
Multi-View Stereo via Graph Cuts on the Dual of an Adaptive Tetrahedral Mesh
We formulate multi-view 3D shape reconstruction as the computation of a minimum cut on the dual graph of a semiregular, multi-resolution, tetrahedral mesh. Our method does not ass...
Sudipta N. Sinha, Philippos Mordohai, Marc Pollefe...
CAD
2004
Springer
13 years 4 months ago
Reduce the stretch in surface flattening by finding cutting paths to the surface boundary
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
Charlie C. L. Wang, Yu Wang 0010, Kai Tang, Matthe...
ICPR
2010
IEEE
13 years 10 months ago
Geodesic Thin Plate Splines for Image Segmentation
Thin Plate Splines are often used in image registration to model deformations. Its physical analogy involves a thin lying sheet of metal that is deformed and forced to pass throug...
Herve Lombaert, Farida Cheriet
ECCV
2002
Springer
14 years 6 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