- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Computational and Mathematical Methods in Medicine
Volume 2013 (2013), Article ID 190304, 14 pages
Multiple Active Contours Guided by Differential Evolution for Medical Image Segmentation
Universidad de Guanajuato, Division de Ingenierias Campus, Irapuato-Salamanca, Carretera Salamanca-Valle de Santiago, Km 3.5+1.8 Km Comunidad de Palo Blanco, C.P. 36885, Salamanca, GTO, Mexico
Received 14 February 2013; Accepted 19 June 2013
Academic Editor: J. M. Górriz
Copyright © 2013 I. Cruz-Aceves et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
This paper presents a new image segmentation method based on multiple active contours guided by differential evolution, called MACDE. The segmentation method uses differential evolution over a polar coordinate system to increase the exploration and exploitation capabilities regarding the classical active contour model. To evaluate the performance of the proposed method, a set of synthetic images with complex objects, Gaussian noise, and deep concavities is introduced. Subsequently, MACDE is applied on datasets of sequential computed tomography and magnetic resonance images which contain the human heart and the human left ventricle, respectively. Finally, to obtain a quantitative and qualitative evaluation of the medical image segmentations compared to regions outlined by experts, a set of distance and similarity metrics has been adopted. According to the experimental results, MACDE outperforms the classical active contour model and the interactive Tseng method in terms of efficiency and robustness for obtaining the optimal control points and attains a high accuracy segmentation.
Computed tomography (CT) scanning and magnetic resonance imaging (MRI) are widely used in medical tests since they represent a noninvasive and painless modalities for the diagnosis of cardiac disease. In clinical practice, the process performed by a cardiologist on medical images can be subjective, labor intensive, and susceptible to errors because it is based on a visual examination followed by a manual delineation of the human organ. Consequently, the application of computational techniques in order to obtain a more efficient and accurate image segmentation within an acceptable time plays an essential role.
In medical image analysis, the automatic segmentation of human organs is an important and challenging task. In the literature, several techniques have been reported for this purpose such as, region growing in pelvic injuries , improved watershed transform for tumors in mammograms , enhanced suppressed fuzzy c-means to work with brain magnetic resonance images , wavelet transform in dermoscopic images , templates for atlas in radiotherapy , and active contour models (ACMs) in mammographic images [6, 7]. This method was introduced by  and it is an energy-minimizing spline that consists of control points also called snaxels. This spline evolves through the evaluation of internal and external forces according to the shape of the object to be segmented. ACM has been extensively used in medical applications such as segmentation of human prostate , intravascular ultrasound images , breast lesions , and breast tumors .
In the traditional implementation of active contour model there exist two main weaknesses. The first drawback is the initialization of control points, which must be close to the object of interest to achieve a favorable segmentation otherwise failure of convergence will occur. The second drawback is the propensity to stagnate in local minima giving an inaccurate convergence to the boundaries of the object. To solve these disadvantages some improvements have been suggested to adapt different methods to work together with ACM including statistical methods [13, 14], graph cut , population based-methods such as particle swarm optimization (PSO) working with polar sections , static large searching windows  and by adapting the PSO velocity equation , genetic algorithms [19, 20], and differential evolution . The performance of the population based-methods working together with ACM is very suitable according to the tests since the active contour becomes more stable, robust, and efficient in local minima problem.
Differential evolution (DE) is a stochastic and population-based optimization method similar to evolutionary algorithms suggested by [22, 23]. DE has become very popular for solving global optimization problems with nondifferentiable and nonlinear functions with a fast convergence. The efficiency and robustness of the DE method directly depend on the settings of the control parameters such as population size, selection method, differentiation factor, and the crossover probability constant which controls the number of generated solutions for each individual through generations. As DE is easy to implement, not computationally expensive and it is highly efficient solving optimization problems, it has been used in many real-world applications such as text summarization , design of reconfigurable antenna arrays , job shop scheduling problem , blade design of wind turbines , and in the parameter estimation for a human immunodeficiency virus (HIV) .
In this paper, we introduce a novel image segmentation method based on multiple active contours guided by differential evolution optimization technique, which divides the object of interest in polar sections. Each polar section has a population of individuals represented by control points to perform its particular search strategy in order to find the optimal control point (snaxel). Since the proposed method can appropriately overcome the drawback of initialization of the traditional ACM and the inaccurate convergence on the concave boundaries of an object, MACDE also addresses the problem of segmenting the human heart and the human left ventricle from datasets of sequential CT and magnetic resonance images, respectively. Finally, to visualize the segmentation results of CT images a 3D reconstruction approach of the human heart is presented.
The structure of this work is as follows. In Section 2, the fundamentals of active contour model and differential evolution are presented. In Section 3, the proposed MACDE method is introduced, along with a set of validation metrics to evaluate its performance. The experimental results are discussed in Section 4, and from the similarity metrics, conclusions are presented in Section 5.
In this section, the fundamentals of the active contour model and differential evolution optimization technique are explained in detail.
2.1. Active Contour Model
Active contour model (ACM), also known as snake, is a parametric curve, which can move within the spatial domain of an image where it was assigned. The snake is defined by , , where represents the time parameter whereby the curve evolves in order to minimize the total energy function given by The above-mentioned energy function consists of two components: that represents the internal energy and the external energy. The internal energy presented in (2) is composed by the first derivative of guided by the curve tension parameter and the second derivate of controlled by the rigidity parameter . This energy keeps the search performed by the control points within the spatial image domain and also it controls the shape modification of the parametric curve as follows: The external energy represented by (3) is given by the particular features of the search space, where is a weight parameter and is the surface gradient computed at achieving the optimal solution by solving the Euler equation (4), when both external and internal energies become stable
In the discrete computational implementation of ACM, the snake is composed by a number of discrete points . The discrete formulation of internal and external energies are approximated by (5) and (6), respectively, where represents the current snake control point and the index point within its searching static window. Accordingly, the local energy function is given by (7), in which the minimization process is iteratively performed by using (8), where is the predefined searching window for the control point and is obtained by minimizing the local energy function : There exist two main weaknesses in the traditional implementation of ACM. Firstly, sensitivity to the initial positioning of the control points (snaxels) and secondly, the propensity to stagnate in local minima deflecting the snake of the optimum edge of the object of interest. In order to overcome the aforementioned drawbacks of the ACM, a population-based technique such as differential evolution optimization (DE) has been adopted, which is described in the following Section 2.2.
2.2. Differential Evolution
Differential evolution (DE) is a stochastic real-parameter heuristic proposed by [22, 23] for numerical global optimization problems similar to standard evolutionary algorithms. DE starts with a set of randomly initialized potential solutions, called individuals , where is the population size. These individuals are gradually improved by applying different variation operators and the solution is chosen to be the individual with the best fitness according to an objective function.
The fundamental idea behind DE algorithm consists of three evolutionary principles: mutation, crossover, and selection on the floating-point encoding. The mutation step creates a mutant vector at each generation based on the distribution of the current population by performing the classical mutation strategy presented in where , , and represent the indexes of three individuals mutually different and uniformly selected from the set and the represents the differentiation factor also known as scaling or mutation factor parameter. After the mutation process, the crossover operator is applied based on (10), to create the trial vector where is a uniform random value on the interval , which is compared with the (crossover rate) parameter. If is bigger than , the current information of individual is conserved, otherwise the values from the mutant vector are copied to the trial vector . Subsequently, the selection procedure is applied by using (11) to minimization process. This procedure selects, according to a fitness function, the better one between the trial vector and the individual . The selected vector is used to replace the current individual in the next generation:
According to the previous description, the classical DE algorithm is described by using the following procedure. (1)Initialize number of generations , population size , value of differentiation factor , and value of crossover rate . (2)Initialize each individual by generating random candidate solutions. (3)For each individual , where : (a)compute by using the mutation step (9); (b)assign according to the crossover operator (10); (c)update , if is better than by applying the selection step (11).(4)If stopping criterion is satisfied (e.g., stability or number of generations), then stop.
3. Proposed Image Segmentation Method
The proposed MACDE method based on differential evolution and multiple active contours is described in Section 3.1. In addition, to obtain a quantitative evaluation of the segmentation results obtained from the proposed method, the set of similarity metrics is explained in Section 3.2.
3.1. Multiple Active Contours Guided by Differential Evolution (MACDE)
Because of the classical ACM weaknesses discussed above, differential evolution is adopted to solve the local minima drawback by guiding the convergence of multiple active contours on a polar coordinate system similar to . Since DE is directly applied in the segmentation task performed by MACDE, the advantages of robustness, low computational time, and efficiency are preserved. The proposed method presents three main advantages on the initialization process, which must be considered to adapt it to the shape of the object of interest. Firstly, the initial contours can be automatically defined in a circular or elliptical shape. Secondly, the number of snaxels (individuals) can be modified according to the number of polar sections in which the object of interest is divided. The third advantage is the origin or seed point created interactively by the user to generate all the snaxels automatically on the constrained spatial domain of the object of interest. This latter advantage allows to use the proposed method in the segmentation of stacks of sequential CT and MR images in order to obtain a 3D reconstruction approach of human organs by just reproducing the origin point through the set of images along with the predefined parameters.
The procedure of MACDE segmentation method consists of three steps and it is illustrated in Figure 1. The preprocessing stage reduces noise from the image by using a 2D median filter (3 × 3 window size), followed by the Canny edge detector (, , and ) to detect the boundary between the background and regions of interest. These parameters have been experimentally tuned to preserve the real edges in the image, since these can affect the segmentation result. The final step in this stage is to compute the Euclidean distance map (EDM) according to . The EDM is used to perform the minimization process because it represents a potential surface, where high potential values are assigned to the image pixels located far from the target object, and low potential values (ideally zero) to pixels located close to the object. The initialization procedure on the resulting distance map represents the second stage of MACDE, where a polar coordinate system is generated through an interactively determined seed point composed by the and coordinates of the pixel where it was assigned. This coordinate system divides the target object via , where represents the degrees of each constrained polar section , in which one edge sectional solution must exist. Additionally, the target object has to be confined by the spatial domain of the predefined initial contours and assign equidistant control points as individuals to conform one population for each polar section . The third stage of MACDE is the segmentation process, where for each section , the DE strategy is applied to minimize the corresponding edge sectional solution by evaluating the individuals according to the external energy (fitness function) derived from (6). When the optimization process for each population is finished, the segmented object is acquired connecting the best individuals of each polar section to each other.
The procedure of the proposed MACDE image segmentation method is described as follows. (1)Compute the preprocessing step (median filter, Canny edge detector, and Euclidean distance map). (2)Initialize coordinates of the interactive seed point, degrees , and number of snakes. (3)Initialize parameters of DE algorithm: number of generations , differentiation factor , and crossover rate . (4)Generate one population for each polar section assigning the current snaxels as individuals. (5)For each population , we have the following. (a)For each individual , where : (i)compute by using the mutation step (9); (ii)assign according to the crossover operator (10); (iii)apply restriction of the search space to ignore improper solutions; (iv)evaluate in fitness function (6); (v)update , if is better than by applying the selection step (11). (b)If the stopping criterion is satisfied (e.g., stability or number of generations), then stop, otherwise go to step (a).(6)Stop MACDE method.
3.2. Validation Metrics
To assess the medical image segmentations performed by the proposed method regarding the classical ACM and the regions outlined by two experts, Jaccard index, Dice index, and the Haussdorf distance have been adopted.
The Jaccard index and Dice index are similarity measures located in the range used to compare binary variables . These indexes are computed by using (12) and (13), respectively. In this work, the regions segmented through computational methods (MACDE and classical ACM) are represented by , and is used to represent the regions outlined by the experts. In these similarity measures if regions and are completely superimposed the obtained result is 1, and 0 when these two regions are completely different
The Hausdorff distance is a widely used metric for shape matching in medical image segmentation. This metric measures the similarity between two superimposed sets by using (14), where and represent points defined in sets and , respectively, and is a some underlying distance (Euclidean distance in our tests)
In Section 4, the segmentation results obtained from the proposed MACDE method on different synthetic and medical images are presented and analyzed by the validation metrics.
4. Experimental Results
In this section, the proposed MACDE method is applied firstly, on synthetic images with several concavities and noise, and secondly, to segment the human heart and the human left ventricle from computed tomography and magnetic resonance images. The computational implementations are performed using the gcc compiler version 4.4.5 running on Debian GNU/Linux 6.0, Intel Core i3 with 2.13 Ghz and 4 Gb of memory.
4.1. Application on Synthetic Images
In Figure 2 an image of size 160 × 160 pixels containing an artificial star is presented. The segmentation result obtained by classical ACM implementation using 42 control points is shown in Figure 2(a). The ACM parameters are set as , , and giving an executing time of 0.090 s. In this figure the ACM implementation cannot overcome the concavity problem to fit the star boundary, which is solved through MACDE implementation as shown in Figure 2(b). In this simulation MACDE parameters are set as , , , , and number of snakes = 15, with an executing time of the optimization process of 0.140 s. The MACDE segmentation result on the Euclidean distance map is presented in Figure 2(c). This distance map is also represented as the 3D distance potential surface, in which the convergence of the optimized control points is illustrated in Figure 2(d).
Figure 3 introduces an image of size 300 × 300 pixels consisting of a circle with Gaussian noise (, ). The Euclidean distance map shown in Figure 3(a) is computed from the original image and illustrates the local minima problem present in the test image. The result obtained by classical ACM using 42 control points is shown in Figure 3(b), where due to the noise it cannot adjust the circle boundary accurately. The ACM parameters are set as , , and requiring an executing time of 0.104 s. On the other hand, MACDE method can solve the local minima problem and locate the circle boundary accurately as shown in Figure 3(c). The optimized control points on the distance potential surface are presented in Figure 3(d) which are acquired with the MACDE parameters , , , , number of snakes = 15, and the optimization process is performed with an executing time of 0.138 s.
In Figure 4 an image of 150 × 150 pixels containing a synthetic object is introduced. The Euclidean distance map derived from the original image is presented in Figure 4(a) where the concavity problem is clearly evident. The segmentation result obtained by classical ACM using 42 control points cannot find the concavities of the object as shown in Figure 4(b). The ACM parameters of this simulation are set as , , and requiring an executing time of 0.101 s. Moreover, MACDE method can adjust the object boundary overcoming the concavity problem as illustrated in Figure 4(c) and in the distance potential surface in Figure 4(d). The MACDE parameters used in this test are set as , , , , and number of snakes = 15, achieving the optimization process in an executing time of 0.142 s.
The use of differential evolution in MACDE method provides robustness and accuracy in the three synthetic test images regarding classical ACM. Even though the computational time of the optimization process performed by MACDE is competitive with the segmentation process carried out by the traditional ACM, the proposed method improves the segmentation results avoiding local minima and concavity problems. In Section 4.2, MACDE is applied on cardiac medical images, and the segmentation results are evaluated through different distance and similarity measures.
4.2. Application on Medical Images
In this section, MACDE method is used in the segmentation of the human heart and the human left ventricle from datasets of sequential CT and MR images, respectively. The CT images have been supplied by the Mexican Social Security Institute, and the MR images have been provided by the Auckland MRI Research Group, University of Auckland.
In Figure 5(a) a 512 × 512 pixels CT image is presented in order to compare the human heart segmentation obtained by cardiologists in Figure 5(b), by applying the classical ACM in Figure 5(c), and by using MACDE method in Figure 5(d). The ACM parameters are set as , , and , number of control points = 49, requiring an execution time of 0.157 s. Moreover, the MACDE segmentation fits the heart boundary appropriately in contrast to ACM, according to the manual delineation by experts, using parameters , , , , and number of snakes = 12, achieving the optimization process in an executing time of 0.212 s.
Figure 6 shows the process of convergence of MACDE method in the human heart segmentation on a CT image. This convergence is computed through generations using the average fitness of the individuals on the distance potential surface.
In order to introduce the human left ventricle segmentation task, in Figure 7(a) a low-contrast, 512 × 512 pixels MR image is shown. Figure 7(b) shows the Euclidean distance map computed from the test image to get a better approximation of the search space where the computational techniques perform the optimization process. Besides, in Figures 7(c) and 7(d) the manual delineation performed by expert 1 and expert 2, respectively, are presented. Figure 7(e) illustrates the segmentation result applying the classical ACM with parameters set as , , , and number of control points = 45, involving an execution time of 0.235 s. Finally, Figure 7(f) presents the MACDE segmentation result, which fits the left ventricle accurately with parameters set as , , , , and number of snakes = 12. The optimization process performed by MACDE in this test image involved an executing time of 0.295 s, and it is presented in Figure 8, where the convergence is calculated through generations using the average fitness of individuals.
The initialization methodology of MACDE allows work with sequential images easily, since just the seed point coordinates and the initial parameters are required for segmenting the whole set of images. This is an advantage over the classical ACM, because in MACDE only one user interaction is needed, while in ACM each control point is generally provided by the user resulting in a laborious task.
In Figure 9 the human heart segmentation results on a subset of CT images are presented. The whole dataset consists of 144 CT images of size 512 × 512 pixels from different patients. Figure 9(a) illustrates the segmentation results obtained by classical ACM, where the concavity problem is clearly shown. The ACM parameters are set as , , , and control points = 45, requiring an average executing time of 0.163 s per image. Figure 9(b) shows the human heart segmentations obtained with the interactive Tseng method. The parameters of this simulation were tuned according to  as 45 control points, 9 particles for each swarm, and window size 30 × 30 pixels, given an average executing time of 0.176 s per image. Figure 9(c) presents the segmentation results obtained by MACDE, which fit to heart boundary in a suitable way. The MACDE parameters are set as , , , , and number of snakes = 12, involving an average execution time of 0.194 s per image. On the other hand, the average similarity measures listed in Table 1 are used to assess the regions segmented by computational methods and manual delineations by experts, which indicates that MACDE segmentation method is promising in human heart segmentation.
In Figure 10 the human left ventricle segmentation results on a subset of MR images are presented. The whole dataset is composed by 23 MR images of size 512 × 512 pixels. Figure 10(a) shows the segmentation results obtained with classical ACM, where the local minima problem leads to an inaccurate convergence to left ventricle boundary. The ACM parameters in these tests are set as , , , and control points = 42, demanding an average execution time of 0.221 s per image. Figure 10(b) shows the segmentation results by applying the Tseng method. The parameters of this simulation were experimentally chosen as 42 control points, window size as 30 × 30, and 15 particles for each swarm, given an average executing time of 0.253 s per image. In Figure 10(c) the regions segmented by MACDE are illustrated. These segmentation results fit properly to the left ventricle boundary with parameters set as , , , , and number of snakes = 12, requiring an average execution time of 0.275 s per image. Moreover, to quantify the segmentation results, Table 2 presents the comparative analysis through Dice index, Jaccard index, and Haussdorf distance between computational methods and manual delineations by experts. This similarity analysis suggests that MACDE is competitive regarding regions outlined by experts, and it is more accurate than the classical ACM, and the interactive Tseng method.
Finally, in order to visualize the segmentation results acquired from sequential CT images, 3D reconstruction approaches obtained from the experts, classical ACM and the proposed MACDE method are presented in Figure 11. The quality of the 3D reconstruction depends on the number of sequential images, and the approaches presented below consist of 18 CT images, which are achieved through superposition of the resulting contours according to the image acquisition order. These reconstructions illustrate a significant effectiveness and stability of MACDE in the human heart segmentation.
In this paper, a novel image segmentation method based on multiple active contours guided by differential evolution (MACDE) has been proposed. The segmentation method has introduced some important advantages regarding the classical active contour model and the interactive Tseng method, in particular, the partitioning of the region of interest in polar sections to overcome the local minima problem and the sensitivity to initial contour position. In order to evaluate the performance of the proposed method, some experiments with synthetic images following by experiments with cardiac medical images acquired from the computed tomography and magnetic resonance procedures were presented. The experimental results demonstrated the efficiency and stability of MACDE in the presence of noise and deep concavities. These advantages made it possible to attain a high accuracy in the human heart and human left ventricle segmentations compared to the regions outlined by experts according to the evidence showed by the set of similarity metrics. In addition, the experimental results have also revealed that MACDE is highly suitable for medical image applications, including the segmentation of sequential medical images within a competitive computational time.
This work has been supported by the National Council of Science and Technology of México (CONACYT) under Grant no. 241224-218157. The authors wish to thank the Auckland MRI Research Group (Cardiac Atlas Website), University of Auckland the sources of Magnetic Resonance Imaging. The authors thank Dr. R. Mendoza-Goméz and Dr. F.J. Solórzano-Zepeda at the Cardiology Deparment of the Mexican Social Security Institute, UMAE T1 León for their clinical advice and assistance during data collection.
- P. Davuluri, J. Wu, Y. Tang et al., “Hemorrhage detection and segmentation in traumatic pelvic injuries,” Computational and Mathematical Methods in Medicine, vol. 2012, Article ID 898430, 12 pages, 2012.
- W.-Y. Hsu, “Improved watershed transform for tumor segmentation: application to mammogram image compression,” Expert Systems with Applications, vol. 39, no. 4, pp. 3950–3955, 2012.
- A. Nyma, M. Kang, Y. Kwon, C. Kim, and J. Kim, “A hybrid technique for medical image segmentation,” Journal of Biomedicine and Biotechnology, vol. 2012, Article ID 830252, 7 pages, 2012.
- H. Castillejos, V. Ponomaryov, L. N. de Rivera, and V. Golikov, “Wavelet transform fuzzy algorithms for dermoscopic image segmentation,” Computational and Mathematical Methods in Medicine, vol. 2012, Article ID 578721, 11 pages, 2012.
- A. Parraga, B. Macq, and M. D. Craene, “Anatomical atlas in the context of head and neck radiotherapy and its use to automatic segmentation,” Biomedical Signal Processing and Control, vol. 7, no. 5, pp. 447–455, 2012.
- A. Jumaat, W. Rahman, A. Ibrahim, and R. Mahmud, “Segmentation of masses from breast ultrasound images using parametric active contour algorithm,” Procedia-Social and Behavioral Sciences, vol. 8, pp. 640–647, 2010.
- Q. Abbas, M. Celebi, and I. Garciia, “Breast mass segmentation using region-based and edge-based methods in a 4-stage multiscale system,” Biomedical Signal Processing and Control, vol. 8, no. 2, pp. 204–214, 2012.
- M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: active contour models,” International Journal of Computer Vision, vol. 1, no. 4, pp. 321–331, 1988.
- X. Liu, M. A. Haider, and I. S. Yetik, “Unsupervised 3D prostate segmentation based on diffusion-weighted imaging MRI using active contour models with a shape prior,” Journal of Electrical and Computer Engineering, vol. 2011, Article ID 410912, 11 pages, 2011.
- X. Zhu, P. Zhang, J. Shao, Y. Cheng, Y. Zhang, and J. Bai, “A snake-based method for segmentation of intravascular ultrasound images and its in vivo validation,” Ultrasonics, vol. 51, no. 2, pp. 181–189, 2011.
- Y. Pang, L. Li, W. Hu, Y. Peng, L. Liu, and Y. Shao, “Computerized segmentation and characterization of breast lesions in dynamic contrast-enhanced mr images using fuzzy c-means clustering and snake algorithm,” Computational and Mathematical Methods in Medicine, vol. 2012, Article ID 634907, 10 pages, 2012.
- L. Gao, X. Liu, and W. Chen, “Phase- and gvf-based level set segmentation of ultrasonic breast tumors,” Journal of Applied Mathematics, vol. 2012, Article ID 810805, 22 pages, 2012.
- L. Wang, L. He, A. Mishra, and C. Li, “Active contours driven by local Gaussian distribution fitting energy,” Signal Processing, vol. 89, no. 12, pp. 2435–2447, 2009.
- B. Liu, H. D. Cheng, J. Huang, J. Tian, X. Tang, and J. Liu, “Probability density difference-based active contour for ultrasound image segmentation,” Pattern Recognition, vol. 43, no. 6, pp. 2028–2042, 2010.
- Y. Cheng, Z. Wang, J. Hu, W. Zhao, and Q. Wu, “The domain knowledge based graph-cut model for liver ct segmentation,” Biomedical Signal Processing and Control, vol. 7, pp. 591–598, 2012.
- I. Cruz-Aceves, J. Avina-Cervantes, J. Lopez-Hernandez, and S. Gonzalez-Reyna, “Multiple active contours driven by particle swarm optimization for cardiac medical image segmentation,” Computational and Mathematical Methods in Medicine, vol. 2013, Article ID 132953, 13 pages, 2013.
- C.-C. Tseng, J.-G. Hsieh, and J.-H. Jeng, “Active contour model via multi-population particle swarm optimization,” Expert Systems with Applications, vol. 36, no. 3, pp. 5348–5352, 2009.
- E. Shahamatnia and M. M. Ebadzadeh, “Application of particle swarm optimization and snake model hybrid on medical imaging,” in Proceedings of the 3rd International Workshop on Computational Intelligence in Medical Imaging (CIMI '11), pp. 23–30, Paris, France, April 2011.
- L. Ballerini, “Genetic snakes for medical images segmentation,” in Proceedings of the 1st European Workshops on Evolutionary Image Analysis, Signal Processing and Telecommunications (EuroEcTel '99), vol. 1596, pp. 59–73, Springer, Göteborg, Sweden.
- M. Talebi, A. Ayatollahi, and A. Kermani, “Medical ultrasound image segmentation using genetic active contour,” Journal of Biomedical Science and Engineering, vol. 4, pp. 105–109, 2011.
- J. Novo, J. Santos, and M. Penedo, “Topological active models optimization with differential evolution,” Expert Systems With Applications, vol. 00, pp. 1–28, 2012.
- R. Storn and K. Price, “Differential evolution–a simple and efficient adaptive scheme for global optimization over continuous spaces,” Tech. Rep. TR-95-012, International Computer Sciences Institute, Berkeley, Calif, USA, 1995.
- R. Storn and K. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997.
- R. Alguliev, R. Aliguliyev, and C. Mehdiyev, “pSum-Sade: a modified p-median problem and self-adaptive differential evolution algorithm for text summarization,” Applied Computational Intelligence and Soft Computing, vol. 2011, Article ID 351498, 13 pages, 2011.
- X. Li and M. Yin, “Hybrid differential evolution with biogeography-based optimization for design of a reconfigurable antenna array with discrete phase shifters,” International Journal of Antennas and Propagation, vol. 2011, Article ID 685629, 12 pages, 2011.
- R. Zhang and C. Wu, “A hybrid differential evolution and tree search algorithm for the job shop scheduling problem,” Mathematical Problems in Engineering, vol. 2011, Article ID 390593, 20 pages, 2011.
- T. Carrigan, B. Dennis, Z. Han, and B. Wang, “Aerodynamic shape optimization of a vertical-axis wind turbine using differential evolution,” ISRN Renewable Energy, vol. 2012, Article ID 528418, 16 pages, 2012.
- W.-H. Ho and A. L.-F. Chan, “Hybrid Taguchi-differential evolution algorithm for parameter estimation of differential equation models with application to HIV dynamics,” Mathematical Problems in Engineering, vol. 2011, Article ID 514756, 14 pages, 2011.
- L. D. Cohen and I. Cohen, “Finite-element methods for active contour models and balloons for 2-D and 3-D images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 15, no. 11, pp. 1131–1147, 1993.