Title :
Entropy estimates for simple random fields
Author :
Forchhammer, Søren ; Justesen, J.
Author_Institution :
Inst. of Telecommun., Tech. Univ. Lyngby, Denmark
Abstract :
We consider the problem of determining the maximum entropy of a discrete random field on a lattice subject to certain local constraints on symbol configurations. The results are expected to be of interest in the analysis of digitized images and two dimensional codes. We shall present some examples of binary and ternary fields with simple constraints. Exact results on the entropies are known only in a few cases, but we shall present close bounds and estimates that are computationally efficient
Keywords :
Markov processes; codes; computational complexity; estimation theory; image processing; maximum entropy methods; random processes; Markov chains; binary fields; close bounds; computational efficiency; digitized images; discrete random field; entropy estimates; lattice; maximum entropy; simple random fields; stationary fields; symbol configurations; ternary fields; two dimensional codes; Data compression; Entropy; Image analysis; Lattices; Probability distribution; Random variables; State estimation; Upper bound;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.535764
