LP-relaxation of binarized energy minimization

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F08%3A03150825" target="_blank" >RIV/68407700:21230/08:03150825 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

LP-relaxation of binarized energy minimization

Original language description

We address the problem of energy minimization, which is (1) generally NP-complete and (2) involves many discrete variables - commonly a 2D array of them, arising from an MRF model. One of the approaches to the problem is to formulate it as integer linearprogramming and relax integrality constraints. However this can be done in a number of possible ways. One, widely applied previously (LP-1) [19, 13, 4, 22, 9, 23], appears to lead to a large-scale linear program which is not practical to solve with general LP methods. A number of algorithms were developed which attempt to solve the problem exploiting its structure [14, 23, 22, 9], however their common drawback is that they may converge to a suboptimal point. The other LP relaxation we consider here isconstructed by (1) refor- mulating the optimization problem in the form of a function of binary vari- ables [18], and (2) applying the roof duality relaxation [6] to the reformulated problem. We refer to the resulting relaxation as LP-2.

Czech name

LP-relaxation of binarized energy minimization

Czech description

We address the problem of energy minimization, which is (1) generally NP-complete and (2) involves many discrete variables - commonly a 2D array of them, arising from an MRF model. One of the approaches to the problem is to formulate it as integer linearprogramming and relax integrality constraints. However this can be done in a number of possible ways. One, widely applied previously (LP-1) [19, 13, 4, 22, 9, 23], appears to lead to a large-scale linear program which is not practical to solve with general LP methods. A number of algorithms were developed which attempt to solve the problem exploiting its structure [14, 23, 22, 9], however their common drawback is that they may converge to a suboptimal point. The other LP relaxation we consider here isconstructed by (1) refor- mulating the optimization problem in the form of a function of binary vari- ables [18], and (2) applying the roof duality relaxation [6] to the reformulated problem. We refer to the resulting relaxation as LP-2.

Type

O - Miscellaneous

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

<a href="/en/project/7E08031" target="_blank" >7E08031: Dynamic Interactive Perception-action Learning in Cognitive Systems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2008

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů