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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Since original HMMs were designed as one-dimensional Markov chains with firstorder<br />

neighborhood systems, it cannot directly be used in two-dimensional problems<br />

such as image segmentation. A special case <strong>of</strong> an HMM, in which the underlying<br />

stochastic process is an MRF instead <strong>of</strong> a Markov chain, is referred to as a <strong>hidden</strong><br />

Markov random field model (Zhang et al., 2001). Mathematically, an HMRF model<br />

is characterized by the following:<br />

• Hidden Markov Random Field (HMRF)<br />

The random field X = { X ( s)<br />

: s ∈ S}<br />

is an underlying HMRF assuming values in<br />

a finite state space L = ( 1,...., )<br />

with probability distribution π . The state <strong>of</strong> X<br />

is unobservable.<br />

• Observable Random Field<br />

Y = { Y ( s)<br />

: s ∈S}<br />

is a random field with a finite state space D = ( 1,..., d)<br />

. Given<br />

any particular configuration<br />

x ∈ χ , every Y () s follows a known conditional<br />

probability distribution py ( ( s) | x( s )) <strong>of</strong> the same functional <strong>for</strong>m f( y( s); θ<br />

x( s)<br />

),<br />

where θ<br />

x( s)<br />

are the involved parameters. This distribution is called the emission<br />

probability function and Y is also referred to as the emitted random field.<br />

• Conditional Independence<br />

For any<br />

x ∈ χ , the random variables Y ( s ) are conditional independent<br />

∑<br />

p ( y | x)<br />

= p(<br />

y(<br />

s)<br />

| x(<br />

s)).<br />

Based on the above, the joint probability <strong>of</strong> ( X , Y)<br />

can be written as<br />

∑<br />

s∈S<br />

s∈S<br />

p ( y , x)<br />

= p(<br />

y | x)<br />

p(<br />

x)<br />

= p(<br />

x)<br />

p(<br />

y(<br />

s)<br />

| x(<br />

s)).<br />

27

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

Saved successfully!

Ooh no, something went wrong!