知识卡片
树上消息汇集后消去发送态
两两势树的更新为mⱼᵢ(xᵢ)=Σxⱼ ψᵢⱼ(xᵢ,xⱼ) φⱼ(xⱼ)∏k∈邻居(j)除i mₖⱼ(xⱼ)。先乘局部证据和其他邻居消息,再通过相容势对发送状态求和。连续变量用积分替代,局部势必须恰好计入一次。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 概率图模型
原书出处 · 1 处
- · 查看原书依据
1. Multiply together all messages (independent probabilities) coming in to node j, except for the message from node i back to node j, 2. Multiply by the pairwise compatibility function ψij(xi, xj) (also independent of the other multiplicands). 3. Marginalize over the variable xj. These steps are summarized in this equation to compute the message from node j to node i: (29.14) where η(j)\i means
参考来源
- 位置:《Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)》第29章《概率图模型》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c029.xhtml)
- 结论依据:摘录中关于树上消息汇集后消去发送态的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:1. Multiply together all messages (independent probabilities) coming in to node j, except for the message from node i back to node j, 2. Multiply by the pairwise compatibility function ψij(xi, xj) (also independent of the other multiplicands). 3. Marginalize over the variable xj. These steps are summarized in this equation to compute the message from node j to node i: (29.14) where η(j)\i means