Entropy estimates for simple random fields

Søren Forchhammer; Jørn Justesen

doi:10.1109/ISIT.1995.535764

Entropy estimates for simple random fields

Søren Forchhammer, Jørn Justesen

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

378 Downloads (Pure)

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

Original language	English
Title of host publication	Proceedings of the IEEE International Symposium on Information Theory
Publisher	IEEE
Publication date	1995
Pages	249-249
ISBN (Print)	07-80-32453-6
DOIs	https://doi.org/10.1109/ISIT.1995.535764
Publication status	Published - 1995
Event	1995 IEEE International Symposium on Information Theory - Whistler, Canada Duration: 17 Sept 1995 → 22 Sept 1995 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4005

Conference

Conference	1995 IEEE International Symposium on Information Theory
Country/Territory	Canada
City	Whistler
Period	17/09/1995 → 22/09/1995
Internet address	http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4005

Bibliographical note

Copyright: 1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Access to Document

10.1109/ISIT.1995.535764

ForchhammerFinal published version, 131 KB

OpenUrl availability

Full text

Cite this

@inproceedings{d11f89f3660446299ee8f16a021e9547,

title = "Entropy estimates for simple random fields",

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",

author = "S{\o}ren Forchhammer and J{\o}rn Justesen",

note = "Copyright: 1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE; 1995 IEEE International Symposium on Information Theory, ISIT 1995 ; Conference date: 17-09-1995 Through 22-09-1995",

year = "1995",

doi = "10.1109/ISIT.1995.535764",

language = "English",

isbn = "07-80-32453-6",

pages = "249--249",

booktitle = "Proceedings of the IEEE International Symposium on Information Theory",

publisher = "IEEE",

address = "United States",

url = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4005",

}

TY - GEN

T1 - Entropy estimates for simple random fields

AU - Forchhammer, Søren

AU - Justesen, Jørn

N1 - Copyright: 1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

PY - 1995

Y1 - 1995

N2 - 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

AB - 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

U2 - 10.1109/ISIT.1995.535764

DO - 10.1109/ISIT.1995.535764

M3 - Article in proceedings

SN - 07-80-32453-6

SP - 249

EP - 249

BT - Proceedings of the IEEE International Symposium on Information Theory

PB - IEEE

T2 - 1995 IEEE International Symposium on Information Theory

Y2 - 17 September 1995 through 22 September 1995

ER -

Entropy estimates for simple random fields

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this