About: Quadratic pseudo-Boolean optimization

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Quadratic pseudo-Boolean optimization Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FQuadratic_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.

Attributes	Values
rdfs:label	Quadratic pseudo-Boolean optimisation (it) Quadratic pseudo-Boolean optimization (en)
rdfs:comment	Quadratic pseudo-Boolean optimisation (QPBO) è un metodo di ottimizzazione discreta di funzioni pseudo-booleane quadratiche non submodulari nella forma nelle variabili binarie , con . Se è submodulare QPBO produce un ottimo globale in maniera equivalente a graph cut, mentre se contiene termini non submodulari l'algoritmo produce una soluzione parziale con specifiche proprietà di ottimalità, in entrambi i casi in tempo polinomiale. QPBO è usato nell'inferenza su (MRF) e (CRF), e ha applicazioni in problemi di visione artificiale come segmentazione e . (it) 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. (en)
foaf:depiction
dcterms:subject	Combinatorial optimization Computational problems in graph theory
Wikipage page ID	59654519 (xsd:integer)
Wikipage revision ID	1116600591 (xsd:integer)
Link from a Wikipage to another Wikipage	Pseudo-Boolean function International Conference on Computer Vision Combinatorial optimization Conditional random field Max-flow min-cut theorem GNU General Public License Graph (discrete mathematics) NP-hard Conference on Computer Vision and Pattern Recognition Operations Research Letters MIT license Clique (graph theory) Combinatorial optimization Computer vision Max-flow min-cut theorem Partition of a set Edmonds–Karp algorithm Ford–Fulkerson algorithm Graph cut optimization Binary data Computational problems in graph theory Polynomial time Image segmentation Markov random field IEEE Transactions on Pattern Analysis and Machine Intelligence Stereo cameras dbr:Boykov–Kolmogorov_algorithm
Link from a Wikipage to an external page	https://www.cs.cornell.edu/~afix/Papers/ICCV11.pdf http://www.f.waseda.jp/hfs/software.html http://pub.ist.ac.at/~vnk/software.html%23qpbo https://www.microsoft.com/en-us/research/wp-content/uploads/2007/06/cvpr07-QPBOpi-TR.pdf https://www.cv-foundation.org/openaccess/content_cvpr_2014/papers/Ishikawa_Higher-Order_Clique_Reduction_2014_CVPR_paper.pdf
sameAs	Quadratic pseudo-Boolean optimization Quadratic pseudo-Boolean optimization Quadratic pseudo-Boolean optimization
dbp:wikiPageUsesTemplate	dbt:Cite_conference dbt:Cite_journal dbt:Short_description
thumbnail	wiki-commons:Special:FilePath/Qpbo.svg?width=300
has abstract	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. QPBO is a useful tool for inference on Markov random fields and conditional random fields, and has applications in computer vision problems such as image segmentation and stereo matching. (en) Quadratic pseudo-Boolean optimisation (QPBO) è un metodo di ottimizzazione discreta di funzioni pseudo-booleane quadratiche non submodulari nella forma nelle variabili binarie , con . Se è submodulare QPBO produce un ottimo globale in maniera equivalente a graph cut, mentre se contiene termini non submodulari l'algoritmo produce una soluzione parziale con specifiche proprietà di ottimalità, in entrambi i casi in tempo polinomiale. QPBO è usato nell'inferenza su (MRF) e (CRF), e ha applicazioni in problemi di visione artificiale come segmentazione e . (it)
prov:wasDerivedFrom	wikipedia-en:Quadratic_pseudo-Boolean_optimization?oldid=1116600591&ns=0
page length (characters) of wiki page	12542 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Quadratic_pseudo-Boolean_optimization
is rdfs:seeAlso of	Graph cut optimization
is Link from a Wikipage to another Wikipage of	Pseudo-Boolean function QPBO
is Wikipage redirect of	QPBO
is foaf:primaryTopic of	wikipedia-en:Quadratic_pseudo-Boolean_optimization

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3332 as of Feb 27 2025, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 45 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software