here. However a version of this was presented in (En-
gan et al., 2013a) together with some early results on
segmenting the epicardium (block 4). The main fo-
cus of this paper is block 5, segmentation of the en-
docardium. The algorithm is shown and some results
comparing with watershed segmentation of the blood-
pool is presented in the results section.
In the following, let f
i
(x), i = 1 . .. N
slice
represent
the left ventricle short axis LGE-CMR images of a
patient. x = [x
row
x
column
]
T
is the pixel position, and i
represents the slice number.
2.1 Probability Map
The LGE-CMR images are hard to segment because
the scars are bright, whereas the muscle is dark, the
scars have similar intensity levels as the blood pool in-
side the endocardium border, and the edges are some
places non-exsisting. The reason why an expert cardi-
ologist is capable of segmenting the images manually
is that the cardiologist will automatically use prior in-
formation of typical shapes and sizes of a heart. In
the left ventricle short axis view the myocardium will
more or less have the shape of a ring, and this infor-
mation has to be utilized.
We propose to use a rough a priori model of the
myocardium around the heart center for each slice im-
posed as a gaussian in the polar domain with the heart
center as the origin for all angles. µ of the gaussian
prior will correspond to the approximated radius at
the middle of the myocardium for that slice, and is
varied with the slice number. Typical values are found
from a training set, but a large variance is used in the
gaussian prior to make the a priori model robust. Af-
ter mapping to cartesian coordinates and scaling all
pixels to be within [0, 1], this gives an a priori proba-
bility map, where the probability is seen as the prob-
ability for being a pixel in the myocardium.
Using the a priori probability model as input, we
propose an iterative approach to refine the model and
make an a posteriori probability map for the my-
ocardium. At each iteration the probability model
is combined with the inverse of the original (prepro-
cessed) slices, a low pass filtering over the neighbor-
ing slices is performed, and the output is a new prob-
ability model. The inverse of the original is used be-
cause the myocardial muscle we want to segment ap-
pears dark in the images, and thus appears bright with
high values in the inverse. The algorithm is depicted
in Algorithm 1, and a brief explanation follows.
In line (3) of Algorithm 1, a morphological noise
removal of the original slices, f
i
is conducted using
the morphological center, as defined in (Soille, 2003),
and the structuring element B
mc
as a square of size
Algorithm 1: Iterative probability map algo-
rithm.
Data: CMR images f
i
(x) ∈ R
N×M
, Prior prob.
map p
i
0
(x) ∈ R
N×M
i = 1, . . . N
slice
,
Result: Posteriori prob. map,
p
i
post
(x) ∈ R
N×M
, i = 1, . . . N
slice
1 initialization: k
f inal
;
2 for i ← 1 to N
slice
do
3 f
i
prep
(x) ← β
B
mc
( f
i
) ;
4 f
i
inv
(x) =scale(ones(N, M) − f
i
prep
(x));
5 end
6 for k ← 0 to k
f inal
− 1 do
7 f
temp
(x) = p
k
(x) × f
inv
(x);
8 f
temp
(x) ← LP f iltZ( f
temp
(x)) ;
9 p
k+1
(x) ← scale( f
temp
(x));
10 end
11 p
nof
(x) = p
0
(x) × ( f
inv
(x))
k
f inal
;
12 p
post
(x) =
scale(w
1
p
k
f inal
(x) + (1 − w
1
)p
nof
(x));
13 return(p
post
) ;
3 × 3 pixels. The noise removal results in a prepro-
cessed slice, f
i
prep
(x), and the inverse of the prepro-
cessed slice is found in line (4) as f
i
inv
(x). The main it-
eration is done in line 6-10, using the previous proba-
bility map, f
temp
(x) = p
k
(x)× f
inv
(x), Low Pass (LP)
filtering over the slices, LP f iltZ( f
temp
(x)), and sub-
sequenty finding a new probability map, p
k+1
(x) by
scaling the result of the filtering. Another map is
found without filtering over the slices, p
nof
(x), di-
rectly without any iterations as (line 11): p
nof
(x) =
p
0
(x) × ( f
inv
(x))
k
f inal
. The final probability model is
a scaled and weighted sum (line 12) between p
k
f inal
(x)
and p
nof
(x). A × B denotes the Hademard product.
In Figure 3 an example patient is depicted. Top
two rows show the a priori probability map, middle
rows show the a posteriori probability map, and last
two rows shows the original images for this patient.
2.2 Segmentation
The a posteriori probability map looks promising,
but still the segmentation is challenging. The scarred
areas might appear quite dark in the probability im-
ages, thus the probability values can differ signif-
icantly at different angles. Consequently, a global
thresholding technique will not work, regardless of
the chosen threshold. The heart center at each slice,
HC
i
is an important input, and from the heart cen-
ter the probability values at all radii are evaluated at
different angles, θ ∈ [0, 2π] for both epicardium and
SegmentationofLGEnhancedCardiacMRI
49