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...
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...
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...
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...
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...