Sciweavers

893 search results - page 60 / 179
» Minimal Surfaces for Stereo
Sort
View
CVPR
2009
IEEE
15 years 4 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
ECCV
2002
Springer
14 years 10 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
ECCV
1992
Springer
14 years 10 months ago
Determining Three-Dimensional Shape from Orientation and Spatial Frequency Disparities
Abstract. Binocular di erences in orientation and foreshortening are systematically related to surface slant and tilt and could potentially be exploited by biological and machine v...
David G. Jones, Jitendra Malik
PAMI
2006
145views more  PAMI 2006»
13 years 8 months ago
Convergent Tree-Reweighted Message Passing for Energy Minimization
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
Vladimir Kolmogorov
CVPR
2009
IEEE
15 years 4 months ago
Retrographic sensing for the measurement of surface texture and shape
We describe a novel device that can be used as a 2.5D “scanner” for acquiring surface texture and shape. The device consists of a slab of clear elastomer covered with a refl...
Edward H. Adelson, Micah K. Johnson