| Attributes | Values |
|---|
| rdf:type
| |
| 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 linear programming 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 is constructed 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.
- 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 linear programming 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 is constructed 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. (en)
- 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 linear programming 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 is constructed 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. (cs)
|
| Title
| - LP-relaxation of binarized energy minimization
- LP-relaxation of binarized energy minimization (en)
- LP-relaxation of binarized energy minimization (cs)
|
| skos:prefLabel
| - LP-relaxation of binarized energy minimization
- LP-relaxation of binarized energy minimization (en)
- LP-relaxation of binarized energy minimization (cs)
|
| skos:notation
| - RIV/68407700:21230/08:03150825!RIV09-MSM-21230___
|
| http://linked.open...avai/riv/aktivita
| |
| http://linked.open...avai/riv/aktivity
| - P(7E08031), Z(MSM6840770038)
|
| http://linked.open...vai/riv/dodaniDat
| |
| http://linked.open...aciTvurceVysledku
| |
| http://linked.open.../riv/druhVysledku
| |
| http://linked.open...iv/duvernostUdaju
| |
| http://linked.open...titaPredkladatele
| |
| http://linked.open...dnocenehoVysledku
| |
| http://linked.open...ai/riv/idVysledku
| - RIV/68407700:21230/08:03150825
|
| http://linked.open...riv/jazykVysledku
| |
| http://linked.open.../riv/klicovaSlova
| - MRF; energy minimization; multilabe; partial optimality; persistency; pseudo-Boolean optimization (en)
|
| http://linked.open.../riv/klicoveSlovo
| |
| http://linked.open...ontrolniKodProRIV
| |
| http://linked.open...in/vavai/riv/obor
| |
| http://linked.open...ichTvurcuVysledku
| |
| http://linked.open...cetTvurcuVysledku
| |
| http://linked.open...vavai/riv/projekt
| |
| http://linked.open...UplatneniVysledku
| |
| http://linked.open...iv/tvurceVysledku
| - Hlaváč, Václav
- Shekhovtsov, Oleksandr
- Kohli, P.
- Rother, C.
- Kolmogorov, V.
- Torr, P.
|
| http://linked.open...n/vavai/riv/zamer
| |
| http://localhost/t...ganizacniJednotka
| |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)