Approximate MRF Inference Using Bounded Treewidth Subgraphs.

Alexander Fix Joyce Chen Endre Boros Ramin Zabih

Published in: ECCV (1) (2012)

Keyphrases

bounded treewidth
np complete
markov random field
relational learning
highly parallelizable
dual decomposition
conjunctive queries
decision problems
graph cuts
boolean functions
special case
image segmentation
data complexity
database
bayesian inference
pairwise
natural language