Generalized Roof Duality for Pseudo-Boolean Optimization

Summary, in English

The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to reduce the higher-order objective function to a quadratic pseudo-boolean function, and then use roof duality for obtaining a lower bound. Roof duality works by constructing the tightest possible lower-bounding submodular function, and instead of optimizing the original objective function, the relaxation is minimized.

We generalize this idea to polynomials of higher degree, where quadratic roof duality appears as a special case. Optimal relaxations are defined to be the ones that give the maximum lower bound. We demonstrate that important properties such as persistency still hold and how the relaxations can be efficiently constructed for general cubic and quartic pseudo-boolean functions. From a practical point of view, we show that our relaxations perform better than state-of-the-art for a wide range of problems, both in terms of lower bounds and in the number of assigned variables.

• Author: Fredrik Kahl; Petter Strandmark
• Department/s: Mathematics (Faculty of Engineering); Mathematical Imaging Group; ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publishing year: 2011
• Language: English
• Pages: 255-262
• Publication/Series: IEEE International Conference on Computer Vision (ICCV)
• Links: http://dx.doi.org/10.1109/ICCV.2011.6126250
• Document type: Conference paper
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Computer Vision and Robotics (Autonomous Systems); Mathematics
• Conference name: IEEE International Conference on Computer Vision (ICCV), 2011
• Conference date: 2011-11-06 - 2011-11-13
• Conference place: Barcelona, Spain
• Status: Published
• Research group: Mathematical Imaging Group