Research Article | Open Access

Xiaosheng Yu, Yuanchen Qi, Ziwei Lu, Nan Hu, "Implicit Active Contours Driven by Local and Global Image Fitting Energy for Image Segmentation and Target Localization", *Journal of Sensors*, vol. 2013, Article ID 713536, 8 pages, 2013. https://doi.org/10.1155/2013/713536

# Implicit Active Contours Driven by Local and Global Image Fitting Energy for Image Segmentation and Target Localization

**Academic Editor:**Long Cheng

#### Abstract

We propose a novel active contour model in a variational level set formulation for image segmentation and target localization. We combine a local image fitting term and a global image fitting term to drive the contour evolution. Our model can efficiently segment the images with intensity inhomogeneity with the contour starting anywhere in the image. In its numerical implementation, an efficient numerical schema is used to ensure sufficient numerical accuracy. We validated its effectiveness in numerous synthetic images and real images, and the promising experimental results show its advantages in terms of accuracy, efficiency, and robustness.

#### 1. Introduction

Image segmentation is one of the most important operations in the fields of image processing and computer vision. In the past two decades, image segmentation techniques have been widely studied and various novel methods have been proposed; especially the active contour models [1], which are based on the theory of surface evolution and geometric flows, have many successful and promising applications. The basic idea of the active contour models is to define dynamic curves which are evolved in an image domain under the constraints of internal forces and external forces. Generally, the internal forces are derived from the curve itself and the external forces are generated from the image. Active contour models are originally presented in terms of a parametric contour with some drawbacks associated with the difficulty in coping with the complex topological changes and poor dependency of parameterization. Later the level set [2] method was introduced to represent the contour, which improves the active contour models to be completely free of these drawbacks. In the level set method, the contour is represented as the zero level set of a higher dimensional function which is usually called a level set function, and hence the motion of the contour can be implicitly shown by the evolution of the level set function. Motivated by the level set method, a large number of researchers focused on the study of the implicit active contour, including the definition of the image-based driven force, the adaptation to different applications, and the numerical stability.

According to the difference of image-based nature constraints, the existing active contours models can be categorized into two types: edge-based models [3–7] and region-based models [8–13]. The edge-based models, which typically employ image gradient to construct an edge detector to attract the contours toward the desired boundaries of the objects and finally guarantee the contour evolution stopping on these boundaries. An additional balloon force is often introduced into the evolution functions to enlarge the capture range of the force filed and control the contour to shrink or expand. In practice, they have yielded many successful applications to general images with strong object boundaries. However, they may suffer from some terrible problems such as initialization, boundary leakage, and trapping into local minimum [8], which produce undesirable effects for image segmentation.

Region-based active contour models employ the image statistical information inside and outside the contour to construct the constraints derived from the image data to control the whole evolution process. Compared with the edge-based models, region-based models have the following advantages in terms of the initial contour localization and the boundary antileakage and antinoise capability. First, region-based models have more freedom for the initialization of the contour and the exterior and interior contours can be detected simultaneously. Second, they are significantly less sensitive to noise and can efficiently segment the images with weak edges or even without edges. One of the most popular region-based models is the C-V model, which has been widely applied to binary phase segmentation [9] with the assumption that images only have two regions and each region is completely homogeneous. However, the C-V model fails to segment the images with intensity inhomogeneity.

In order to overcome the considerable segmentation difficulties caused by intensity inhomogeneity, Zhang et al. [12] proposed a local image fitting (LIF) model. The LIF model utilizes the local image information and hence is able to provide desired results. However, the LIF model is sensitive to the initialization of contour, which limits its practical applications.

In this paper, we propose a novel region-based active contour model that has better segmentation performance in the presence of intensity inhomogeneity. We introduce a global image fitting term into the energy functional of the LIF model, which significantly improves the LIF model to be robust with the initial contour being anywhere in the image. An efficient numerical schema is used to ensure sufficient numerical accuracy. The experimental results show its advantages in terms of accuracy, efficiency, and robustness.

This paper is organized as follows. Section 2 introduces the classic C-V and LIF models. Section 3 presents the formulation and implementation of the proposed model. Section 4 validates the proposed model by extensive experiments on synthetic and real images. Section 5 concludes the paper.

#### 2. C-V and LIF

##### 2.1. C-V Model

Chan and Vese [8] presented an active contour model to solve the Munford-Shah problem with a special assumption that the input image is piecewise constant. They defined the following energy functional: where , , , and are fixed nonnegative parameters. and are two constants that approximate the image intensities of the regions inside and outside the contour , respectively. Representing the energy functional with a level set formulating and minimizing it, we obtain the following variational formulation: where is the level set function and and are given by is the global image fitting force, which uses the global statistical information of the input image to guide the contour propagation. C-V model has an important property that it is less sensitive to the initial contour. However, if the image intensities are inhomogeneity, and will be far different from the real image data. Hence, the C-V model fails to provide a desired segmentation result.

##### 2.2. LIF Model

Zhang et al. [12] proposed a region-based active contour model which considers the local image information and achieves promising results. They defined the following energy functional: where is a local fitted image formulation which can be defined as follows: where and are defined by where is a rectangular window function such as a truncated Gaussian window or a constant window. and approximate the weighted averages of the image intensities in a window inside and outside the contour, respectively. Minimizing the energy functional by using the steepest descent method, we derive the gradient descent flow: In the above functions, is the regularized Heaviside function and is the corresponding Dirac function; they are expressed as where is a positive constant. The local fitted image is constructed by the intensity of points in a rectangular window. This localization property plays a decisive role in segmenting the images with intensity inhomogeneity. The local image fitting force controls the contour evolution. Obviously, when the contour is located in some positions where , the local image fitting force will be zero, which causes the evolution be trapped into local minima. Consequently, the segmentation result is completely relied on the initialization of the contour.

#### 3. The Proposed Model

##### 3.1. The Formulation of the Proposed Model

Motivated by the C-V model and LIF model, we define the following energy functional: where is a positive constant with . In order to regularize the zero level set, we need the length of the zero level set, which is defined by Now, the entire energy functional can be expressed as where is a constant as the weight of the length term .

Minimizing the energy functional with respect to by using the steepest descent method, we derive the gradient descent flow: where where , , , and are defined in (3), (4), and (7), respectively. It is obvious that in the level set evolution equation (13), the new image fitting force is a linear combination of the global image fitting force from the C-V model and the local image fitting force from the LIF model. The significance of this force can be explained as follows. The global image fitting force can make the C-V model less sensitive to the initial contour, and the local image fitting force can make the LIF success to segment the images intensity inhomogeneity. We combine these two forces with a proper weight so as to make the proposed model share the advantages of the C-V and LIF models. Hence, the proposed model can handle the intensity inhomogeneity efficiently, no matter where the initial contour starts in the image.

The parameter plays a significant role to balance the effect of these two forces, which should be chosen according to the degree of inhomogeneity. If the image is existed serious intensity inhomogeneity, we should select small in which case the contour evolution is mainly controlled by the local image fitting force. If intensity inhomogeneity is minor, we should select large . Thus, the motion of the contour is primarily dependant on the global image fitting force.

Our model is formulated based on the basic frameworks of the C-V model and LIF model. Obviously, if we set in (10) to 1 and 0, it will be the C-V model and LIF model, respectively. However, out model considers both the local and global image information, which makes it possess better segmentation property than the C-V and LIF model.

##### 3.2. The Implementation of the Proposed Model

In the traditional level set methods, the level set function is initialized to be a signed distance function (SDF) [2]. In order to prevent the level set function from becoming too steep or flat, a procedure called reinitialization is applied periodically to enforce the degraded level set function being the SDF. However, this procedure is very time consuming and often causes the undesirable side effect of moving the zero level set away from its original location [5]. Many methods [5, 6, 12, 14, 15] have been proposed to eliminate the reinitialization procedure, among which the Gaussian Filtering Regularized Level Set (GFRLS) method [12] is one of the most successful methods. The GFRLS method is completely free of the costly reinitialization procedure with a series of simple operations in level set evolution. In this paper, we utilize GFRLS method to implement the proposed model. In practice, the GFRLS method firstly initializes the level set function as a binary function and then applies a Gaussian filter to smooth the level set function after each iteration. In addition, in the level set evolution equation, the traditional regular term can be eliminated, and during evolution larger time step can be utilized to speed up the contour evolution. Finally, the level set evolution equation of the proposed model can be written as follows:

The approximation iterative equation of (15) can be written as where is the iteration number and is the time step. The major steps of the proposed model can be concluded as follows.(1)Initialize a level set function as where is a positive constant and is a region in the image.(2)Update , , , and using (3), (4), and (7), respectively.(3)Update the level set function according to (16).(4)Regularize the level set function with a Gaussian Kernel, , where is the standard deviation.(5)Return step 2 until the level set function has converged.

#### 4. Experimental Results

This section shows the segmentation results of the proposed model for both synthetic and real images of different modalities. All algorithms in the experiments are implemented in Matlab 7.8 on a 2.19-GHz Intel Pentium Dual personal computer. We select a truncated Gaussian window with standard deviation of size by , where is the greatest integer smaller than . There are parameters , , , , and in our model and , , and for the implementation. We use the following fixed parameters: , , , , and . The parameters and need to be tuned according to the images.

##### 4.1. Comparisons with the C-V Model

Figures 1 and 2 show the comparisons between C-V model and our model to segment an X-ray image of bone and a synthetic image, respectively. We use the same initial contours in both models for fair comparisons and set the parameters , and , . Obviously, intensity inhomogeneity occurs in these two images. It is clearly seen that the C-V model does not work well for them as explained in Section 2.1. By contrast, our model utilizes the local and global image fitting forces to drive the contour evolution and successfully extract the desired objects.

**(a)**

**(b)**

**(c)**

**(a)**

**(b)**

**(c)**

##### 4.2. Comparisons with the LIF Model

We apply our model to segment an infrared image of intensity inhomogeneity shown in Figure 3. We set the parameters and . Figure 3(a) shows the initial contours which are circular with the same radius in different positions of the image. Figures 3(b) and 3(c) show the results by the LIF model and our model, respectively. It can be observed that the LIF model yields an accurate result only when the contour started in the middle of the object. By contrast, our model provides desired segmentation results with all initializations.

**(a)**

**(b)**

**(c)**

Figure 4 illustrates the segmentation results on a CT image of heart by the LIF model and our model. We set the parameters and . Figure 4(a) shows the square initial contours. Figure 4(b) shows the results by the LIF model. The LIF model fails to segment ventricles with these initializations. Our model achieves the satisfactory results with the same initializations as shown in Figure 4(c).

**(a)**

**(b)**

**(c)**

Figure 5 shows the segmentation results on a vessel image by the LIF model and our model. We set the parameters and . The initial contours with different shapes are located around, inside, outside, and across the object, respectively. Figure 4(b) shows the results by the LIF model. Obviously, the LIF successfully extract the desired object only when the contour is outside of the object. Our model always detects the object of interest with the initial contour being anywhere in the image.

**(a)**

**(b)**

**(c)**

The above three experiments demonstrate that our model is robust to the initialization of the contour. In order to quantitatively evaluate the segmentation performance of our model and the LIF model in these three experiments, we utilize the Jaccard similarity (JS) [16] for comparison. JS can be defined by where and are the real segmentation result and ground truth, respectively. The closer the JS value to 1, the better the segmentation. In our experiment, we calculate the average of the JS values of our model and LIF model with different initializations. Figure 6 presents the JS values of these two models. It can be seen that our model has better performance with different initial contours.

#### 5. Conclusion

This paper presents a novel region-based active contour model in a variational level set formulation. Our model utilizes both the local and global image information to control the motion of the contour, and hence, it can efficiently handle intensity inhomogeneity with flexible initialization. Our model is implemented with GFRLS method, which can eliminate the requirement of reinitialization. Experiment results demonstrated that our model has better performance than the C-V model and LIF model.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgment

The research is supported by the National Science Foundation of China (61273078), Science Foundation of Liaoning (20102062), and Fundamental Research Funds for the Central Universities (N110604006).

#### References

- M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: active contour models,”
*International Journal of Computer Vision*, vol. 1, no. 4, pp. 321–331, 1988. View at: Publisher Site | Google Scholar - S. Osher and J. A. Sethian, “Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations,”
*Journal of Computational Physics*, vol. 79, no. 1, pp. 12–49, 1988. View at: Google Scholar - V. Caselles, R. Kimmel, and G. Sapiro, “Geodesic active contours,”
*International Journal of Computer Vision*, vol. 22, no. 1, pp. 61–79, 1997. View at: Google Scholar - N. Paragios, O. Mellina-Gottardo, and V. Ramesh, “Gradient vector flow fast geometric active contours,”
*IEEE Transactions on Pattern Analysis and Machine Intelligence*, vol. 26, no. 3, pp. 402–407, 2004. View at: Publisher Site | Google Scholar - C. Li, C. Xu, C. Gui, and M. D. Fox, “Level set evolution without re-initialization: a new variational formulation,” in
*Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '05)*, vol. 1, pp. 430–436, June 2005. View at: Google Scholar - C. Li, C. Xu, C. Gui, and M. D. Fox, “Distance regularized level set evolution and its application to image segmentation,”
*IEEE Transactions on Image Processing*, vol. 19, no. 12, pp. 3243–3254, 2010. View at: Publisher Site | Google Scholar - X. Xie and M. Mirmehdi, “MAC: magnetostatic active contour model,”
*IEEE Transactions on Pattern Analysis and Machine Intelligence*, vol. 30, no. 4, pp. 632–646, 2008. View at: Publisher Site | Google Scholar - T. F. Chan and L. A. Vese, “Active contours without edges,”
*IEEE Transactions on Image Processing*, vol. 10, no. 2, pp. 266–277, 2001. View at: Publisher Site | Google Scholar - C. Li, C. Kao, J. C. Gore, and Z. Ding, “Implicit active contours driven by local binary fitting energy,” in
*Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '07)*, pp. 1–7, Minneapolis, Minn, USA, June 2007. View at: Publisher Site | Google Scholar - 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. View at: Publisher Site | Google Scholar - C. Li, R. Huang, Z. Ding, J. C. Gatenby, D. N. Metaxas, and J. C. Gore, “A level set method for image segmentation in the presence of intensity inhomogeneities with application to MRI,”
*IEEE Transactions on Image Processing*, vol. 20, no. 7, pp. 2007–2016, 2011. View at: Publisher Site | Google Scholar - K. Zhang, H. Song, and L. Zhang, “Active contours driven by local image fitting energy,”
*Pattern Recognition*, vol. 43, no. 4, pp. 1199–1206, 2010. View at: Publisher Site | Google Scholar - K. Zhang, L. Zhang, and S. Zhang, “A variational multiphase level set approach to simultaneous segmentation and bias correction,” in
*Proceedings of the 17th IEEE International Conference on Image Processing (ICIP '10)*, pp. 4105–4108, Hong Kong, China, September 2010. View at: Publisher Site | Google Scholar - X. Xie, “Active contouring based on gradient vector interaction and constrained level set diffusion,”
*IEEE Transactions on Image Processing*, vol. 19, no. 1, pp. 154–164, 2010. View at: Publisher Site | Google Scholar - K. Zhang, L. Zhang, H. Song, and W. Zhou, “Active contours with selective local or global segmentation: a new formulation and level set method,”
*Image and Vision Computing*, vol. 28, no. 4, pp. 668–676, 2010. View at: Publisher Site | Google Scholar - M. Everingham, L. van Gool, C. K. I. Williams, J. Winn, and A. Zisserman, “The pascal visual object classes (VOC) challenge,”
*International Journal of Computer Vision*, vol. 88, no. 2, pp. 303–338, 2010. View at: Publisher Site | Google Scholar

#### Copyright

Copyright © 2013 Xiaosheng Yu 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.