next up previous



Markov Random Fields


Network description

Network : set S of sites si , i.e., the nodes.

Neighboring system : \(V_s=\{t\in S\}~tels~ que~\left\{\begin{array}{l}s \notin V_s
\\ t\in V_s \Rightarrow s\in V_t\\ \end{array}\right.\) , and : $V=\{V_s, s\in S\}$

Clique : singleton or set of neighbor sites.

Markov field

X is a Markov Random Field (MRF) relatively to V

if and only if

\begin{displaymath}\forall s \in S, P(X_s=x_s \vert X_t=x_t, t\in S-\{s\}) = P(X_s=x_s \vert X_t=x_t, t\in
V_s)
\end{displaymath}

Gibbs field

Field whose probability is a Gibbs measure :


\begin{displaymath}P(X=x)=\frac{1}{Z}\exp(-U(x))\end{displaymath}

    with \(U(x)=\sum_{c \in C} U_c (x)\) the associated energy,
              Z normalizing constant (partition fonction).

Hammersley-Clifford Theorem

X is a MRF relatively to V and \(\forall x \in
\Omega ~,~P(X=x)>0\)

\(\Leftrightarrow \)

X is a Gibbs field whose energy U is associated to V.


next up previous


Guillaume Rellier
1999-11-10