02.09.2014 Views

multivariate poisson hidden markov models for analysis of spatial ...

multivariate poisson hidden markov models for analysis of spatial ...

multivariate poisson hidden markov models for analysis of spatial ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Now consider a random field { X ( s) : s∈S } defined on S , that is, a collection X (s)<br />

<strong>of</strong><br />

random variables indexed by sites in S . These random variables are assumed to take<br />

their values in a finite set χ , the state space. Some examples <strong>of</strong> χ are χ = { −1,<br />

+ 1}<br />

and<br />

χ = { 1,2,..., r}.<br />

The set χ S is the set <strong>of</strong> elements <strong>of</strong> the <strong>for</strong>m x= { x( s) : s∈S}<br />

with<br />

x(<br />

s)<br />

∈χ <strong>for</strong> each s. An element <strong>of</strong><br />

S<br />

χ will <strong>of</strong>ten called as a configuration (<strong>of</strong> the random<br />

field). Also <strong>of</strong>ten we can simply write this as X <strong>for</strong> { X ( s) : s∈S } and think <strong>of</strong> X as a<br />

random variable with values in χ S , the set <strong>of</strong> configurations. Letting | S | denote the<br />

number <strong>of</strong> elements <strong>of</strong> S and similarly <strong>for</strong> χ , the number <strong>of</strong> elements <strong>of</strong> the<br />

configuration space χ S is<br />

|<br />

| S|<br />

χ | and it is hence <strong>of</strong>ten extremely large. For example, if<br />

χ = { −1,<br />

+ 1} and S is a lattice <strong>of</strong> size 128× 128, its size is<br />

2<br />

128<br />

2 . If A is a subset <strong>of</strong> S ,<br />

write X ( A ) <strong>for</strong> { X ( s) : s∈<br />

A } , that is the collection <strong>of</strong> random variables on A , and<br />

similarly <strong>for</strong> a particular configuration x= { x( s) : s∈S }. The symbol \ denotes setdifference;<br />

<strong>for</strong> example, S \ { s}<br />

is the set <strong>of</strong> sites in S except s , and write this difference<br />

as<br />

S \ s . Now the random field { X ( s) : s∈S}<br />

is a Markov random field (MRF) on<br />

S (with respect to the given neighbourhood structure) if<br />

PX [ ( s) = x( s)| X( S\ s) = x( S\ s)] = PX [ ( s) = x( s)| X( Ν ) = x( Ν )] <strong>for</strong> all sites s ∈ S<br />

S<br />

and all configurations x ∈χ . In other words, the distribution <strong>of</strong> X ( s ) , given all other<br />

sites, depends at the realized values in its neighbourhood only. These conditional<br />

distributions are <strong>of</strong>ten called the local specification <strong>of</strong> the MRF. Two examples are<br />

presented to get an idea <strong>of</strong> different MRF:<br />

s<br />

s<br />

23

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!