Search Results for author:
Found 2 papers, 0 papers with code
Entropy Minimization for Convex Relaxation Approaches
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.
Sequential Convex Relaxation for Mutual Information-Based Unsupervised Figure-Ground Segmentation
We propose an optimization algorithm for mutual-information-based unsupervised figure-ground separation.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
