• DocumentCode
    2992408
  • Title

    Extending models for two-dimensional constraints

  • Author

    Forchhammer, SØren

  • Author_Institution
    Dept. of Photonics Eng., Tech. Univ. of Denmark, Lyngby, Denmark
  • fYear
    2009
  • fDate
    June 28 2009-July 3 2009
  • Firstpage
    1055
  • Lastpage
    1059
  • Abstract
    Random fields in two dimensions may be specified on 2 times 2 elements such that the probabilities of finite configurations and the entropy may be calculated explicitly. The Pickard random field is one example where probability of a new (non-boundary) element is conditioned on three previous elements. To extend the concept we consider extending such a field such that a vector or block of elements is conditioned on a larger set of previous elements. Given a stationary model defined on 2 times 2 elements, iterative scaling is used to define the extended model. The extended model may be used for models of two-dimensional constraints and as examples we apply it to the hard-square constraint and the no isolated bits (n.i.b) constraint. The iterative scaling can ensure that the entropy of the extension is optimized and that the entropy is increased compared to the initial model defined on 2 times 2 elements. Application to a simple stationary model with hidden states is also outlined. For the n.i.b constraint, the initial model is based on elements defined by blocks of (1 times 2) binary symbols.
  • Keywords
    entropy; iterative methods; probability; random processes; Pickard random field; binary symbol; entropy; hard-square constraint model; iterative scaling; probability; stationary model; two-dimensional constraint model; Entropy; Iterative algorithms; Markov random fields; Photonics; Probability distribution;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2009. ISIT 2009. IEEE International Symposium on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-4312-3
  • Electronic_ISBN
    978-1-4244-4313-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2009.5206052
  • Filename
    5206052