Talk:Belief propagation
From Wikipedia, the free encyclopedia
&uotThe use of factor graphs in the description of the algorithm seems weaker than the approach taken by Yedidia et al in [1]. At least the one taken here is less clear.
- In fact, factor graphs are more general than pairwise Markov random fields, the model used by Yedidia in the technical report to which you make reference. For instance, see a more recent technical report by Yedidia et al. in [2]. It's also not hard to see how belief propagation in the pairwise MRF setting can be converted to BP in the factor graph setting. Ikcotyck 01:50, 26 July 2005 (UTC)
What is this article by Lauritzen and Spiegelhalter in 1986? I only know of one in 1988 called ;Local Computation with Probabilities in Graphical Structures and Their Applications to Expert Systems"
- Hmm.. That's the article I know as well, I can't remember why I put 1986. Ikcotyck
There is a reference to the "diameter of the tree" in the general graphs section which doesn't help since it doesn't mention trees. maddanio
It is mentioned that Belief Propagation and Sum-Product are equivalent. This is wrong! What is true is that BP can be formulated as a special case of SP. Please consult Bishop in Pattern Recognition Machine learning, page 403. Gugux (talk) 00:08, 12 March 2008 (UTC)
[edit] Computer vision category
I removed this article from the computer vision category. BP is probably not unrelated to CV but
- It is not a methodology developed within CV or specific to CV
- There is no material in this article which relates it to CV.
--KYN 22:15, 27 July 2007 (UTC)
- That's true. Perhaps I can work in some computer vision-related material... Iknowyourider (t c) 23:26, 27 July 2007 (UTC)
