Stochastic cellular automata with Gibbsian invariant measures

A geometric characterization is given of a class of stochastic cellular automata, whose invariant probability measures are Gibbsian distributions (i.e. Markovian random fields). This class, whose members may be considered as the Cartesian product of convex polytopes with a finite number of vertices....

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 37; no. 3; pp. 541 - 551
Main Authors Marroquin, J.L., Ramirez, A.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.05.1991
Institute of Electrical and Electronics Engineers
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:A geometric characterization is given of a class of stochastic cellular automata, whose invariant probability measures are Gibbsian distributions (i.e. Markovian random fields). This class, whose members may be considered as the Cartesian product of convex polytopes with a finite number of vertices. contains all known automata of this type (e.g., the Metropolis, Gibbs sampler, and heat bath algorithms), and also a new family, which is characterized by having nonreversible dynamic behavior. The fact that there is a complete geometric structure, instead of isolated points, opens the possibility of using classical techniques (such as convex programming) for the design of optimal automata. Some examples of applications are given, oriented towards the solution of image restoration problems.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.79910