计算机图像与机器视觉作业.docVIP

第一部分 文献翻译 MITSUBISHI ELECTRIC RESEARCH LABORATORIES 三菱电子研究实验室 Bethe free energy, Kikuchi approximations,and belief propagation algorithms 贝特自由能量，菊池近似与BP算法 Abstract This is an updated and expanded version of TR2000-26, but it is still in draft form. Belief propagation (BP) was only supposed to work for tree-like networks but works surprisingly well in many applications involving networks with loops, including turbo codes. However, there has been little understanding of the algorithm or the nature of the solutions it finds for general graphs. 摘要 本文是TR2000-26版本的更新和扩展，但仍然是一个草案。 BP算法被认为只能在在树形网络中使用，但是却在别的应用领域如环形网络及Trubo码中表现十分优异。然而，我们对于算法或者是解决一般问题的方法的本质知之甚少。 We show that BP can only converge to a stationary point of an approximate free energy, known as the Bethe free energy in statistical physics. This result characterizes BP fixed-points and makes connections with variational approaches to approximate Inference. 我们知道置信传播算法只能收敛到一个近似自由固定点，被称为贝特自由能。 More importantly, our analysis lets us build on the progress made in statistical physics since Bethe’s approximation was introduced in 1935. Kikuchi and others have shown how to construct more accurate free energy approximations, of which Bethe’s approximation is the simplest. Exploiting the insights from our analysis, we derive generalized belief propagation (GBP) versions of these Kikuchi approximations. These new message passing algorithms can be significantly more accurate than ordinary BP, at an adjustable increase in complexity. We illustrate such a new GBP algorithm on a grid Markov network and show that it gives much more accurate marginal probabilities than those found using ordinary BP. 更为重要的是，自从1935年发现贝特近似方法，我们的分析让我们在统计物理学中获得进展。菊池和其他人已经展示了如何建立更精确的自由近似能量，其中贝特近似是最简单的方法。基于我们之前的分析，我们得到了这些菊池近似的广义置信传播算法。在复杂度可向上调节的情况下，这些新的消息传递算法比普通置信传播算法更加精确。我们解释了这样一个在网格马尔科夫网络上的新广义置信传播算法，并且展示了它比普通置信传播算法可以给出更多更为精确的边缘概率。 1 引言 原有的比如Pearl引入的置信传播算法的确可以在树状图模型中传递正确的边缘概率。对于一般的环形网络，这种情形变的更加不明朗。一方面，一些研究者已经证明将置信传播算法应用在环形网络中会有好的表现。一个戏剧性的例子就是Tur