In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
We introduce a convex relaxation framework to optimally
minimize continuous surface ratios. The key idea is to minimize
the continuous surface ratio by solving a sequence
of con...
Kalin Kolev (University of Bonn), Daniel Cremers (...
Convex and continuous energy formulations for low level
vision problems enable efficient search procedures for the
corresponding globally optimal solutions. In this work we
exte...
Christopher Zach (UNC Chapel Hill), Marc Niethamme...
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...