Inference: MAP with Graph Cuts3.7.7-MAPwithGraphCuts.flvMAPwithGraphCuts_quiz13.7.7-quiz1.jpg32
vertLeftWhite1
MAPwithGraphCuts_quiz23.7.7-quiz2.jpg12
vertLeftWhite1_2c
MAPwithGraphCuts_quiz33.7.7-quiz3.jpg42
block2x2White1
Clique tree inference can be intractable if the MRF is too connected and the resulting tree width is too large. Cluster graph inference isn't guaranteed to converge or find a globally consistent solution, regardless of the exactness issue. Move making algorithms that we've seen can't guarantee finding the optimal solution. This is a special case that can specifically be solved exactly with a min-cut algorithm, which runs in polynomial time.