39 search results - page 6 / 8 » Computing Geodesics and Minimal Surfaces via Graph Cuts |
109
click to vote
SCALESPACE
2009
Springer
15 years 3 months ago
2009
Springer
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...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
TVCG
2008
14 years 11 months ago
2008
Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in graphics and such a method provides us a ubiquitous tool for geometric mo...
106
click to vote
CVPR
2012
IEEE
13 years 1 months ago
2012
IEEE
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
TMI
2008
14 years 11 months ago
2008
Abstract-- In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In o...