Title: Understanding Belief Propagation and its Applications
1Understanding Belief Propagation and its
Applications
2Outline
- Motivation
- Rationale
- Applications
3Probabilistic Inference
- Directed GraphBayesian Network
- Undirected Graph Markov Random Field
- NP-hard Problem Computing the a posteriori
beliefs of RVs in both of these graphs
4Solutions
- Approximate Inference
- MCMC Sampling
- Belief Propagation
5Parameterization and conditioning in Undirected
Graph
where Z is a normalizing constant
There is a cost named compatibility on each link
between two neighboring nodes. We assume only the
pair-wise compatibility between two nodes.
P can be thought of as factoring into five
multiplicative potential functions
6Parameterization and conditioning in Undirected
Graph with a Loop
Why do we care about loopy graphs?
7Probability Propagation
where denotes a normalizing constant and
means all nodes neighboring except .
8Probability Propagation (Contd)
- The algorithm converges to a unique fixed belief
regardless of initial conditions in a finite
number of iterations. - At convergence, the belief for any value of a
node i is the maximum of the posterior,
conditioned on that node having the value - Define the max-product assignment ,
- by (assuming a unique
maximizing value exists). Then is the MAP
assignment.
9Relation to Junction Tree Algorithm
- Transformation from a general graph to a junction
tree, and BP on the junction tree is equivalent
to that on the original graph. - Transformation is too complicated when the
original graph is very loopy.
10Applications of BP in Computer Vision
- Unwrapping phase imagesFrey, NIPS
- Stereo matching Sun,ECCV
- Shape and reflectance inference from photograph
Weiss, ICCV - Image detail extrapolating Freeman, IJCV
11Experiments
- Noise Removal
- Image segmentation Enhancement
12Resultsnoise removal
White gaussian
13ResultsImage Segmentation Enhancement
14Questions?