Approximate recursive calculations of discrete Markov random fields
In this thesis we present an approximate recursive algorithm for calculations of discrete Markov random fields defined on graphs. We write the probability distribution of a Markov random field as a function of interaction parameters, a representation well suited for approximations. The algorithm we...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Norges teknisk-naturvitenskapelige universitet, Institutt for matematiske fag
2010
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10806 |