A Class of Random Fields on Complete Graphs with Tractable Partition Function.
Boris FlachPublished in: IEEE Trans. Pattern Anal. Mach. Intell. (2013)
Keyphrases
- random fields
- partition function
- markov random field
- maximum entropy
- non stationary
- parameter estimation
- conditional random fields
- closed form
- upper bound
- approximate inference
- probabilistic model
- probability density function
- belief propagation
- importance sampling
- image sequences
- upper and lower bounds
- bayesian framework
- hidden markov models
- maximum likelihood estimation
- similarity measure