Sciweavers

85 search results - page 10 / 17
» A Surface Reconstruction Method Using Global Graph Cut Optim...
Sort
View
ICCV
2009
IEEE
15 years 10 days ago
Extending Continuous Cuts: Anisotropic Metrics and Expansion Moves
The concept of graph cuts is by now a standard method for all sorts of low level vision problems. Its popularity is largely due to the fact that globally or near globally optimal...
Carl Olsson, Martin Byr¨od, Niels Chr. Overgaard,...
CVPR
2011
IEEE
13 years 3 months ago
Global Stereo Matching Leveraged by Sparse Ground Control Points
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
Liang Wang, Ruigang Yang
CVPR
2008
IEEE
14 years 9 months ago
Graph cut with ordering constraints on labels and its applications
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu
TVCG
2011
136views more  TVCG 2011»
13 years 2 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
TVCG
2011
188views more  TVCG 2011»
13 years 2 months ago
Data-Parallel Octrees for Surface Reconstruction
—We present the first parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds...
Kun Zhou, Minmin Gong, Xin Huang, Baining Guo