39 search results - page 4 / 8 » Computing Geodesics and Minimal Surfaces via Graph Cuts |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
DAGM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
In this paper we present a novel volumetric shape from silhouette algorithm based on a centripetal pentahedron model. The algorithm first partitions the space with a set of infini...
TIP
2011
13 years 2 months ago
2011
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...