Monday, November 3, 1997
4:00 PM (refreshments 3:45)
Edgerton Hall, Room 34-101
EECS Colloquium
Abstract
A "factor graph" is a bipartite graph that expresses how a global function of several variables factors into a product of "local functions." In this talk, I will describe a general algorithm for computing "marginals" of the global function by distributed message-passing in the corresponding factor graph.
A wide variety of algorithms developed in the artificial intelligence, statistics, signal processing, and digital communications communities can be derived as specific instances of this general algorithm, including Pearl's "belief propagation" algorithm, the Fast Fourier transform, the Viterbi algorithm, the forward/backward algorithm, and the iterative turbo decoding algorithm.
|
Modified: Sep 8, 1997|
Current events|
Your comments
and inquiries are welcome.