Figures
Abstract
This paper presents a novel two-stage image segmentation method using an edge scaled energy functional based on local and global information for intensity inhomogeneous image segmentation. In the first stage, we integrate global intensity term with a geodesic edge term, which produces a preliminary rough segmentation result. Thereafter, by taking final contour of the first stage as initial contour, we begin second stage segmentation process by integrating local intensity term with geodesic edge term to get final segmentation result. Due to the suitable initialization from the first stage, the second stage precisely achieves desirable segmentation result for inhomogeneous image segmentation. Two stage segmentation technique not only increases the accuracy but also eliminates the problem of initial contour existed in traditional local segmentation methods. The energy function of the proposed method uses both global and local terms incorporated with compacted geodesic edge term in an additive fashion which uses image gradient information to delineate obscured boundaries of objects inside an image. A Gaussian kernel is adapted for the regularization of the level set function and to avoid an expensive re-initialization. The experiments were carried out on synthetic and real images. Quantitative validations were performed on Multimodal Brain Tumor Image Segmentation Benchmark (BRATS) 2015 and PH2 skin lesion database. The visual and quantitative comparisons will demonstrate the efficiency of the proposed method.
Citation: Soomro S, Munir A, Choi KN (2018) Hybrid two-stage active contour method with region and edge information for intensity inhomogeneous image segmentation. PLoS ONE 13(1): e0191827. https://doi.org/10.1371/journal.pone.0191827
Editor: Yuanquan Wang, Beijing University of Technology, CHINA
Received: June 8, 2017; Accepted: January 11, 2018; Published: January 29, 2018
Copyright: © 2018 Soomro et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Data Availability: This study uses two publicly available datasets for the validation of our method. These datases comprises of original images and their ground truth files, and each can be downloaded from the following links: the Skin Lesion dataset (images and their ground truths) can be downloaded from https://www.fc.up.pt/addi/ph2%20database.html, and the BRATS2015 dataset is available from https://www.smir.ch/BRATS/Start2015.
Funding: This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (NRF-2010-0025512).
Competing interests: The authors have declared that no competing interests exist.
Introduction
Image segmentation is the well-defined scheme of partitioning an image into several regions and it has a great significance in image processing and computer vision [1]. Intensity variations and inhomogeneities often occur in medical images mostly due to the imperfect image acquisition process and influence of the external surroundings. The existence of inhomogeneities and complicated boundaries create difficulties in image segmentation and eventually, it leads to uncertainty for doctors and radiologists during the decision-making process. Active contour models have been popular techniques for those type of images [2]. These methods provide smooth contours for image segmentation by using some energy minimization principle [3].
Existing active contour models are mainly categorized as edge-based [3–8] and region-based [9, 10, 12–15] methods. Edge-based methods exploit image gradient information to deploy a balloon force used to capture object boundaries in curve evolution [5]. Nevertheless, these methods are very sensitive to noise and unable to segment objects in the presence of fuzzy or blurred boundaries. Alternatively, region-based methods essentially intend to distinguish each region by using the statistical and curvature information to control the movement of contour, thus they have better execution over noisy and blurred images. These methods are further categorized into a global [9–12] and a local [13–16] region based active contour methods.
One of the most popular global region method is Chan-Vese method [12], which is a special case of a piecewise constant Mumford and Shah method [10]. This method relies on constant intensity information across the regions therefore, it fails to segment images with intensity inhomogeneity. In order to overcome the limitation of the piecewise constant methods, Li et al. [14] proposed a local region-based method. This method has introduced a kernel function that considers the local image information known as LBF (local binary fitting) energy to segment images with intensity inhomogeneity. Segmentation of inhomogeneous image is shown in Fig 1, where Fig 1(a) shows segmentation of traditional Chan-Vese (global region method) and Fig 1(b) shows segmentation of LBF (local region method). From Fig 1, it can be deduced that LBF method is capable of handling intensity variations across the regions and give better result in terms of intensity inhomogeneity.
a: Chan-Vese method segmentation. b: LBF method segmentation.
Recently, hybrid models [2, 17–22] have gained popularity among region based methods. These methods either combine region (local and/or global) and edge information or both local and global intensity information in their energy formulations. In [17], Zhang et al. proposed a method which combines the advantages of an edge-based and region-based active contours. It defines a SPF (signed pressure force) function using global means from Chan-Vese [12] method. A Gaussian kernel is also adapted to regularize level set and to avoid re-initialization. Oh et al. [20] has also formulated a hybrid method using scaled edge and region information. It combines global region information from Chan-Vese [12] method and coupled geodesic edge term from GAC [5] method to prevent boundary leakage problem.
Alternatively, A region-based active contour methods are proposed [22, 23] in the context of local and global intensity information. These methods integrate local and global intensity information in their energy formulations. Global force drives the movement of contour while local force captures the inhomogeneities across the regions.
A variational two-stage image segmentation approach for intensity inhomogeneity is proposed by Wang et al. [21]. Two stages of this method were based on global and local region active contours described by Gaussian distributions. The final segmentation of the first (global) stage is served as the initial contour of the second (local) stage. In this way, this method is able to segment images corrupted by intensity inhomogeneity.
This paper presents, a novel two-stage hybrid edge and region(local and global) active contour method for image segmentation with a level set formulation. Firstly, we obtain the coarse segmentation result of the first stage and the final segmentation result in the second stage. In the first stage, we incorporate global region force term and geodesic edge term for statistical and edge information. Global intensity used to segment homogeneous regions while edge term used to prevent boundary leakage problem. In the second stage, we develop a modified energy function which integrates local binary fitting term and geodesic edge term. Minimization of an energy functional in the second stage mutually segments the objects with intensity inhomogeneity and restrict the contour at object boundary. Since the local fitting methods [14, 15] are very sensitive to the initial position of contour. Proposed method takes final contour of the first stage as initialization of the second stage thus, it provides a better choice for initial contour position and give satisfactory performance for intensity inhomogeneous image segmentation.
In level set methods, it is often required to initialize the level set function to SDF (signed distance function) and avoid it to be too steep or too flat near the interface. In this regard, re-initialization is required to maintain the stability of level set function. There are numerous operational methods to implement re-initialization schemes. Traditional variants of the level set piecewise constant methods [11, 24, 25] eliminate the re-initialization by solving the constrained optimization problems. Liu et al. [26] proposed Lagrangian constrained optimization method to eliminate the re-initialization in level set function.
Proposed method adapts a Gaussian kernel from Zhang et al. [17] which not only regularizes the level set but also avoid an expensive re-initialization. Proposed method has been executed over several real and synthetic images including brain and skin lesion datasets and compared with previous methods. Experimental results will determine that proposed method offers an improved scheme and achieve better segmentation results than previous methods.
Rest of this paper is organized as follows. The background study is discussed in section 2. The proposed method is explained in section 3. Final results and comparisons are illustrated in section 4 using both real and synthetic images. The quantitative results are shown in section 5 using the public dataset from Multimodal brain tumor image segmentation benchmark (BRATS) 2015 [27] and PH2 skin lesion [28] database. In the end, conclusion and future work are described in section 6.
Background and theoretical justifications
Geodesic active contour model
GAC method [5] is regarded as a standard active contour method which uses image gradient information from the boundary of the object. Let I: Ω ⊂ R2 is an image domain, I: Ω → R is an input image and C(q) is a closed curve. They proposed the following energy functional:
(1)
where g is the edge stopping function defined as:
(2)
where ∇Gσ * I is the convolution of an image I with a Gaussian kernel whose standard deviation is σ. By minimizing the above energy functional we get following Euler–Lagrange equation:
(3)
where k denotes the curvature of the contour and
is inward normal of the curve. The final level set equation is defined as follows:
(4)
This method relies on edge based contour evolution which can only capture objects with edges defined by its gradient. Therefore, this method doesn’t support regional information and fall into local minimum when the initial contour is not placed near object boundaries.
Mumford and Shah model
Mumford and Shah [10] proposed a region-based image segmentation method. This method finds an optimal piecewise approximation function μ of the image I, which keep changing smoothly within a sub-region of image domain I: Ω ⊂ R2. The proposed energy formulation of this method is written as:
(5)
where L(C) is the length of the curve, μ and v are positive parameters. Practically, the energy functional of this model owns non-convex behavior and the non-regularity of the edge term causes difficulty during energy minimization.
Chan-Vese model
In [12], Chan-Vese proposed a simplified energy functional based on Mumford and Shah model [10] by approximating the image intensities inside and outside of contour known as c1 and c2 respectively. Let I: Ω ⊂ R2 be an input image, ϕ: Ω ⊂ R2 a level set function and C a closed curve corresponding to the zero level set: C = {x ∈ Ω|ϕ(x) = 0}. The energy functional of Chan-Vese method is defined as follows:
(6)
where μ ≥ 0, v ≥ 0 and λ1, λ2 ≥ 0 are scaling constants, constant μ ≥ 0 scales the Euclidian length of the curve C and constant v scales the area term inside the contour C. Hε(ϕ) is the regularized Heaviside function defined as:
(7)
where ϵ handles the smoothness of Heaviside function. In Eq (6), two constants c1 and c2, represent global region intensities inside and outside of contour C, respectively. Minimizing Eq (6), with respect to ϕ using gradient descent method [29], the corresponding level set formulation is obtained as follows.
(8) δϵ(ϕ) is a smooth version of a Dirac delta function, which is defined as:
(9)
beside handling the smoothness of a Heaviside function in Eq (7), ϵ also controls the width of the a Dirac delta function in Eq (9). Keeping ϕ fixed and minimizing energy function in Eq (6), with respect to c1 and c2, we have:
(10)
(11)
The curve evolution process in Chan-Vese method is related to global characteristic of an image region inside and outside curve C, respectively. Therefore, this method produces unacceptable result if the image has local or inhomogeneous regions inside and outside of the curve C.
Local binary fitted model
In, [14] Li et al. proposed local binary fitted (LBF) method by encapsulating local image information into their energy functional to deal with intensity inhomogeneity problem. Let, I: Ω ⊂ R2 be an input image, ϕ: Ω ⊂ R2 is a level set function, and C is a closed curve. They propose following energy formulation:
(12)
where λ1, λ2 ≥ 0 are positive parameters, Hε(ϕ) is the regularized Heaviside function defined in Eq (7). f1(x) and f2(x) are locally approximated intensities inside and outside of contour C defined as.
(13)
(14)
In order to ensure stable solution, the distance regularization term from [4] is fused in to Eq (12). Moreover, the Euclidean length term is also added to regularize the zero curve of ϕ. The total variational formulation of this method is defined as:
(15)
where μ is a scaling parameter for distance regularized penalty term and v is scaling parameter for length term which drives the movement of contour towards object boundaries. Kσ is a Gaussian kernel with a standard deviation which is defined as:
(16)
where σ is a standard deviation of the Gaussian kernel function which controls the degree of localization from small neighborhood to whole image domain.
The introduction of Gaussian kernel function considers an image local information inside and outside of contour C and enable this method to segment images with intensity inhomogeneity. however, local image information is not always sufficient to carry out an accurate segmentation. Moreover, this method is extremely sensitive to the position of initial contour and stuck into local minima if we place initial contour far from boundaries.
ESRAC model
Oh et al. [20] proposed a hybrid region and edge method known as edge scaled region-based active contour method. This method redefines Chan-Vese [12] region information weighted by edge stopping function and integrate geodesic edge term [5] into their formulation. They propose following energy formulation:
(17)
where g(x) is an edge stopping function scaled with region force term. parameter v used to scale the area term inside and outside the contour C and α is scaling parameter whose values ranges between 0 ≤ α ≤ 1, it controls the balance between region and geodesic edge term. Minimizing Eq (17), using gradient descent method [29], the corresponding level set formulation is obtained as follows.
(18)
In above equation g is monotonically decreasing edge function defined as:
(19)
The regional term in above equation is weighted with edge indicator function therefore, this method can segment object boundaries by using gradient information. In the case of insufficient gradient information this method can also segment object by using statistical region information. However, this method is not available for inhomogeneous intensity regions.
Proposed model
Inspired by the work of Oh et al. [20] and wang et al. [21] we propose a novel two-stage active contour segmentation method by integrating the region-based global and local methods with geodesic active contour method. In the first stage, we acquire segmentation result from the global region-edge active contour method (GREAC). This method rapidly captures all homogeneous regions and spurious boundaries in an image and achieves its coarse segmentation result. Later in the second stage, we use final contour of the last stage as initialization curve and continue segmentation process by minimizing the energy functional of the local region-edge active contour method (LREAC). The initial stage gives a partial segmentation result and provide a suitable initialization for second stage, in this way this method eliminates the common problem of initial contour existed in local region based methods [13, 14]. Finally, the second stage considers an image local information and gets the final segmentation result.
First stage
Global region-based segmentation has been regarded as a fast and stable segmentation for homogeneous regions and it takes global image intensities inside and outside of contour. Furthermore, it is not sensitive to initialization of contour. In the first stage, we propose an energy functional of the global region-edge active contour method (GREAC) defined as:
(20)
In Eq (20), c1 and c2 are edge scaled intensity means defined as::
(21)
(22)
where g(|∇I|) is a monotonically decreasing edge stopping function defined in Eq (2). By using steepest gradient descent method [29], minimization of Eq (20), with respect to ϕ leads to the following gradient decent flow:
(23)
The energy functional in above equation is scaled with a parameter w whose value ranges between 0 ≤ w ≤ 1. This parameter manages the weight of the global region and geodesic edge term depending on the type of image we are dealing with. When w is large the global region term act as the main force with small influence of edge term to detect global regions and boundaries inside an object. Similarly, when w is small geodesic force term act as the main force with small influence of global region information to attract the curve towards the desired boundary of the object. This process is shown in Fig 2(a) which describes the role of global and geodesic energy terms during the first stage.
a: First stage segmentation. b: second stage segmentation.
Second stage
The first stage of the proposed method uses global image information across the regions. Therefore, it is unable to capture objects with intensity inhomogeneity. In this stage we extend global region-edge active contour method (GREAC) to local region-edge active contour method (LREAC) by using local binary fitting energy from LBF [14] method. The energy functional of the local region-edge active contour method (LREAC) is defined as:
(24) f1(x) and f2(x) are locally approximated intensities inside and outside of contour C defined as.
(25)
(26)
where g(|∇I|) is a monotonically decreasing edge stopping function defined in Eq (2). By using steepest gradient descent method [29], minimization of Eq (24), with respect to ϕ leads to the following gradient decent flow:
(27)
The energy functional in above equation is also scaled with a parameter w whose value ranges between 0 ≤ w ≤ 1. This parameter manages the weight of the local region and geodesic edge term depending on the type of image we are dealing with. When the w is large the local-region term act as the main force with small influence of edge term to detect inhomogeneous regions and boundaries inside an object. Similarly, when w is small geodesic force term act as the main force with small influence of local-region information to attract the curve towards the desired boundary of the object. This process is shown in Fig 2(b) which describes the role of local and geodesic energy terms during the second stage.
Traditional let set methods need to initialize their level set function (ϕ) periodically to SDF (signed distance function) during the contour evolution. Li et al. [4] proposed a penalization term which is also computationally expensive. The proposed method uses a Gaussian filter which regularizes a level set function and also avoids an expensive re-initialization. The initial level set function ϕ0 for the proposed method is defined as:
(28)
where ρ ≥ 0 is a constant, Ω0 is region inside an initial contour, Ω is the image domain and ∂Ω is an initial contour. Finally, the iterative steps of the proposed method are summarized in following algorithm:
Algorithm
1. Stage 1: First stage segmentation via global region-edge active contour method.
2. Initialize ϕ, ϕ(x, t = 0) from Eq (28).
3. n = 1.
4. while n <Nmax do
5. Compute (2), (21) and (22), respectively.
6. Solve ϕ using (23).
7. n = n + 1.
8. end while
9. Output: Rough segmentation result, final .
10. Stage 2: Final stage segmentation via Local region-edge active contour method.
11. Initialize ϕ, ϕ(x, t = 0) using last stationary level set ϕ, ϕ = ϕNmax.
12. n = 1.
13. while the solution is not converged do
14. Compute (2), (25) and (26), respectively.
15. Solve ϕ using (27).
16. n = n + 1.
17. end while
18. Output: Final and accurate segmentation result, final ϕ.
Results and quantitative comparisons
All the experiments were implemented in MATLAB on a personal computer with Intel core i5, 3.2 GHz, and 8 GB RAM. We have used parameters for all experiments which are listed in Table 1.
Fig 3 shows the first experiment of the proposed method on four synthetic images with intensity inhomogeneity. Column (a) show original images with initial contours, column (b) shows the result of the first stage and column (c) shows the final (second stage) segmentation result of the proposed method. Proposed method first produces rough segmentation result in column (b) which provides a suitable initialization for the second stage and thus it helps to get desired segmentation smoothly.
(a): original images with initial contours. (b): first stage segmentation result after 10 iterations. (c): second stage segmentation result.
Fig 4 shows the result of the proposed method and its comparison with previous methods on five different synthetic images involving intensity inhomogeneity in foreground and background of the objects. The column (a) showing original images with initial contours, the column (b) shows the result of Chan-Vese [12] method and produce an unacceptable result because this method can only capture homogeneous intensity regions. Column (c) and (d) show the result of LBF [14] method and LCV [16] method since these methods are very sensitive to initial contour therefore, these methods have not properly delineated the required object boundary. Column (e) shows the result of Wang et al. [21] method. This method is able to properly segment the second image, however, some unwanted contour has been produced in a fourth and fifth image. Moreover, this method is unable to detect obscured edge in the first image. Column (f) shows the result of the proposed method which is able to capture and segment all the objects properly.
(a): original images with initial contours. (b): Chan-Vese result. (c): LBF result. (d): LCV result. (e): Wang et al. result. (f): proposed method result.
Table 2 illustrates the time complexity for Fig 4 in terms of CPU time and iteration. It shows that Chan-Vese [12] method has conceded least time and iterations but it has not achieved desired segmentation results. On the other proposed method has achieved an accurate segmentation results with less number of iterations and CPU time compared to LBF [14], LCV [16] and Wang et al. [21] methods respectively.
The Local region based active contour methods [14, 16] are able to distinguish small changes between the background and the foreground. Therefore, they are suitable for intensity inhomogeneous images. However, there exists an intrinsic drawback of initial contour in local region based active contour methods. Therefore such methods are not sufficient for segmenting inhomogeneous information alone. Proposed method eliminates the initial contour problem by providing an ideal contour position in the first stage from global region based segmentation. In second stage local method gets the advantage of an ideal contour position and capture all inhomogeneous regions efficiently.
In Fig 5, we have shown the influence of initial contour position on the segmentation result. Column (a) shows five different level set initializations on the same image, Chan-Vese [12] result is shown in column (a), LBF method [14] results are shown in column (c), LCV method [16] results are shown in column(d), Wang et al. [21] method results are shown in column (e) and proposed method results are shown in column (f) respectively. Results demonstrate that proposed method has not intruded by the position of initial contour, in contrast previous methods have shown their sensitivity to the initial contour and produced undesired results.
(a): original images with initial contours. (b): Chan-Vese result. (c): LBF result. (d): LCV result. (e): Wang et al. result. (f): Proposed method result.
In Table 3, we have recorded the number of iterations and CPU time of each method based on Fig 5. The proposed method have conceded the second least number of iterations and CPU time after Chan-Vese [12] method and achieved desired segmentation results, whereas the Chan-Vese method was unable to get required results. Though, Wang et al. [21] method has also produced good results in the first and second row however it consumed a large number of iterations and CPU time for obtaining segmentation result, while proposed method has obtained the same results in all four initialization examples within less number of iterations and CPU time.
The experiment has also been performed on a real set of images with inhomogeneous and complex region properties. Fig 6 shows segmentation of three different real images, where column (a) shows the initial contour with original images. Column (b), (c), (d), (e) and (f) shows the result of Chan-Vese [12], LBF [14], LCV [16], Wang et al. [21] and proposed method respectively. All previous methods either capture uninterested regions or stuck in the background and thus have failed to get the desired segmentation results. On the contrary, proposed method gets the required results smoothly. Table 4 also shows the analysis of Fig 6 in terms of CPU time and iterations, where Chan-Vese method and Wang et al method yields the lowest time complexity analysis than proposed method but these methods have produced inappropriate segmentation results.
(a): Original images with initial contours. (b): Chan-Vese result. (c): LBF result. (d): LCV result. (e): Wang et al. result. (f): Proposed method result.
In order to compare the computational cost of the proposed method at same accuracy level with previous state-of-the-art methods, we have performed an experiment with five different images. Fig 7 shows approximately similar results obtained by all previous methods including proposed method. The first column in Fig 7 show original images followed by the result of the Chan-Vese [12] method, LBF [14] method, LCV [16] method, Wang et al. [21] method and proposed method in second, third, fourth, fifth and sixth column respectively. The CPU times of these images are listed in Table 5. By comparing the computational time of the proposed method and previous methods, it is clear that proposed method is also modest and proficient when it comes to same accuracy level with previous state-of-the-art methods.
Column(1): Original images. Column(2): Chan-Vese result. Column(3): LBF result. Column(4): LCV result. Column(5): Wang et al. result. Column(6): Proposed method result.
Quantitative analysis
The frequency of skin cancer has been consistently expanding over the past decade. Melanoma has been considered as one of the dangerous forms of skin cancer, reports show that survival rate of this cancer is very less during its last stage [30]. Therefore, detection of melanoma is very important and it helps dermatologists for initial treatment and diagnosis. Active contours have become a hot topic for melanoma image segmentation therefore, proposed method has been also validated over skin lesion dataset and compared with the previous state of art methods. In this regard, we use publically available skin lesion dataset PH2 [28] which comprises of 200 lesion images with manually annotated ground truths. The parameters used for skin lesion images are v1 = 0.0001 * 255 * 255, v2 = 0.00001 * 255 * 255, σ = 0.3, w1 = 0.9 and w2 = 0.001 respectively.
Fig 8 shows the result of proposed method on skin lesion images, where red contour shows the result of the proposed method and blue contour shows the ground truth respectively. Fig 9 shows the quantitative analysis of skin lesion segmentation in terms of accuracy analysis. We applied the proposed method and previous state of art methods on 200 skin images and calculated the average accuracy of each method. The formula for accuracy analysis is defined as:
(29)
where A is the segmented region and B is the ground truth. Fig 9 shows that proposed method gets the high accuracy compared to the previous state of the art methods.
MRI (Magnetic Resonance Imaging) is regarded as most commonly used noninvasive modality for brain tumor detection [31]. Manual segmentation of brain tumor by radiologists and experts suffer from errors mostly due to tiredness and fatigue. Segmentation of abnormal regions in MRI is essential because it assists doctors and specialists to study the growth of a tumor and quantitatively analyze it over a period of time. Many segmentation approaches have been proposed for brain tumor segmentation. Recently active contours have gained much popularity among brain tumor segmentation [32]. Therefore, we have also validated our method on the BRATS 2015 challenge dataset [27]. Four MRI sequences are available for each patient known as: T1-weighted(T1), T1 with gadolinium-enhancing contrast (T1c), T2- weighted (T2) and FLAIR. We have tested our method on BRATS 2015 [27] training dataset which comprises of 200 HGG(high-grade glioma) and 44 LGG(low-grade) patient volumes. We use three validation metrics for quantitative evaluations which are Dice coefficient (DSC), sensitivity(Sen) and specificity (Spe). The obtained result will be considered as good when the measured values of these metrics are close to 1. Sensitivity metric value defines that all detected regions(tumors) are correct and belongs to the ground truth. similarly, specificity specifies that none of the healthy tissue is considered as tumor tissue. Moreover, Dice coefficient measure how much detected tumor region overlaps the ground truth. These metrics are defined as:
(30)
(31)
(32)
where TP (true positive)corresponds to segmented tumor tissues, TN (true negative) corresponds to correctly unsegmented regions, FP (false positive) corresponds to the normal regions considered as tumor regions and FN (false negative) corresponds to the undetected tumor regions, respectively. The proposed method parameters used for skin lesion images are v1 = 1, v2 = 0.0001 * 255 * 255, σ = 3, w1 = 0.6 and w2 = 0.751 respectively.
Fig 10 presents obtained results on some images taken from BRATS 2015 [27]. The first column show the original images with initial contour and the second column shows the ground truth followed by the result of (from left to right) Chan-Vese [12], LBF [14], LCV [16], Wang et al. [21] and proposed method. It has be observed that final segmentation of the proposed method is robust and accurate against the complex background, where almost all previous methods fail to delineate the right boundaries. Moreover, Fig 10 show the segmentation results for three planes: axial, coronal and sagittal as shown in ground truth(second column). Results show that proposed method has accurately segmented brain tumor, Necrosis, and surrounding edema tissues successfully.
Fig 11 summarize the comparative results of each method on BRATS 2015 challenge dataset, we compute the average sensitivity, specificity, and Dice index of each method against the manual ground truth. It shows that proposed method has demonstrated the capability and best rate of segmentation. The Chan-Vese method could not manage to get desired results, LBF and LCV methods have good Dice index values but their sensitivity and specificity values are not satisfactory, Wang et al method perform better with values close to the ground truth in some cases however it is unable to delineate proper boundaries in majority cases finally, proposed method on the other hand consistently outperformed traditional methods and achieved good results.
Conclusion
In this paper, we have presented a hybrid novel two-stage segmentation method with application to synthetic and real (including medical) images combining global, local and edge intensity information. The first stage gets the intensity homogeneous segmentation result by employing global and edge information, after reaching to maximum number of iterations in the first stage we get the contour near the object boundaries. The second stage takes the final contour from the first stage and employs the local intensity and edge information to get the final accurate result for intensity inhomogeneous image segmentation. By using the concept of the two stages, proposed method provides an appropriate solution to the contour initialization which is a very common problem in traditional local active contour methods. Proposed method scales global and local region terms with edge function which prevents the boundary leakage and over segmentation problem. Finally, a Gaussian kernel is used to regularize the level set function and to avoid an expensive reinitialization.
The main contribution of our method is the formulation of the local and geodesic energy functional based on ESRAC [20] method for capturing intensity inhomogeneous regions. Initially, experimental results have been taken from a set of synthetic and real images in order to show the robustness of the proposed method. Finally, for qualitative and quantitative analysis we have evaluated the proposed method on publically available databse PH2 [28] for skin lesion and BRATS 2015 [27] for brain tumor segmentation. The comparative analysis shows that proposed method has obtained better results than previous state-of-art methods.
Supporting information
S1 Dataset. Contains synthetic and real images used in Figs 1, 3, 4, 5 and 6 (RAR).
https://doi.org/10.1371/journal.pone.0191827.s001
(ZIP)
Acknowledgments
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (NRF-2010-0025512).
References
- 1.
El-Baz A, Acharya R, Mirmehdi M, Suri jasjit. Multi modality state-of-the-art medical image segmentation and registration methodologies. Springer Science & Business Media. 2011(1)235–280.
- 2. Tian Y, Duan F, Mingquan Z, Wu Z. Active contour model combining region and edge information. intMachine vision and applications. 2013 24(1)(47–61).
- 3. Kass M, Witkin A, Terzopoulos D. Snakes: Active contour models. international journal of computer vision. 1988 1(4)(321–331).
- 4.
Li C, Xu C, Gui C, Fox MD. Level set evolution without re-initialization: a new variational formulation. IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05). 2005 1:430–436.
- 5. Caselles V, Kimmel R, Sapiro G. Geodesic active contours. International journal of computer vision. 1997 22(1):61–79.
- 6. Caselles V, Catté F, Coll T, Dibos F. A geometric model for active contours in image processing. Numerische mathematik. 1993 66(1):1–33.
- 7. Appleton B, Talbot H. Globally optimal geodesic active contours. Journal of Mathematical Imaging and Vision. 2005 23(1):67–86.
- 8. Yezzi A, Kichenassamy S, Kumar A, Olver P, Tannenbaum A. A geometric snake model for segmentation of medical imagery. IEEE Transactions on medical imaging. 1997 16(2):16–02.
- 9. Xiang Y, Chung AC, Ye J. An active contour model for image segmentation based on elastic interaction. Journal of computational physics. 2006 219(1):455–476.
- 10. Mumford D, Shah J. Optimal approximations by piecewise smooth functions and associated variational problems. Communications on pure and applied mathematics. 1989 42(5):577–685.
- 11. Lie J, Lysaker M, Tai XC. A binary level set model and some applications to Mumford-Shah image segmentation. IEEE Transactions on Image Processing. 2006 5(15):1171–1181.
- 12. Chan TF, Vese LA. Active contours without edges. IEEE Transactions on image processing. 2001 10(2):266–277. pmid:18249617
- 13.
Li C, Kao CY, Gore JC, Ding Z. Implicit active contours driven by local binary fitting energy. IEEE Conference on Computer Vision and Pattern Recognition. 2007:1–7.
- 14. Li C, Kao CY, Gore JC, Ding Z. Minimization of region-scalable fitting energy for image segmentation. IEEE transactions on image processing. 2008 17(10):1940–1949. pmid:18784040
- 15. Li C, Huang R, Ding Z, Gatenby JC, Metaxas DN, Gore JC. A level set method for image segmentation in the presence of intensity inhomogeneities with application to MRI. IEEE Transactions on Image Processing. 2011 20(07):2007–2016. pmid:21518662
- 16. Lankton S, Tannenbaum A. Localizing region-based active contours. IEEE transactions on image processing. 2008 17(11):2029–2039. pmid:18854247
- 17. Zhang K, Zhang L, Song H, Zhou W. Active contours with selective local or global segmentation: a new formulation and level set method. Image and Vision computing. 2010 28(04):668–679.
- 18. Wang L, Li C, Sun Q, Xia D, Kao CY. Active contours driven by local and global intensity fitting energy with application to brain MR image segmentation. Computerized Medical Imaging and Graphics. 2009 33(07):520–531. pmid:19482457
- 19. Zhang L, Peng X, Li G, Li H. A novel active contour model for image segmentation using local and global region-based information. Machine Vision and Applications. 2016:1–16.
- 20. Oh J, Martin DR, Hu X. Partitioned edge-function-scaled region-based active contour (p-ESRAC): Automated liver segmentation in multiphase contrast-enhanced MRI. Medical physics. 2014 41(04).
- 21. Wang H, Huang TZ, Xu Z, Wang Y. A two-stage image segmentation via global and local region active contours. Neurocomputing. 2016 (205):130–140.
- 22. Soomro S, Akram F, Kim JH, Soomro TA, Choi KN. Active Contours Using Additive Local and Global Intensity Fitting Models for Intensity Inhomogeneous Image Segmentation. Computational and Mathematical Methods in Medicine. 2016. pmid:27800011
- 23. Soomro S, Akram F, Munir A, Lee CH, Choi KN. Segmentation of Left and Right Ventricles in Cardiac MRI Using Active Contours. Computational and Mathematical Methods in Medicine. 2017. pmid:28928796
- 24. Zhu S, Liu C, Wu Q Binary level set methods for topology and shape optimization of a two-density inhomogeneous drum. Computer Methods in Applied Mechanics and Engineering, 2010 199: 2970–2986.
- 25. Liu C, Zhu S. A Semi-implicit binary level set method for source reconstruction problems. International Journal of Numerical Analysis & Modeling, 2011 8: 410–426.
- 26. Liu C, Dong F, Zhu S, Kong D, Liu K. New variational formulations for level set evolution without reinitialization with applications to image segmentation. Journal of Mathematical Imaging and Vision, 2011 41: 194–209.
- 27. Menze BH, Jakab A, Bauer S, Kalpathy CJ, Farahani K, Kirby J, et al. The multimodal brain tumor image segmentation benchmark (BRATS). IEEE transactions on medical imaging. 2015 (34)10:1993–2024. pmid:25494501
- 28.
Mendonça T, Ferreira PM, Marques JS, Marcal A RS, Rozeira J. PH 2-A dermoscopic image database for research and benchmarking. Engineering in Medicine and Biology Society (EMBC), 2013 35th Annual International Conference of the IEEE. 2013:5437–5440.
- 29.
Aubert G, Kornprobst P. Mathematical problems in image processing: partial differential equations and the calculus of variations. Springer Science & Business Media. 2006(147).
- 30. Balch CM, Buzaid AC, Soong SJ, Atkins MB, Cascinelli N, Coit DG, et al. Final version of the American Joint Committee on Cancer staging system for cutaneous melanoma. Journal of Clinical Oncology. 2001 19(16):3635–3648. pmid:11504745
- 31. Bauer S, Wiest R, Nolte LP, Reyes M. A survey of MRI-based medical image analysis for brain tumor studies. Physics in medicine and biology. 2013 58(13):R97. pmid:23743802
- 32. Ilunga-Mbuyamba E, Avina-Cervantes JG, Garcia-Perez A, de Jesus Romero TR, Aguirre RH, Cruz AI, et al. Localized active contour model with background intensity compensation applied on automatic MR brain tumor segmentation. Neurocomputing. 2017 220:84–97.