Quadratic pseudo-Boolean optimization
Quadratic pseudo-Boolean optimisation (QPBO) is a combinatorial optimization method for quadratic pseudo-Boolean functions in the form in the binary variables , with . If is submodular then QPBO produces a global optimum equivalently to graph cut optimization, while if contains non-submodular terms then the algorithm produces a partial solution with specific optimality properties, in both cases in polynomial time.
Wikipage redirect
Link from a Wikipage to another Wikipage
seeAlso
primaryTopic
Quadratic pseudo-Boolean optimization
Quadratic pseudo-Boolean optimisation (QPBO) is a combinatorial optimization method for quadratic pseudo-Boolean functions in the form in the binary variables , with . If is submodular then QPBO produces a global optimum equivalently to graph cut optimization, while if contains non-submodular terms then the algorithm produces a partial solution with specific optimality properties, in both cases in polynomial time.
has abstract
Quadratic pseudo-Boolean optim ...... mentation and stereo matching.
@en
Link from a Wikipage to an external page
Wikipage page ID
59,654,519
page length (characters) of wiki page
Wikipage revision ID
1,026,310,236
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Quadratic pseudo-Boolean optim ...... both cases in polynomial time.
@en
label
Quadratic pseudo-Boolean optimization
@en