2015
Entropy Minimization for Convex Relaxation Approaches
ICCV 2015poster
Despite their enormous success in solving hard combinatorial problems, convex relaxation approaches often suffer from the fact that the computed solutions are far from binary and that subsequent heuristic binarization may substantially degrade the quality of computed solutions. In this paper, we pr…