Escolar Documentos
Profissional Documentos
Cultura Documentos
Meryem Ameur
30 March 2017
1 Introduction
3 Iterative Estimators
4 Experimental Results
5 Conclusion
Where :
P(X |Y ) : is the probability of a posteriori law X knows Y .
P(X ) : is the probability of the a priori law .
P(Y |X ) : is the probability of the attached data law.
P(Y ) : is a constant of normalization P(Y ) = 1.
1 (yn i )2
f =p exp[ ] (4)
2(i2 ) (i2 )
Conguration initial of X 0 by :
I K-means.
I FCM....
Initialization parameters of the X process x0 .
I PI (i)0 .
I A(i, j)0 .
Initialization parameters of the data attached law y0|x .
I (i)0 .
I ((i)2 )0 .
Forward Algorithm
1 Initialization : (n = 1)
PI (i)fi (y1 )
1 (i) = P i (5)
j PI (i)fj (y1 )
2 Induction : (n > 1)
P
fi (yn+1 ) j n (j)A(i, j)
n (i) = P P i (6)
k fk (yn+1 ) j n (j)A(i, j)
2 Induction : (n < N)
P
j A(i, j)fj (yn+1 )n+1 (j)
n (i) = P P i, j (8)
k fk (yn+1 ) j n (j)A(i, j)
EM Algorithm
For a number of iteration q Q :
Step(E ) :
I Calculate n (i), n (i), n (i, j) and n (i), using Baum Welch.
Step(M ) :
[q]
I Estimate parameters of the Markov chain x using the deterministic
strategy.
Estimate parameters of law attached data y[q]|x for each class i also by
the deterministic strategy.
PN
1 yn n (i)
[q]
i = Pn=
N
i (13)
n=1 n (i)
PN [q] 2
2 [q] n=1 (yn i ) n (i)
(i ) = PN i (14)
n=1 n (i)
ICE Algorithm
For each iteration q Q :
Calculate n (i), n (i), n (i, j) and n (i), using Baum Welch.
Simulate a sample of X q for one random simulation using the
parameters of the iteration q
PN
1 n (i, j)
A(i, j) [q]
= Pn=
N
i, j (16)
n=1 n (i)
Task ICE EM
Calculate O(K 2 N) O(K 2 N)
Calculate O(K 2 N) O(K 2 N)
Calculate O(K 2 N) O(K 2 N)
Calculate O(KN) O(KN)
Calculate PI O(K ) O(K )
Calculate A O(K 2 N) O(K 2 N)
Calculate O(KN) O(KN)
Calculate 2 O(KN) O(KN)
Simulate X O(KN) not executable
Table: Complexity of EM and ICE algorithms
From this table, we notice that the complexity of ICE is superior than the
complexity of EM. Because, ICE simulates the hidden process X one time
in each iteration q Q . This task makes ICE more complex than EM.
Meryem Ameur Markovian Segmentation (Laboratory of Information
30 MarchProcessing
2017 21
and/ Decis
33
Final Decision phase
Figure: Experiment 1
Figure: Experiment 2
Figure: Experiment 3
Experiments ICE EM
Experiment 1 5 iterations 7 iterations
Experiment 2 6 iterations 8 iterations
Experiment 3 7 iterations 8 iterations
Table: The convergence of ICE and EM algorithms
Perspectives
Using these estimator algorithms to :
1 Segment color textured images using a pairewise Markov chain model.
2 Segment the MRI images using the triplet Markov chain, considering
that X is non stationary.