en-de
en-es
en-fr
en-sl
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
Graphical Models, Variational Methods, and Message-Passing
Published on Feb 25, 200729906 Views
Related categories
Chapter list
Graphical models, message-passing algorithms, and<br>variational methods: Part I00:05
Introduction01:06
Some broad questions02:26
Outline05:35
Example: Hidden Markov models06:16
Example: Image processing and computer vision (I)09:53
Example: Computer vision (II)14:03
Stereo pairs: Dom St. Stephan, Passau14:27
Example: Graphical codes for communication17:15
Graphical codes and decoding (continued)20:31
Outline20:39
Undirected graphical models (Markov random fields)21:21
Factorization and Markov properties23:27
Illustrative example: Ising/Potts model for images28:23
Directed graphical models29:52
Illustrative example: Hidden Markov model (HMM)32:11
Factor graph representations33:02
Representational equivalence: Factorization and<br> Markov property43:43
Outline46:33
Computational problems of interest47:52
Elimination algorithm (I)52:17
Elimination algorithm (II;A)54:42
Elimination algorithm (II;B)55:21
Elimination algorithm (III)55:48
Elimination algorithm (IV)55:52
Elimination algorithm (V)56:00
Summary of elimination algorithm59:15
Sum-product algorithm on (junction) trees01:02:52
Sum-product on trees (I)01:09:02
Sum-product on trees (II)01:12:46
Sum-product on trees (III)01:13:03
Summary: sum-product algorithm on a tree01:13:11
Max-product algorithm on trees (I)01:14:48