Generalized Roof Duality for Pseudo-Boolean Optimization

Fredrik Kahl, Petter Strandmark

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceedingPeer review

22 Citeringar (SciVal)

Sammanfattning

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.
Originalspråkengelska
Titel på värdpublikationIEEE International Conference on Computer Vision (ICCV)
FörlagIEEE - Institute of Electrical and Electronics Engineers Inc.
Sidor255-262
Antal sidor8
DOI
StatusPublished - 2011
EvenemangIEEE International Conference on Computer Vision (ICCV), 2011 - Barcelona, Spanien
Varaktighet: 2011 nov. 62011 nov. 13

Konferens

KonferensIEEE International Conference on Computer Vision (ICCV), 2011
Land/TerritoriumSpanien
OrtBarcelona
Period2011/11/062011/11/13

Ämnesklassifikation (UKÄ)

  • Datorseende och robotik (autonoma system)
  • Matematik

Fingeravtryck

Utforska forskningsämnen för ”Generalized Roof Duality for Pseudo-Boolean Optimization”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här