Showing papers on "Markov random field published in 1973"
••
01 Jan 1973146 citations
••
TL;DR: The current paper shows that a MRF is a GRF and vice versa even when (i)−(v) are relaxed, i.e., even if one relaxes translation invariance, replaces first order bykth order, allows for many states and replaces finite domains of Zv by arbitrary finite sets.
Abstract: Spitzer has shown that every Markov random field (MRF) is a Gibbs random field (GRF) and vice versa when (i) both are translation invariant, (ii) the MRF is of first order, and (iii) the GRF is defined by a binary, nearest neighbor potential. In both cases, the field (iv) is defined onZ v, and (v) at anyxeZv, takes on one of two states. The current paper shows that a MRF is a GRF and vice versa even when (i)−(v) are relaxed, i.e., even if one relaxes translation invariance, replaces first order bykth order, allows for many states and replaces finite domains of Zv by arbitrary finite sets. This is achieved at the expense of using a many body rather than a pair potential, which turns out to be natural even in the classical (nearest neighbor) case when Zv is replaced by a triangular lattice.
43 citations
••
TL;DR: It is shown that the set of Markov random fields and Gibbs states with nearest neighbour potentials are the same for any finite graph.
Abstract: It is shown that the set of Markov random fields and Gibbs states with nearest neighbour potentials are the same for any finite graph. The set of Markov random fields is also shown to be the same as the equilibrium states of time-reversible birth/death processes with nearest neighbour interactions defined on the graph.
38 citations
••
01 Jan 197315 citations