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...
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
The world-wide web has become the most important information source for most of us. Unfortunately, there is no guarantee for the correctness of information on the web. Moreover, d...