Conference paper
Maximizing Entropy of Pickard Random Fields for 2x2 Binary Constraints
This paper considers the problem of maximizing the entropy of two-dimensional (2D) Pickard Random Fields (PRF) subject to constraints. We consider binary Pickard Random Fields, which provides a 2D causal finite context model and use it to define stationary probabilities for 2x2 squares, thus allowing us to calculate the entropy of the field.
All possible binary 2x2 constraints are considered and all constraints are categorized into groups according to their properties. For constraints which can be modeled by a PRF approach and with positive entropy, we characterize and provide statistics of the maximum PRF entropy. As examples, we consider the well known hard square constraint along with a few other constraints.
Language: | English |
---|---|
Publisher: | IEEE |
Year: | 2014 |
Pages: | 2022-2026 |
Proceedings: | 2014 IEEE International Symposium on Information Theory |
Types: | Conference paper |
DOI: | 10.1109/ISIT.2014.6875188 |
ORCIDs: | Forchhammer, Søren |