Understanding Belief Propagation and its Applications - PowerPoint PPT Presentation

1 / 14
About This Presentation
Title:

Understanding Belief Propagation and its Applications

Description:

Title: Understanding Belief Propagation and its Applications Author: School of Engineering Last modified by: School of Engineering Created Date: 6/9/2004 3:41:43 AM – PowerPoint PPT presentation

Number of Views:116
Avg rating:3.0/5.0
Slides: 15
Provided by: SchoolofE97
Category:

less

Transcript and Presenter's Notes

Title: Understanding Belief Propagation and its Applications


1
Understanding Belief Propagation and its
Applications
  • Dan Yuan
  • June 2004

2
Outline
  • Motivation
  • Rationale
  • Applications

3
Probabilistic Inference
  • Directed GraphBayesian Network
  • Undirected Graph Markov Random Field
  • NP-hard Problem Computing the a posteriori
    beliefs of RVs in both of these graphs

4
Solutions
  • Approximate Inference
  • MCMC Sampling
  • Belief Propagation

5
Parameterization and conditioning in Undirected
Graph
  • The Joint Probability

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
6
Parameterization and conditioning in Undirected
Graph with a Loop
  • Formulation

Why do we care about loopy graphs?
7
Probability Propagation
  • The max-product update

where denotes a normalizing constant and
means all nodes neighboring except .
8
Probability 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.

9
Relation 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.

10
Applications 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

11
Experiments
  • Noise Removal
  • Image segmentation Enhancement

12
Resultsnoise removal
  • Pepper and salt

White gaussian
13
ResultsImage Segmentation Enhancement
14
Questions?
  • Thanks
Write a Comment
User Comments (0)
About PowerShow.com