Block Pickard Models for Two-Dimensional Constraints

Søren Forchhammer; Jørn Justesen

doi:10.1109/TIT.2009.2027505

Block Pickard Models for Two-Dimensional Constraints

Søren Forchhammer
, Jørn Justesen

Research output: Contribution to journal › Journal article › Research › peer-review

726 Downloads (Orbit)

Abstract

In Pickard random fields (PRF), the probabilities of finite configurations and the entropy of the field can be calculated explicitly, but only very simple structures can be incorporated into such a field. Given two Markov chains describing a boundary, an algorithm is presented which determines whether a PRF consistent with the distribution on the boundary and a 2-D constraint exists. Iterative scaling is used as part of the algorithm, which also determines the conditional probabilities yielding the maximum entropy for the given boundary description if a solution exists. A PRF is defined for the domino tiling constraint represented by a quaternary alphabet. PRF models are also presented for higher order constraints, including the no isolated bits (n.i.b.) constraint, and a minimum distance 3 constraint by defining super symbols on blocks of binary symbols.

Original language	English
Journal	I E E E Transactions on Information Theory
Volume	55
Issue number	10
Pages (from-to)	4626-4634
ISSN	0018-9448
DOIs	https://doi.org/10.1109/TIT.2009.2027505
Publication status	Published - 2009

Bibliographical note

Copyright: 2009 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/TIT.2009.2027505

ForchhammerFinal published version, 195 KB

OpenUrl availability

Check availability in DTU Findit

Cite this

@article{727f24f61ab44e25acb25a19358d2dbb,

title = "Block Pickard Models for Two-Dimensional Constraints",

abstract = "In Pickard random fields (PRF), the probabilities of finite configurations and the entropy of the field can be calculated explicitly, but only very simple structures can be incorporated into such a field. Given two Markov chains describing a boundary, an algorithm is presented which determines whether a PRF consistent with the distribution on the boundary and a 2-D constraint exists. Iterative scaling is used as part of the algorithm, which also determines the conditional probabilities yielding the maximum entropy for the given boundary description if a solution exists. A PRF is defined for the domino tiling constraint represented by a quaternary alphabet. PRF models are also presented for higher order constraints, including the no isolated bits (n.i.b.) constraint, and a minimum distance 3 constraint by defining super symbols on blocks of binary symbols.",

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

note = "Copyright: 2009 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",

year = "2009",

doi = "10.1109/TIT.2009.2027505",

language = "English",

volume = "55",

pages = "4626--4634",

journal = "I E E E Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - Block Pickard Models for Two-Dimensional Constraints

AU - Forchhammer, Søren

AU - Justesen, Jørn

N1 - Copyright: 2009 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 - 2009

Y1 - 2009

N2 - In Pickard random fields (PRF), the probabilities of finite configurations and the entropy of the field can be calculated explicitly, but only very simple structures can be incorporated into such a field. Given two Markov chains describing a boundary, an algorithm is presented which determines whether a PRF consistent with the distribution on the boundary and a 2-D constraint exists. Iterative scaling is used as part of the algorithm, which also determines the conditional probabilities yielding the maximum entropy for the given boundary description if a solution exists. A PRF is defined for the domino tiling constraint represented by a quaternary alphabet. PRF models are also presented for higher order constraints, including the no isolated bits (n.i.b.) constraint, and a minimum distance 3 constraint by defining super symbols on blocks of binary symbols.

AB - In Pickard random fields (PRF), the probabilities of finite configurations and the entropy of the field can be calculated explicitly, but only very simple structures can be incorporated into such a field. Given two Markov chains describing a boundary, an algorithm is presented which determines whether a PRF consistent with the distribution on the boundary and a 2-D constraint exists. Iterative scaling is used as part of the algorithm, which also determines the conditional probabilities yielding the maximum entropy for the given boundary description if a solution exists. A PRF is defined for the domino tiling constraint represented by a quaternary alphabet. PRF models are also presented for higher order constraints, including the no isolated bits (n.i.b.) constraint, and a minimum distance 3 constraint by defining super symbols on blocks of binary symbols.

U2 - 10.1109/TIT.2009.2027505

DO - 10.1109/TIT.2009.2027505

M3 - Journal article

SN - 0018-9448

VL - 55

SP - 4626

EP - 4634

JO - I E E E Transactions on Information Theory

JF - I E E E Transactions on Information Theory

IS - 10

ER -

Block Pickard Models for Two-Dimensional Constraints

Abstract

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this