← 返回卡片

原书出处

Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)

核验版本的摘录快照 · 导入于 2026-11-14T15:40:56.555Z

The BP message update rules only work to give the exact marginals when the topology of the network is that of a tree or a chain. In general, one can show that exact computation of marginal probabilities for graphs with loops depends on a graph-theoretic quantity known as the treewidth of the graph [274]. For many graphical models of interest in vision, such as 2D

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c029.xhtml

EPUB SHA-256:60a7eebc43f5d9a675d776fed3736fbdaa791e55877023f2f8cba016a9b384f8