396 search results - page 27 / 80 » A Graph Cut Algorithm for Generalized Image Deconvolution |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a new shape prior segmentation method using graph cuts capable of segmenting multiple objects. The shape prior energy is based on a shape distance popular with level se...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
In this work, we present a novel segmentation method for deformable objects in monocular videos. Firstly we introduce the dynamic shape to represent the prior knowledge about obje...
IJCV
2008
13 years 7 months ago
2008
Abstract This paper presents a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other state of the art meth...