57 search results - page 6 / 12 » Globally Optimal Segmentation of Interacting Surfaces with G... |
CHI
2006
ACM
13 years 11 months ago
2006
ACM
The state-of-the-art in computer drawing programs is based on a number of concepts that are over two decades old. One such concept is the use of layers for ordering the surfaces i...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Shape from shading (SfS) has always been difficult for real applications due to its intrinsic ill-posedness. In this paper, we propose an interactive SfS method which efficiently ...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Dynamic programming (DP) has been a useful tool for a variety of computer vision problems. However its application is usually limited to problems with a one dimensional or low tre...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
2010
Eurographics
When projectors are used to display images on complex, non-planar surface geometry, indirect illumination between the surfaces will disrupt the final appearance of this imagery, ...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 7 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...