Arithmetic encoding of Markov random fields

Authors:
Matthew G. Reyes;David L. Neuhoff
Affiliations:
EECS Dept., University of Michigan, Ann Arbor, MI;EECS Dept., University of Michigan, Ann Arbor, MI
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 5
Cited 0

Local conditioning in Bayesian networks

Artificial Intelligence
Introduction to data compression

Introduction to data compression
Introduction to Bayesian Networks

Introduction to Bayesian Networks
Image Analysis, Random Fields and Markov Chain Monte Carlo Methods: A Mathematical Introduction (Stochastic Modelling and Applied Probability)

Image Analysis, Random Fields and Markov Chain Monte Carlo Methods: A Mathematical Introduction (Stochastic Modelling and Applied Probability)
Pattern matching and lossy data compression on random fields

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces methods for losslessly encoding a Markov random field (MRF) with arithmetic coding. The issues are how to choose the pixel scan order and how to produce coding distributions to accompany the pixels. For an MRF based on an acyclic graph, we choose a scan consistent with the graph and use Belief Propagation (BP) to efficiently compute the optimal coding distributions. For an MRF based on a cyclic graph, we use Local Conditioning (LC) to losslessly encode an appropriately chosen scan of a loop cutset, whose removal leaves an acyclic graph whose pixels can be encoded by the previous method. The results include BP-like formulas for LC in an undirected graph and a formula for the complexity of LC in a cyclic graph. As a first application of the methods, preliminary results of applying the method to an Ising model are given.