Keywords

1 Introduction

Ischemic stroke generally manifests as a loss of neurological brain function due to the sudden loss of blood circulation to an area of the brain [15]. It is by far the most common type of stroke and has become to be the most frequent cause of permanent disability in adults worldwide and the third leading cause of death in industrialized countries [17]. Magnetic resonance imaging (MRI) has become the modality of choice for diagnosing and evaluating ischemic stroke in clinic due to its excellent soft tissue contrast and multi-spectral imaging capability [11]. As ischemic stroke lesions usually change over time and remote and secondary changes may also occur in response to the injury, it is therefore necessary to characterize the injury and changes with different acquisition parameters and distinctive spectral signatures [4].

In clinical practice, diffusion weighted imaging (DWI), T1-weighted (T1w) and T2-weighted (T2w) images, and fluid attenuated inversion recovery (FLAIR) images are often used to diagnose ischemic stroke, locate the lesions and monitor their progression [15]. In the acute phase of stroke, DWI is particularly sensitive to detect the anatomical location and infarcted territory of the lesions and reveal differentiation of brain tissues with hyperintense signal [5]. The lesions appear slightly to strongly hyperintense in T2w and FLAIR images for stroke in sub-acute stage, whereas they are decreasingly hyperintense in DWI images and hypointense in T1w images [13]. For chronic ischemic stroke, lesions appear as hyperintense in FLAIR images with some heterogeneity within the lesion due to ongoing gliosis and demyelination [14]. In contrast, intensities of ischemic lesions are hypointense in T1w images for stroke in the more chronic phase [9]. Figure 1 shows an example of intensity characteristics of ischemic stroke lesions that are in the sub-acute phase.

Fig. 1.
figure 1figure 1

Intensity characteristics of ischemic stroke lesion in different imaging modalities. Images come from http://www.isles-challenge.org/.

Above all, early diagnosis of ischemic lesions in multi-spectral magnetic resonance images is particularly important for ischemic stroke prevention and treatment [13]. But it is really challenging for neuro-radiologists to read the images slice-by-slice [18]. Although lesion segmentation is able to rescue radiologists from the labor of image reading, manual segmentation is tedious, time consuming, and prone to intraobserver and interobserver variability [11]. Therefore, a few semi-automatic or automatic segmentation methods have been proposed in the literature [6, 7, 11, 16]. However, due to varieties of possible shapes and locations of ischemic lesions, and noise and intensity inhomogeneity in MR images, segmentation of ischemic lesions is still a challenging task [8].

In this paper, we propose a framework to automatically segment ischemic stroke lesions in multi-spectral images (e.g. DWI, T1w, T2w, and FLAIR). The rest of this paper is organized as follows. The proposed framework is described in Sect. 2. Experimental results and quantitative evaluation are given in Sect. 3. This paper is finally summarized and discussed in Sect. 4.

2 Method

In this paper, we suppose that the input images of different modalities have already been rigidly registered in the same coordinate system and non-brain tissues have already been removed from the images. Lesion segmentation is then performed by the proposed framework which consists of three major steps: (1) preliminary segmentation, (2) segmentation fusion, and (3) boundary refinement. More details will be given in the following subsections.

2.1 Preliminary Segmentation of Lesions and Normal Tissues

Given an image \(I_i\) from the i-th imaging modality, the image characterizes an intrinsic physical property of human brain, which ideally takes a specific intensity for each type of brain tissue (white matter (WM), gray matter (GM), and cerebrospinal fluid (CSF)) and lesion. That is to say, the image \(I_i\) approximately takes distinct constant values \(c_{i1}\), \(c_{i2}\), ..., and \(c_{iN}\) for \(N-1\) brain tissues and the lesions in disjoint regions \(\varOmega _1\), \(\varOmega _2\), ..., and \(\varOmega _N\), i.e.

$$\begin{aligned} I_i(\mathbf{x}) \approx {c_{ij}} \quad \mathrm {for} \quad \mathbf{x}\in \varOmega _j. \end{aligned}$$
(1)

where \(j=1,2,...,N\). Note that the variable i takes all integers in the interval of [1, L] where L is the total number of imaging modalities. It is obvious that intensities in the set \(I_{ij} = \{I_i(\mathbf{x}): \mathbf{x}\in \varOmega _j\}\) form a cluster with the cluster centroid \(m_{ij} \approx {c_{ij}}\). This clustering property indicates that intensities in the image domain \(\varOmega \) can be classified into N clusters.

To classify these intensities, we define

$$\begin{aligned} \mathcal{{F}}_i = \int _\varOmega \sum _{j=1}^N \lambda _{ij} \parallel I_i(\mathbf{x})-c_{ij} \parallel ^2 u_{ij}^q(\mathbf{x})d\mathbf{x} \end{aligned}$$
(2)

where \(\parallel *\parallel \) is the Euclidean distance between measured intensity \(I_i(\mathbf{x})\) and the cluster centroid \(c_{ij}\), q is any real number that is not less than 1, \(\lambda _{i1}\), \(\lambda _{i2}\), ..., \(\lambda _{iN}\) are positive weighting coefficients for the N clusters, and \(u_{ij}(\mathbf{x})\) is the membership function that indicates whether voxel \(\mathbf{x}\) belongs to the j-th tissue. In fact, the smaller parameter \(\lambda _{ij}\) is, the greater the j-cluster is, and vice versa.

It is obvious that the proposed method, which we call weighting suppressed fuzzy c-means, is a generalization of the standard fuzzy c-means. Note that the objective function defined above is the same with standard fuzzy c-means if \(\lambda _{i1}\), \(\lambda _{i2}\), ..., \(\lambda _{iN}\) are all set to be 1. This objective function is minimized when high membership values are assigned to voxels, intensities of which are close to the centroid, and low membership values are assigned to the voxels if they are far from the centroids under the condition \(\sum _{j=1}^N{u_{ij}(\mathbf{x})=1}\) where \(u_{ij}(\mathbf{x})\in {[0,1]}\). For convenience, we represent the constants \(c_{i1}\), \(c_{i2}\), ..., and \(c_{iN}\) with a vector \(\mathbf{{c}}_i=(c_{i1},c_{i2},...,c_{iN})\), the member functions \(u_{i1}\), \(u_{i2}\), ..., and \(u_{iN}\) with a vector \(\mathbf{{u}}_i=(u_{i1},u_{i2},...,u_{iN})\). Thus, the vectors \(\mathbf{{c}}_i\) and \(\mathbf{{u}}_i\) are the variables of the energy function \(\mathcal{{F}}_i\), which can therefore be written as \(\mathcal{{F}}_i(\mathbf{{c}}_i,\mathbf{{u}}_i)\).

Energy minimization of \(\mathcal{{F}}_i(\mathbf{{c}}_i,\mathbf{{u}}_i)\) can be achieved by alternately minimizing it with respect to each of its variables \(\mathbf{{c}}_i\) and \(\mathbf{{u}}_i\). For fixed \(\mathbf{{u}}_i\), we minimize \(\mathcal{{F}}_i(\mathbf{{c}}_i,\mathbf{{u}}_i)\) with respect to \(\mathbf{{c}}_i\) by resolving \(\frac{\partial \mathcal{{F}}_i(\mathbf{{c}}_i,\mathbf{{u}}_i)}{\partial \mathbf{{c}}_i} = \mathbf{0}\) where \(\mathbf{0}\) is the constant vector with value 0. It is obvious that \(\mathcal{{F}}_i(\mathbf{{c}}_i,\mathbf{{u}}_i)\) is minimized at \(\hat{\mathbf{c}}_{i}=(\hat{c}_{i1},\hat{c}_{i2},...,\hat{c}_{iN})\), given by

$$\begin{aligned} \hat{c}_{ij}=\frac{\int _\varOmega I_i(\mathbf{x})u_{ij}^q(\mathbf{x})}{\int _\varOmega u_{ij}^q(\mathbf{x})} \end{aligned}$$
(3)

where \(j=1,2,...,N\).

For the case \(q>1\), it can be shown that \(\mathcal{{F}}_i(\mathbf{{c}}_i,{\textit{u}}_i)\) is minimized at \(\hat{{\textit{u}}}_i(\mathbf{x})=(\hat{u}_{i1}(\mathbf{x}),\hat{u}_{i2}(\mathbf{x}),...,\hat{u}_{iN}(\mathbf{x}))\) for fixed \(\mathbf{{c}}_i\), given by

$$\begin{aligned} \hat{u}_{ij}(\mathbf{x})=\frac{\left( \lambda _{ij}{\parallel I_i(\mathbf{x})-c_{ij} \parallel ^2}\right) ^{\frac{1}{1-q}}}{\sum _{k=1}^N\left( \lambda _{ik}\parallel I_i(\mathbf{x})-c_{ik} \parallel ^2\right) ^{\frac{1}{1-q}}} \end{aligned}$$
(4)

where \(j=1,2,...,N\).

For the case \(q=1\), it can be shown that the minimizer \(\hat{{\textit{u}}}_i(\mathbf{x}) = (\hat{u}_{i1}(\mathbf{x}), \hat{u}_{i2}(\mathbf{x}), ..., \hat{u}_{iN}(\mathbf{x}))\) is given by

$$\begin{aligned} \hat{u}_{ij}(\mathbf{x}) = \left\{ \begin{array}{lr} 1, \qquad j = j_{min}(\mathbf{x})\\ 0, \qquad j \ne j_{min}(\mathbf{x}) \end{array} \right. \qquad j=1,2,...,N \end{aligned}$$
(5)

where

$$\begin{aligned} j_{min}(\mathbf{x}) = \mathop {argmin}_{j}{(\lambda _{ij}\parallel {I_i(\mathbf{x})-c_{ij}}\Vert ^2)}. \end{aligned}$$
(6)

In fact, segmentation of WM, GM, CSF, and stroke lesions in this step is performed in an iterative process, which will be described in detail in Sect. 2.4.

2.2 Fusion of Preliminary Segmentation Results of Lesions

Label fusion is one of the most important steps for multi-spectral segmentation due to its significance in merging useful knowledge of different labels [3]. In the literature, many efforts have already been devoted to developing effective and accurate label fusion strategies [2, 3, 12]. As one of the well known label fusion strategies, majority voting is much more straightforward and concise [1]. Therefore, majority voting is used in the proposed framework to fuse segmentation results of ischemic stroke lesions obtained by the above described fuzzy c-means method. The judge rule is that candidate voxels are regarded as lesions only if (1) they are considered as brain lesions in FLAIR images, and (2) they are viewed as brain lesions in more than 1 imaging modality beside FLAIR.

2.3 Boundary Refinement of Brain Lesions Using 3-Phase Level Set

Since miss- and over- segmentations may arise in the above mentioned two steps. A three phase level set method is proposed in this subsection as the third step to refine segmentation boundaries of the lesions. The proposed method can be seen as an extension of the local intensity clustering (LIC) model with the capability of segmenting ischemic stroke lesions from multi-spectral MR images [10].

Before defining the energy formulation of the proposed level set method, we first view inhomogeneous intensities of an observed MR brain image \(I_i\) coming from the i-th imaging modality, which is defined on a continuous domain \(\varOmega \subset R^3\), as a product of the true image \(J_i\) and the bias field \(b_i\), i.e.,

$$\begin{aligned} I_i(\mathbf{x})=b_i(\mathbf{x})J_i(\mathbf{x})+n_i(\mathbf{x}) \end{aligned}$$
(7)

where \(\mathbf{x} \in \varOmega \) and \(n_i\) is the zero-mean additive noise.

Consider a relatively small spherical neighborhood with a radius \(\rho \) centered at a given point \(\mathbf{y}\in \varOmega \), defined by \({\mathcal{O}}_\mathbf{y}\triangleq \lbrace \mathbf{x}: \mid \mathbf{x}-\mathbf{y}\mid \le \rho \rbrace \). The bias field \(b_i\) in the neighborhood can be ignored due to its slowly and smoothly varying property. Taking into account the constant intensity \(c_{ij}\) of the true image \(J_i\) in \(\varOmega _j\) as mentioned in Sect. 2.1, we obtain

$$\begin{aligned} b_i(\mathbf{x})J_i(\mathbf{x}) \approx b_i(\mathbf{y})c_{ij} \quad \mathrm {for} \quad \mathbf{x}\in \varOmega _j\cap {{\mathcal{O}}_\mathbf{y}}. \end{aligned}$$
(8)

This local intensity clustering property allows us to apply the standard K-means algorithm in the following continuous form to classify these local inhomogeneous intensities in the neighborhood \({{\mathcal{O}}_\mathbf{y}}\). Taking all images of the L imaging modalities into account, we define

$$\begin{aligned} \mathcal{{E}}_y=\sum _{j=1}^N\gamma _j\int _{O_y}\left( \sum _{i=1}^L\chi _i\parallel I_i(\mathbf{x})-b_i(\mathbf{y})c_{ij}\parallel ^2\right) u_j(\mathbf{x})d\mathbf{x} \end{aligned}$$
(9)

where \(\gamma _j\) is a weighting coefficient used to control size of the j-th tissue, \(\chi _i\) is a weighting coefficient for images from the i-th imaging modality, and \(u_j\) is the binary membership function of \(\varOmega _j\). On account of the inherent property of the membership function \(u_j\) in representing \(\varOmega _j\), \(\mathcal{{E}}_\mathbf{y}\) can be rewritten as

$$\begin{aligned} \mathcal{{E}}_\mathbf{y}=\sum _{j=1}^N\gamma _j\int _{\varOmega _j}K_\sigma (\mathbf{x}-\mathbf{y})\left( \sum _{i=1}^L\chi _i\parallel I_i(\mathbf{x})-b_i(\mathbf{y})c_{ij}\parallel ^2\right) d\mathbf{x} \end{aligned}$$
(10)

where \(K_\sigma \) is a nonnegative kernel function with the property \(\int _{|\mathbf{u}| \le \rho }{K_{\rho }(\mathbf{u})}=1\) and \({K_{\rho }(\mathbf{u})}=0\) for \(\mathbf{u}\notin \mathcal{{O}}_y\).

To ensure the partition \(\{\varOmega _j\}_{j=1}^N\) of the entire domain \(\varOmega \) to be the one such that \({\mathcal{E}}_\mathbf{y}\) is minimized for all \(\mathbf{y}\) in \(\varOmega \), we minimize the integral of \({\mathcal{E}}_\mathbf{y}\) with respect to \(\mathbf{y}\) over the entire image domain \(\varOmega \) and define

$$\begin{aligned} \mathcal{{E}}=\int _\varOmega \left( \sum _{j=1}^N\gamma _j\int _{\varOmega _j}K_\sigma (\mathbf{x}-\mathbf{y})\left( \sum _{i=1}^L\chi _i\parallel I_i(\mathbf{x})-b_i(\mathbf{y})c_{ij}\parallel ^2\right) d\mathbf{x}\right) d\mathbf{y}. \end{aligned}$$
(11)

As our goal is to segment brain lesions, we consider the lesions as one region, brain tissues (WM, GM, and CSF) as the second region, and the background as the third region. Let H be the Heaviside function and \(\phi _1\) and \(\phi _2\) be two level set functions both defined on \(\varOmega \). We therefore use \(M_1(\phi _1,\phi _2)=(1-H(\phi _1))(1-H(\phi _2))\), \(M_2(\phi _1,\phi _2)=H(\phi _1)(1-H(\phi _2))\), and \(M_3(\phi _1,\phi _2)=H(\phi _2)\) to represent these three regions, respectively, and rewrite \(\mathcal{{E}}\) as

$$\begin{aligned} \mathcal{{E}}=\int _\varOmega \left( \sum _{j=1}^N\gamma _j e_j(\mathbf{x})M_j(\phi _1(\mathbf{x}),\phi _2(\mathbf{x}))\right) d\mathbf{x} \end{aligned}$$
(12)

where

$$\begin{aligned} e_j(\mathbf{x})=\int _{\varOmega }K_\sigma (\mathbf{x}-\mathbf{y})\left( \sum _{i=1}^L\chi _i\parallel I_i(\mathbf{x})-b_i(\mathbf{y})c_{ij}\parallel ^2\right) d\mathbf{y} \end{aligned}$$
(13)

For convenience, we represent the bias field \(b_1\), \(b_2\), ..., \(b_L\) with a vector \(\mathbf{b}=(b_1, b_2, ..., b_L)\) and further rewrite \(\mathbf{c}_{1}\), \(\mathbf{c}_{2}\), ..., and \(\mathbf{c}_{L}\) into a new vector \(\mathbf{{c}}=(\mathbf{c}_{1},\mathbf{c}_{2},...,\mathbf{c}_{L})\). Thus, the level set functions \(\phi _1\) and \(\phi _2\) and the vectors \(\mathbf{b}\) and \(\mathbf{{c}}\) are variables of the energy \(\mathcal{{E}}\), which can therefore be written as \(\mathcal{{E}}(\phi _1,\phi _2,\mathbf{b},\mathbf{{c}})\).

The energy \(\mathcal{{E}}(\phi _1,\phi _2,\mathbf{b},\mathbf{{c}})\) defined above is used as the data term of the final energy functional of the proposed level set formulation, defined by

$$\begin{aligned} {\mathcal{F}}(\phi _1,\phi _2,\mathbf{b},\mathbf{{c}}) = \mathcal{{E}}(\phi _1,\phi _2,\mathbf{b},\mathbf{{c}})+{\mathcal{P}}(\phi _1,\phi _2)+{\mathcal{L}}(\phi _1,\phi _2). \end{aligned}$$
(14)

where \(\mathcal{P}(\phi _1,\phi _2)\) and \(\mathcal{L}(\phi _1,\phi _2)\) are the regularization term and arc length term. These two terms are introduced to maintain the regularity of the level set functions and smooth the 0-level set contours of the level set functions, defined by

$$\begin{aligned} {\mathcal{P}}(\phi _1,\phi _2) = \mu _1\int \frac{1}{2}(\mid \triangledown \phi _1(\mathbf{x})\mid -1) ^2 d\mathbf{x}+\mu _2\int \frac{1}{2}(\mid \triangledown \phi _2(\mathbf{x})\mid -1) ^2 d\mathbf{x} \end{aligned}$$
(15)

and

$$\begin{aligned} {\mathcal{L}}(\phi _1,\phi _2) = \nu _1 \int \mid \triangledown H(\phi _1(\mathbf{x}))\mid d\mathbf{x}+\nu _2 \int \mid \triangledown H(\phi _2(\mathbf{x}))\mid d\mathbf{x} \end{aligned}$$
(16)

where \(\mu _1\), \(\mu _2\), \(\nu _1\) and \(\nu _2\) are weighting coefficients.

Energy minimization of \(\mathcal{{F}}(\phi _1,\phi _2,\mathbf{b},\mathbf{{c}})\) can be achieved by alternately minimizing it with respect to each of its variables. For fixed \(\mathbf{b}\) and \(\mathbf{c}\), we minimize the final energy functional \({\mathcal{F}}\) using standard gradient descent method and obtain

$$\begin{aligned} \frac{\partial \phi _1}{\partial t}= & {} \delta (\phi _1)(1-H(\phi _2))(\lambda _1e_1-\lambda _2e_2)\nonumber \\+ & {} \mu _1 \left( \triangledown ^2\phi _1 - {\mathrm{div}}\left( \frac{\triangledown \phi _1}{\mid \triangledown \phi _1\mid }\right) \right) +\nu _1 \delta (\phi _1){\mathrm{div}}\left( \frac{\triangledown \phi _1}{\mid \triangledown \phi _1\mid }\right) \end{aligned}$$
(17)

and

$$\begin{aligned} \frac{\partial \phi _2}{\partial t}= & {} \delta (\phi _2)(\lambda _1 e_1 (1-H(\phi _1))+\lambda _2 e_2 H(\phi _1)-\lambda _3 e_3) \nonumber \\+ & {} \mu _2 \left( \triangledown ^2\phi _2 - {\mathrm{div}}\left( \frac{\triangledown \phi _2}{\mid \triangledown \phi _2\mid }\right) \right) +\nu _2 \delta (\phi _2){\mathrm{div}}\left( \frac{\triangledown \phi _2}{\mid \triangledown \phi _2\mid }\right) . \end{aligned}$$
(18)

For fixed \(\phi _1\), \(\phi _2\), and \(\mathbf{b}\), the optimal \(\tilde{\mathbf{c}}=(\tilde{\mathbf{c}}_1,\tilde{\mathbf{c}}_2,...,\tilde{\mathbf{c}}_L)\) where \(\tilde{\mathbf{c}}_i=(\tilde{{c}}_{i1},\tilde{{c}}_{i2},...,\tilde{{c}}_{iN})\) and \(i=1,2,...,L\) minimizes the final energy functional \({\mathcal{F}}(\phi _1,\phi _2,\mathbf{b},\mathbf{{c}})\), given by

$$\begin{aligned} c_{ij}=\frac{\int I_i(\mathbf{x})M_j(\phi _1(\mathbf{x}),\phi _2(\mathbf{x}))(b_i*K_\sigma )(\mathbf{x})d\mathbf{x}}{\int M_j(\phi _1(\mathbf{x}),\phi _2(\mathbf{x}))(b_i^2*K_\sigma )(\mathbf{x})d\mathbf{x}},\; j=1,2,...,N. \end{aligned}$$
(19)

For fixed \(\phi _1\), \(\phi _2\), and \(\mathbf{c}\), the optimal \(\tilde{\mathbf{b}}=(\tilde{b}_1, \tilde{b}_2, ..., \tilde{b}_L)\) that minimizes the final energy functional \({\mathcal{F}}(\phi _1,\phi _2,\mathbf{b},\mathbf{{c}})\) is given by

$$\begin{aligned} \tilde{b}_i=\frac{\left( I_i\sum _{j=1}^N{c_{ij}M_j(\phi _1,\phi _2)}\right) *K_\sigma }{\sum _{j=1}^N{c_{ij}^2M_j(\phi )}*K_\sigma }, \quad i=1,2,...,L. \end{aligned}$$
(20)

2.4 Implementation

In the implementation of the proposed framework, the choice of K is important but flexible as long as it is a normalized even function and satisfies the property that \(K(\mathbf{u})\ge K(\mathbf{v})\), if \(\mid \mathbf{u}\mid <\mid \mathbf{v}\mid \), and \({\mathrm{lim}}_{\mid \mathbf{u}\mid \rightarrow \infty }K(\mathbf{u})=0\). In this paper, an averaging filter with size of \(\rho \) is chosen as K. In our numerical implementation, the stepped Heaviside function H is approximated by a smoothed Heaviside function \(H_\epsilon \) with \(\epsilon = 1\), defined by \( H_\epsilon (x) = \frac{1}{2}\left[ 1+\frac{2}{\pi }\arctan \left( \frac{x}{\epsilon }\right) \right] . \) The derivative of \(H_\epsilon \) is used to approximate the Dirac delta function \(\delta \), which can be written as \( \delta _\epsilon (x) = H^\prime _\epsilon (x) = \frac{1}{\pi }\frac{\epsilon }{\epsilon ^2+x^2}. \)

The implementation of the proposed framework can be straightforwardly expressed in the following steps.

  • Step 1. Segment images of each modality separately using the weighting suppressed fuzzy c-means as described in Sect. 2.1. Update each variable of the energy function defined in Eq. (2) iteratively until the iteration number exceeds a predetermined maximum number or convergence criterion has been reached.

  • Step 2. Fuse segmentation results of different modalities using the voting strategy as described in Sect. 2.2.

  • Step 3. Refine fused segmentation results using the three phase level set method as described in Sect. 2.3 where the level set functions \(\phi _1\) and \(\phi _2\) are initialized to the results of Step 2. Update each variables of energy functional defined in Eq. (14) iteratively until the solution is stable or the iteration number exceeds a predetermined maximum number.

3 Results

To evaluate the proposed framework, we participated in the ischemic stroke lesion segmentation (ISLES) challenge of MICCAI 2015 and applied it to images of the challenge. Figure 2 shows a segmentation example of the proposed framework.

Fig. 2.
figure 2figure 2

Segmentation results of the proposed framework on images from four different imaging modalities (http://www.isles-challenge.org/). Orignal images and corresponding preliminary segmentations are given in the 1st and 2nd rows. Fusion result, final segmentation, and the ground truth are given from left to right in the 3rd row.

3.1 Dataset and Parameter Set

The ISLES challenge consists of two sub-challenges: sub-acute ischemic stroke lesion segmentation (SISS) and acute stroke outcome/penumbra estimation (SPES). Dataset of the former includes 28 training cases and 36 testing cases, whereas there are 30 training and 20 testing cases in the latter one. The images are all from MRI and modalities DWI, T1w, T2w, and FLAIR are adopted by the first sub-challenge SISS. In contrast, T1c, T2, DWI, CBF, CBV, TTP, Tmax images are provided by the second sub-challenge SPES. The images are all skull-stripped and have been re-sampled to an isotropic spacing of \(1^3\) mm (SISS) and \(2^3\) mm (SPES) and have also been co-registered to the FLAIR (SISS) and T1w contrast (SPES) sequences, respectively.

For SISS, the number of imaging modalities L are set to be 4 with DWI, T1w, T2w, and FLAIR as viewed as the 1st, 2nd, 3rd, and 4th imaging modalities, respectively. When the images are segmented by the proposed weighting suppressed fuzzy c-means separately, we set \(N=4,3,2,4\), respectively. For each imaging modality, e.g., the i-th modality, elements of the cluster centroid vector \(\mathbf{c}_i\) are initialized with equally spaced intensities. The other weighting coefficients of the proposed weighting suppressed fuzzy c-means are set to \(\lambda _{11}=\lambda _{12}=\lambda _{13}=\lambda _{14}=1.0\), \(\lambda _{21}=1.0, \lambda _{22}=0.4, \lambda _{23}=1.5\), \(\lambda _{31}=1.0, \lambda _{32}=0.5\), and \(\lambda _{41}=\lambda _{42}=\lambda _{43}=\lambda _{44}=1.0\). The level set function in the third step was initialized as a binary step function, defined by \(\phi (\mathbf{x}) = -c\) for \(\mathbf{x}\) inside the initial zero-level contour of \(\phi \) and \(\phi (\mathbf{x}) = c\) otherwise. Unless otherwise specified, we set \(c=10\), \(\gamma _1=...=\gamma _L=1.0\), \(\chi _1=...=\chi _L=1.0\), \(\mu _1=...=\mu _L=1.0\), \(\nu _1=...=\nu _L=0.1\times 255\times 255\), \(\varDelta t=0.1\), and \(\rho =6\) in this paper. Note that these parameters can be set to be values learning from training sets.

We have also applied the proposed framework to sub-challenge SPES. We set \(N=3,5,3\) for preliminarily segmenting images of modalities CBF, TTP, Tmax, respectively. All weighting coefficients of the proposed weighting suppressed fuzzy c-means are set to be 1.0. As the ground truth provided by the organizers are not smooth enough and there are holes in the lesion-like regions, fusion results obtained by the proposed framework are considered as final segmentation results.

3.2 Evaluation Measures

To evaluate segmentation accuracy of automatic methods that participated in the challenge quantitatively, segmentation results are compared with the reference ground-truth in terms of Dice’s coefficient (DC), average symmetric surface distance (ASSD), and Hausdorff distance (HD).

It is well known that the DC is defined as twice of the quotient between intersection size of a pairwise variable and sum of their sizes where the variables are a segmentation result B and the ground truth A for image segmentation, which can therefore be written as

$$\begin{aligned} DC = \frac{2\mid A \cap B \mid }{\mid A \mid + \mid B \mid } \end{aligned}$$
(21)

where \(\cap \) is the intersection operator. It is obvious that values of DC are in the interval of [0, 1] with a higher value indicating a better match between A and B.

Considering two sets of surface points that constitute the segmentation result B and the ground truth A, the average surface distance (ASD) is given by

$$\begin{aligned} ASD(A,B) = \frac{\sum _{a \in A}\mathop {min}_{b\in B} d(a,b)}{\mid A \mid } \end{aligned}$$
(22)

where d(ab) is the Euclidean distance between the points of a and b. Since \(ASD(A,B)\ne ASD(B,A)\), the ASSD can be then defined by

$$\begin{aligned} ASD(A,B) = \frac{ASD(A,B)+ASD(B,A)}{2}. \end{aligned}$$
(23)

Note that that ASSD is given in mm, a lower value indicating a better match between the ground truth A and the segmentation result B.

Table 1. Participants of the ISLES challenge of MICCAI 2015.
Table 2. Accuracy comparison of segmentation results of the proposed framework with the other participants’ methods on images from sub-challenge SISS.

The HD denotes the maximum distance between the obtained volume surface points B and corresponding points in the ground truth A. It can be defined by

$$\begin{aligned} HD(A,B)=\mathop {max}\{\mathop {max}_{a \in A}(\mathop {min}_{b \in B}d((a,b))), \mathop {max}_{b \in B}(\mathop {min}_{a \in A}d((b,a)))\}. \end{aligned}$$
(24)

Thus, HD is given in mm and a smaller HD value indicates a better agreement of the segmentation result with the ground truth.

3.3 Quantitative Evaluation of the Proposed Framework

As shown in Table 1, 16 teams from all over the world participated in the challenge, where our team information are emphasized in bold font.

Quantitative comparison of the proposed framework with the other participants’ methods on images from sub-challenges SISS and SPES are given in Tables 2 and 3, respectively. It is obvious that the proposed framework is the best in terms of ASSD and HD and the second best in DC for sub-challenge SISS. According to the ranking rules of the challenge, which can be found on the website http://www.isles-challenge.org/, the proposed framework finally took the second and fourth places for SISS and SPES, respectively.

Table 3. Accuracy comparison of segmentation results of the proposed framework with the other participants’ methods on images from sub-challenge SPES.

4 Conclusion and Discussions

An ischemic lesion segmentation framework has been proposed, which consists of preliminary segmentation, label fusion, and boundary refinement. As most of level set methods are usually time consuming and sensitive to initialization, an improved fuzzy c-means method is first used to coarsely extract ischemic lesions from normal brain tissues. The preliminary segmentation results are only used as initialization of the level set method. Therefore, there is no need to introduce bias correction rules in the first step in consideration of saving time. Quantitative evaluation and comparison with methods that participated in the ISLES challenge have demonstrated advantages of the proposed framework in terms of accuracy.

Note that as the zero level contour of \(\phi _2\) is used to represent boundaries between brain tissues and the background, update of \(\phi _2\) is not important for seeking lesion boundaries. Therefore, \(\phi _2\) can be fixed in the evolution of \(\phi _1\) to improve computational efficiency. In addition, narrow band implementation can be used to further improve time performance of the proposed level set method.

In the future, we will further improve and validate the proposed method on more datasets, such as MICCAI 2008 lesion segmentation data.