Issue No. 11 - November (2003 vol. 25)
<p><b>Abstract</b>—We introduce a novel optimization method based on semidefinite programming relaxations to the field of computer vision and apply it to the combinatorial problem of minimizing quadratic functionals in binary decision variables subject to linear constraints. The approach is (tuning) parameter-free and computes high-quality combinatorial solutions using interior-point methods (convex programming) and a randomized hyperplane technique. Apart from a symmetry condition, no assumptions (such as metric pairwise interactions) are made with respect to the objective criterion. As a consequence, the approach can be applied to a wide range of problems. Applications to unsupervised partitioning, figure-ground discrimination, and binary restoration are presented along with extensive ground-truth experiments. From the viewpoint of relaxation of the underlying combinatorial problem, we show the superiority of our approach to relaxations based on spectral graph theory and prove performance bounds.</p>
Image partitioning, segmentation, graph cuts, perceptual grouping, figure-ground discrimination, combinatorial optimization, relaxation, convex optimization, convex programming.
Daniel Cremers, Christoph Schn?, Jens Keuchel, Christian Schellewald, "Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 25, no. , pp. 1364-1379, November 2003, doi:10.1109/TPAMI.2003.1240111