•Belief
Propagation.
–At each step, a site collects information from neighbors on their probable labeling. Passes info to each neighbor based on info from other neighbors (avoids repeating to neighbor what that neighbor has told.
–In graph with no loops, like dynamic programming, forward-backward method.
–In general MRF,
heuristic (that has been analyzed). (eg., Yedidia, Freeman and Weiss).