Wang* and Xu*: An Improved Level Set Method to Image Segmentation Based on Saliency

# An Improved Level Set Method to Image Segmentation Based on Saliency

Abstract: In order to improve the edge segmentation effect of the level set image segmentation and avoid the influence of the initial contour on the level set method, a saliency level set image segmentation model based on local Renyi entropy is proposed. Firstly, the saliency map of the original image is extracted by using saliency detection algorithm. And the outline of the saliency map can be used to initialize the level set. Secondly, the local energy and edge energy of the image are obtained by using local Renyi entropy and Canny operator respectively. At the same time, new adaptive weight coefficient and boundary indication function are constructed. Finally, the local binary fitting energy model (LBF) as an external energy term is introduced. In this paper, the contrast experiments are implemented in different image database. The robustness of the proposed model for segmentation of images with intensity inhomogeneity and complicated edges is verified.

Keywords: Canny Operator , Edge Energy , Level Set Method , Local Renyi Entropy , Saliency Map

## 1. Introduction

Image segmentation is the extracting process of the regions of interest from an image. The results of image segmentation are widely used in traffic control, satellite positioning and medical diagnosis. Therefore, the study of image segmentation method has far-reaching practical significance.

Osher and Sethian [1] proposed the level set method in 1988. The change process follows the thermodynamic equation under the flame shape is solved by level set method. The Chan-Vese (CV) model was proposed by Chan and Vese [2]. The level set method is introduced into the active contour model and via minimizes the energy functional to drive curve. The CV model is robust to noise, but it is not ideal for the intensity inhomogeneity image segmentation. Aiming at the existing problems of CV model, a novel model (LBF) was proposed, which uses local information of image [3]. Based on the LBF model, the local image fitting energy model (LIF) was presented. In the LIF model [4], the objective energy function is constructed by using the difference between the local fitting image and the original image, which improves the efficiency of the LBF model. And the LIF model has the same good effect as LBF on the intensity inhomogeneity images. Pan et al. [5] developed an active contour model by using local entropy. This model uses the kernel function to obtain the information of the local region, and constructs the entropy energy function. This model can well describe the intensity inhomogeneity degree of the local area of the image, and it has a good effect on the image segmentation. Wang and Pan [6] exploit the entropy criterion, the sample points can be adaptively added to the cluster and the approach has good robustness to outliers. Jiang et al. [7] proposed a local entropy active contour model. By calculating the gray level distribution and the local entropy of the image, the local fitting energy of the image is got. Next, the LIF model is combined to segment images. Li et al. [8] proposed a distance preserving level set method, which added an internal energy to the traditional level set energy function. The problem that the traditional level set needs re-initialization is avoided. However, the method has a slow evolution speed and some limitations for weak edge detection. To solve the above problems, He et al. [9] introduces the weight coefficient and the new stopping function to accelerate the evolution speed and improve the ability of detecting weak edges. However, this method is lack of flexibility for the definition of weight coefficient, and false edges often appear in the detection.

In recent years, several new level set methods were proposed. Min et al. [10] proposed a dual minimization based level set method. He et al. [11] presented a novel segmentation algorithm by using the level set and improved-variation smoothing. Liu et al. [12] proposed an improved edge-based level set method combing local regional fitting information. Zhou et al. [13] proposed a correntropy-based level set method.

Aiming at the image with complicated edges and intensity inhomogeneity, an image segmentation model based on local Renyi entropy is proposed. First, the saliency map of the original image is extracted via the saliency region detection algorithm based on global contrast [14]. The contour of the saliency map is calculated according to the Otsu method and the morphological method. And the contour is taken as the initial contour of the level set, which overcomes the problem that the level set method is sensitive to the initial contour. Then, the edge energy and local energy of the image are obtained by using the Canny operator and the local average Renyi entropy, and the ability to segment the intensity inhomogeneity image is improved. At the same time, the weight coefficient and the indication function of the literature [8] are redefined, which makes the curve evolve to the edge of the image more accurately. Finally, the proposed model is used to segment the anisotropic filtering images, and more accurate segmentation results are obtained. The brain images include the problems of intensity inhomogeneity and weak edge. Due to this issue, the method of double-curve evolution is proposed in this paper. The contour obtained by the saliency map is used as the outer contour, and a circle with R radius is initialized as the inner contour. Then, the proposed model can implement double-curve evolution.

These main contributions of our method can be described as follows.

1. As we know, the level set is sensitive to the initial contour. In order to solve this issue, the initial contour is extracted by combining the saliency method, which is very close to the object edge. Not only did the sensitivity problem of initial contour is addressed, but the running time of curve evolution to the object edge is reduced.

2. The segmentation ability of the intensity inhomogeneous image is improved by integrating the local Renyi entropy and the LBF method.

3. Combined the Canny operator with the improved boundary indication function, the detection ability of the complicated object edges is improved, and the problem of missing edges is addressed.

4. In this paper, the double-curve evolution method is utilized to solve the intensity inhomogeneous problem and weak edges problem to brain image.

In the following paragraphs, Section 2 reviews some relevant level set method. Section 3 brings forward an improved level set method to image segmentation based on saliency. Section 4 gives experiment results and analysis. Finally, we conclude the paper in Section 5.

## 2. Background

2.1 CV Model

CV model is a piecewise constant model proposed by Chan and Vese [2] in 2001, which based on the framework of variational level set. Assuming that the known image is I(x,y), the energy functional of the CV model is shown in Eq. (1):

##### (1)
[TeX:] $$E = \lambda _ { 1 } \int _ { \operatorname { inside(c) } } \left( I ( x , y ) - c _ { 1 } \right) ^ { 2 } d x d y + \lambda _ { 2 } \int _ { \text {outside} ( c ) } \left( I ( x , y ) - c _ { 2 } \right) ^ { 2 } d x d y + \mu \cdot l$$

where λ1, λ2 and μ represent constant coefficient, the average gray value of the object area and background area of the image I(x, y) is represented by c1 and c2.

2.2 LBF Model

In this model [3], Gauss kernel was used to obtain the local information of the image, and segmentation results of the intensity inhomogeneity image were ideal. The energy functional of the LBF model is shown in Eq. (2):

##### (2)
[TeX:] $$E = \lambda _ { 1 } \int \left[ \int K _ { \sigma } ( x - y ) \left| I ( y ) - f _ { 1 } ( x ) \right| ^ { 2 } H ( \phi ( y ) ) d y \right] d x + \\ \lambda _ { 2 } \int \left[ \int K _ { \sigma } ( x - y ) \left| I ( y ) - f _ { 2 } ( x ) \right| ^ { 2 } \cdot ( 1 - H ( \phi ( y ) ) ) d y \right] d x + \\ v \cdot L ( \phi ) + \mu \cdot P ( \phi )$$

where λ1, λ2, μ and ν represent constant coefficient, f1 and f22 represent the values of gray fitting inside and outside of the evolution curve, respectively. Kσ represent Gauss kernel function of the standard deviation σ. The second items form fitting energy of LBF, L(Φ) and P(Φ) respectively indicates the length of regularization and the penalty.

2.3 LIF Model

This model adopted the degree of difference between the local fitting image and the original image to construct the energy function. The energy functional of the LIF model is shown in Eq. (3):

##### (3)
[TeX:] $$E = \frac { 1 } { 2 } \int _ { \Omega } \left| I ( x ) - I ^ { L F I } \right| ^ { 2 } d x + v \cdot L ( \phi ) + \mu \cdot P ( \phi )$$

where μ and ν represent constant coefficient, L(Φ) and P(Φ) respectively indicates the length of regularization and the penalty, ILFI express local fitting image.

## 3. Saliency Level Set Model based on Local Renyi Entropy

3.1 Determine the Initial Contour

In general, the selection of the initial contour often determines the efficiency of algorithm. In the LBF model and the LIF model, the initial contour is initialized to a circle. The radius of the circle needs to be artificially set according to the size of the image to be segmented, which leads to the setting of the initial contour lack flexibility. In this paper, the saliency map is extracted by using the saliency detection algorithm based on global contrast [14] (Figs. 1 and 2).

Fig. 1.

The original color image.

Fig. 2.

The saliency map.

As the above saliency map shown, the method proposed in [14] can well detect the saliency region. Next, the Otsu method and the morphological method are used to extract the initial contour as shown in Fig. 3.

In this paper, the initial contour is automatically determined by the saliency map. The iteration number of the level set is reduced, and the curve can rapidly evolve to the object edge. Accordingly, implement efficiency of the level set is improved.

Fig. 3.

Initial contour.
3.2 Construct the Level Set Energy Functional

Local information and boundary information are obtained by the local average Renyi entropy and Canny operator. The total energy functional is shown in Eq. (4):

##### (4)
[TeX:] $$E ( \phi ) = n E _ { L B F } + ( 1 - n ) E _ { e } + \mu \cdot P ( \phi ) + v \cdot L ( \phi )$$

The first term represents the local fitting energy term. The local fitting energy of image is obtained by Gauss kernel function. The second term is edge energy, which includes the adaptive weight coefficient and the boundary indication function. The evolution direction of the curve and the stopping condition of the curve are determined. The third term is the penalty term, which can avoid the re-initialization of the signed distance function. The last term is the length term, in order to smooth the level set curve and avoid the isolated area.

3.2.1 Adaptive weight coefficient based on local Renyi entropy

Renyi entropy is the general form of Shannon entropy proposed by Renyi et al [15]. Its definition is shown in Eq. (5):

##### (5)
[TeX:] $$R ( A ) = \frac { 1 } { 1 - \alpha } \ln \Sigma P ( i ) ^ { \alpha }$$

Compared with the Shannon entropy, the Renyi entropy is introduced into an adjustable parameter α. Therefore, the measurement of information quantity is more general and flexible. The information entropy can be used to describe the uniformity of the regional information. If the region is more uniform, the information entropy is bigger. At the begining, we caculate the Renyi entropy of the image. Then, local information of the image is obtained by using local average Renyi entropy with window size of 3×3. Finally, the gradient of the image is calculated. The adaptive weighting coefficients is defined by

##### (6)
[TeX:] $$w ( I ) = \operatorname { sign } \left( \Delta I _ { \sigma } \right) m \cdot \left| \nabla I _ { \sigma } \right| * \Delta E _ { a }$$

where Iσ express the image which is smoothed by the standard deviation σ of Gauss filtering. m > 0 is the weight of local Renyi entropy whose range distribute in [5,10]. ∇ is gradient operator. ΔEa represent the local average Renyi entropy obtained by mean filter with window size of 3×3.

w(I) is determined by the local average Renyi entropy and gradient of the image. In the uniform regions of image, the evolution speed of the curve is accelerated because the value of local average Renyi entropy, the gradient value and the value of w(I) are all small. In the edge region of image, the value of local average Renyi entropy, the gradient value and the value of w(I) are all large. Hence, the detection ability of weak edges is improved.

3.2.2 Boundary indication function based on Canny operator

The boundary indication function [8] is improved, and the Canny operator is introduced to make the curve evolution more accurately. The boundary indication function is defined by

##### (7)
[TeX:] $$f _ { e } = 1 - \frac { 1 } { \exp \left( \frac { \beta * \left| \nabla I _ { \sigma } \right| } { m \cdot \Delta E _ { a } } \right) }$$

where Iσ express the image which is smoothed by the standard deviation σ of Gauss filtering. m is the weight of local Renyi entropy. ΔEa represent the local average Renyi entropy obtained by mean filter with window size of 3×3. ∇ is the gradient operator. The value of β is determined by the detection results of the Canny operator, as shown in the formula (8):

##### (8)
[TeX:] $$\beta = \left\{ \begin{array} { l } { 1 \text { When the Canny operator does not detect the edge} } \\ { 0 \text { When the Canny operator detects the edge } } \end{array} \right.$$

When the curve is located in the uniform region, the result of the Canny operator is not the edge, that is, β=1. At this point, the boundary indication function is greater than zero, and the curve keeps evolution. When the curve is located at the boundary of the object, the result of the Canny operator is edge, that is, β=0. At this point, the boundary indication function is equal to zero, and the curve stops evolution.

3.3 Final Energy Functional

According to the Eqs. (6) and (7), the edge energy can be expressed as

##### (9)
[TeX:] $$E _ { e } = \int _ { \Omega } w ( I ) f _ { e } ( \nabla I ) H ( - \phi ) d x d y$$

In the study, the penalty term and the length term are defined by

##### (10)
[TeX:] $$P ( \phi ) = \frac { 1 } { 2 } \int _ { \Omega } ( | \nabla \phi | - 1 ) ^ { 2 } d x d y$$

##### (11)
[TeX:] $$L ( \phi ) = \int _ { \Omega } f _ { e } ( \nabla I ) \delta ( \phi ) d x d y$$

Eqs. (2), (9), (10) and (11) are introduced into Eq. (4). The total energy functional of the model is obtained as shown in Eq. (12):

##### (12)
[TeX:] $$E = \alpha \left[ \int \left[ \int K _ { \sigma } ( x - y ) \left| I ( y ) - f _ { 1 } ( x ) \right| ^ { 2 } \cdot H ( \phi ( y ) ) d y \right] d x +\right \\ \int \left[ \int K _ { \sigma } ( x - y ) \left| I ( y ) - f _ { 2 } ( x ) \right| ^ { 2 } \cdot ( 1 - H ( \phi ( y ) ) ) d y \right] d x ] + \beta \int _ { \Omega } w ( I ) f _ { e } ( \nabla I ) H ( - \phi ) d x d y + \frac { 1 } { 2 } \mu \int _ { \Omega } ( | \nabla \phi | - 1 ) ^ { 2 } d x d y + v \int _ { \Omega } f _ { e } ( \nabla I ) \delta ( \phi ) d x d y$$

where α=1 represent the weight coefficient of the local item, β=1 is the weight coefficient of the edge item. H(·) denote the Heaviside function and δ(·) denote the Dirac Delta function.

##### (13)
[TeX:] $$H _ { \varepsilon } ( x ) = \frac { 1 } { 2 } \left[ 1 + \frac { 2 } { \pi } \arctan \left( \frac { x } { \varepsilon } \right) \right]$$

##### (14)
[TeX:] $$\delta _ { \varepsilon } ( x ) = H _ { \varepsilon } ^ { \prime } ( x ) = \frac { 1 } { \pi } \frac { \varepsilon } { \varepsilon ^ { 2 } + x ^ { 2 } }$$

The energy functional is minimized by the standard gradient descent flow. The final evolution equation is shown as follow.

##### (15)
[TeX:] $$\frac { \partial \phi } { \partial t } = \alpha \left[ \delta ( \phi ) \left( - \lambda _ { 1 } e _ { 1 } + \lambda _ { 2 } e _ { 2 } \right) \right] + \beta w ( I ) f _ { e } ( \nabla I ) \delta ( \phi ) + \\ \mu \left( \nabla ^ { 2 } \phi - d i v \left( \frac { \nabla \phi } { | \nabla \phi | } \right) \right) + v \delta ( \phi ) d i v \left( f _ { e } ( \nabla I ) \frac { \nabla \phi } { | \nabla \phi | } \right)$$

where λ1, λ2, μ and ν express constant coefficient and these four parameters are equal to 1. And e1 and e2 represent the energy terms both inside and outside the curve fitted by the Gauss kernel, which are defined by

##### (16)
[TeX:] $$e _ { 1 } ( x ) = \int _ { \Omega } K _ { \sigma } ( y - x ) \left| I ( x ) - f _ { 1 } ( y ) \right| ^ { 2 } d y$$

##### (17)
[TeX:] $$e _ { 2 } ( x ) = \int _ { \Omega } K _ { \sigma } ( y - x ) \left| I ( x ) - f _ { 2 } ( y ) \right| ^ { 2 } d y$$

where f1 and f2 denote the gray fitting values in and out of the curve, which are defined by

##### (18)
[TeX:] $$f _ { 1 } = \frac { K _ { \sigma } ( x ) * \left[ H _ {\varepsilon } ( \phi ( x ) ) I ( x ) \right] } { K _ { \sigma } ( x ) * H _ { \varepsilon } ( \phi ( x ) ) }$$

##### (19)
[TeX:] $$f _ { 2 } = \frac { K _ { \sigma } ( x ) * \left[ \left( 1 - H _ { \varepsilon } ( \phi ( x ) ) \right) I ( x ) \right] } { K _ { \sigma } ( x ) * \left( 1 - H _ { \varepsilon } ( \phi ( x ) ) \right) }$$

3.4 Anisotropic Filtering

In 1990, Perona and Malik proposed anisotropic filtering diffusion model [16], the diffusion equation can be expressed as

##### (20)
[TeX:] $$\left\{ \begin{array} { l } { \frac { \partial I ( x , y , t ) } { \partial t } = \operatorname { div } ( c ( | \nabla I | ) \cdot \nabla I ) } \\ { I ( x , y , 0 ) = I _ { 0 } ( x , y ) } \end{array} \right.$$

where div denote divergence operator, ∇ denote gradient operator, c(|∇I|) denote diffusion coefficient. Because the gradient value of the image edge is large, the diffusion intensity is small. On the contrary, if the gradient value of the uniform region is small, the corresponding diffusion intensity is large. Therefore, the anisotropic filtering can remove the noise and keep the edge. In the study, the anisotropic filtering image is segmented by the proposed model, and the level set curve can effectively evolve to the edge of the image.

3.5 Algorithm Flow

The improved level set method is based on the LBF model and the saliency filtering algorithm. The algorithm flowchart is shown in Fig. 4. The algorithm is described as follows:

(1) First, the saliency map of the original image is extracted by using the saliency filtering algorithm. Then, the contour of saliency map is calculated by the Otsu method and morphology.

(2) If the input image is not a brain image, the contour of saliency map is used as the initial contour of the level set. Otherwise, a circle with radius R is initialized as an inner contour. The initial contour includes the inner contour and the contour of saliency map.

(3) According to the Eq. (20), anisotropic filtering of the original image is implemented.

(4) According to the second items of Eq. (2), the fitting energy term of LBF model ELBF is calculated.

(5) The adaptive weight coefficient based on Renyi entropy w (I) is calculated by Eq. (6).

(6) The boundary indication function based on Canny operator fe is calculated by Eq. (7).

(7) Updating the level set energy functional by Eq. (12).

(8) Whether the curve evolves to a steady state. If not, go to step (4). Otherwise, stop segmenting.

Fig. 4.

The flow chart of the proposed model.

## 4. Experimental Results and Analysis

The validity and correctness of the proposed method is proved by the contrast experiments on natural images, medical images and intensity inhomogeneity images. Experimental hardware environment is Intel Core i3-2120, 4 GB and 3.3 GHz, software environment is the MATLAB 2013a under Windows 7 operating system. The contrast models include CV model, LBF model and LIF model, and we compare the segmentation quality of each model and the iteration efficiency.

4.1 Natural Images Segmentation

In our research, the natural image source is Berkeley natural image database. The segmentation results of each model are shown as follows.

In Figs. 5 and 6, the initial contour of the proposed model is more close to the object edge, which can greatly reduce the iteration times of the level set function and improve the running efficiency.

In Fig. 7, the initial contour of the proposed model is very close to the object edge with 200 iteration numbers, and the evolution speed is faster than other three models.

Fig. 5.

The initial contour of level set in this paper.

Fig. 6.

CV model, LBF model, and LIF model level set initial contour.

For the segmentation of natural images, when the curve of iteration to various models no longer evolves, the segmentation is stopped. In Fig. 8, when segments large object and intensity inhomogeneity image, the LIF model is prone to over-fitting, which leads to false segmentation. It can be seen from the second row that the edge segmentation effect of the proposed model is much higher than others. Next, our research uses the Berkeley standard image database as the standard evaluation image [17]. The Jaccard similarity coefficient, Dice similarity coefficient, Precision, and Recall are used as the objective evaluation index to compare several models [18,19]. The comparison results are shown in Tables 1–4. Assuming the input image is I, the standard image is Ig and the total number of pixels is N. And the objective evaluation index can be described as follows:

##### (21)
[TeX:] $$Jaccard= \frac { \sum _ { i = 1 } ^ { N } \left( I _ { i } \cap I g _ { i } \right) } { \sum _ { i = 1 } ^ { N } \left( I _ { i } \cup I g _ { i } \right) }$$

Fig. 7.

The segmentation results for 200 iteration numbers: (a) CV model, (b) LBF model, (c) LIF model, and (d) the proposed model.

Fig. 8.

The final segmentation results: (a) CV model, (b) LBF model, (c) LIF model, and (d) the proposed model.

##### (22)
[TeX:] $$\operatorname { Dice } = 2 * \left( \frac { \sum _ { i = 1 } ^ { N } \left( I _ { i } \cap \operatorname { Ig } _ { i } \right) } { \sum _ { i = 1 } ^ { N } I _ { i } } + \sum _ { i = 1 } ^ { N } I g _ { i } \right)$$

##### (23)
[TeX:] $$Precision= \frac { \sum _ { i = 1 } ^ { N } \left( I _ { i } \cap I g _ { i } \right) } { \sum _ { i = 1 } ^ { N } I _ { i } }$$

##### (24)
[TeX:] $$\operatorname { Recall } = \frac { \sum _ { i = 1 } ^ { N } \left( I _ { i } \cap \operatorname { Ig } _ { i } \right) } { \sum _ { i = 1 } ^ { N } I g _ { i } }$$

Table 1.

Jaccard similarity coefficient of image
 CV model LBF model LIF model This paper Image 1 (butterfly) 0.9580 0.9575 0.9117 0.9612 Image 2 (bird) 0.9341 0.9343 0.9328 0.9500 Image 3 (airplane) 0.9705 0.9701 0.9550 0.9703

Table 2.

Dice similarity coefficient of image
 CV model LBF model LIF model This paper Image 1 (butterfly) 0.9593 0.9590 0.9465 0.9663 Image 2 (bird) 0.9659 0.9660 0.9652 0.9744 Image 3 (airplane) 0.9850 0.9856 0.9770 0.9853

Table 3.

Precision of image
 CV model LBF model LIF model This paper Image 1 (butterfly) 0.9825 0.9819 0.9435 0.9842 Image 2 (bird) 0.9561 0.9565 0.9533 0.9705 Image 3 (airplane) 0.9770 0.9766 0.9620 0.9772

Table 4.

Recall of image
 CV model LBF model LIF model This paper Image 1 (butterfly) 0.9747 0.9735 0.9644 0.9752 Image 2 (bird) 0.9760 0.9758 0.9775 0.9783 Image 3 (airplane) 0.9927 0.9918 0.9925 0.9928

For image (c) of Table 2, the image background and the edge is relatively simple. So, the LBF method obtains better local characteristics, and can detect the object edge accurately. For image (c) of Table 1, the image background and the edge is relatively simple. So, the CV method can detect the object edge quickly. However, for images (a) and (b), there are more complicated edges. Other comparison approaches compromise the missing edges issues. In this paper, the Canny operator and boundary indication function can be utilized to detect the edges more accurately. In general, the proposed method is more effective for complicated edges of image segmentation.

This study compares the real running time of different methods on different images, and the results can be shown in Table 5.

Table 5.

Running time and iteration comparison of segmentation on image different size
 Image 1 (butterfly) in Fig. 8 (256×171) Image 2 (bird) in Fig. 8 (128×85) Image 3 (airplane) in Fig. 8 (481×32) Iterations Time (s) Iterations Time (s) Iterations Time (s) CV model 800 8.6021 600 3.7042 900 25.1656 LBF model 600 15.6796 300 7.0949 1100 48.8730 LIF model 350 30.2657 260 11.2489 400 73.5275 Our method 220 14.4199 45 3.9289 150 25.9360

By comparing the running time of several models, the running time of CV is the shortest. The LBF model needs Gaussian smoothing, the LIF model needs to construct the local fitting image. In the edge detecting process, the proposed method needs to adopt Canny operator and boundary indication function. So, the computation time is costly. Yet, the running time of the proposed method is only slower than the CV model, which has better detection performance for the image with complicated edges. The proposed method only cost little running time to guarantee the segmentation performance.

Fig. 9.

The segmentation results of brain images: (a) CV model, (b) LBF model, (c) LIF model, and (d) the proposed model.
4.2 Medical Image Segmentation

The medical image source is the McConnell Brain Imaging Center, which includes intensity inhomogeneity and weak edge features. In this paper, a double-curve evolution method is proposed to segment brain images. First, the contour extracted from the saliency map is used as the outer contour of the level set evolution. Then, a circle with radius R=30 initialized by signed distance function is used as the inner contour of the level set evolution. Finally, the proposed model is used to segment image.

In Fig. 9, the CV model can segment the outer edge of image, but the segmentation effect of intensity inhomogeneity image is not ideal. The LBF model improves the segmentation ability for intensity inhomogeneity image, but the segmentation effect of the weak edge is lower than the proposed model. The LIF model has a good effect on the segmentation of gray image, but the edge segmentation is jagged. The proposed model can segment the inner intensity inhomogeneity part of the brain image, and the weak edge segmentation result is ideal.

4.3 Inhomogeneous Image Segmentation

In order to further assess the performance of the proposed model, images with inhomogeneity are used to compare in different models. In Fig. 10, the first image includes severe intensity inhomogeneity and shade. The second and third images are vessel blood images with severe intensity inhomogeneity and low contrast.

Fig. 10.

The initial contour of different models: (a) comparison models and (b) the proposed model.

From Fig. 11 it can be analyzed that CV model produces less-segmentation because it only extracts global image information. The Gauss Kernel is used to obtain local image information in the LBF model which improves segmentation results. LIF model uses local fitting image to get local image information, which can enhance segmentation performance. However, the evolution process of the LIF model is not steady, which causes jagged edge. In this paper, the Gauss Kernel and the Renyi entropy are used to extract local image information. Moreover, the improved boundary indication function is used to obtain image edge information. The final segmentation results of images validated that the proposed model had good segmentation performance.

Fig. 11.

The inhomogeneous image segmentation results of different models: (a) CV model, (b) LBF model, (c) LIF model, and (d) the proposed model.

## 5. Conclusion

In this paper, an improved level set method to image segmentation based on saliency is proposed. For the level set energy function, this paper introduces the local average Renyi entropy and Canny operator to obtain the local information and edge information of the image. By combing with the LBF model, the energy function of the proposed model is constructed. This paper mainly has the following three advantages. (1) The initial level set contour obtained by the saliency map is very close to the object edge, which reduces the iteration numbers of the level set function. (2) We use the local average Renyi entropy and Canny operator to obtain the local information and the edge information of the image. What’s more, the detection ability of the intensity inhomogeneity image and the weak edge image is greatly improved. (3) The intensity inhomogeneity and weak edge of brain image are hard to segment by single curve evolution. Therefore, we propose the double-curve evolution method to segment brain images.

## Biography

##### Yan Wang
https://orcid.org/0000-0001-7493-6184

She is currently a Professor in the School of Computer and Commmunication in the Lanzhou University of Technology. She obtains engineer degree in computer from the Xi’an Mining Institute in 1999. Her research interests cover pattern recognition and data mining.

## Biography

##### Xianfa Xu
https://orcid.org/0000-0001-8238-2695

He received B.S. degree in school of mathematics and computer from Northwest University for Nationalities in 2015. And he is currently a graduate student in the Lanzhou University of Technology. His current research interests include image processing and pattern recognition.

## References

• 1 S. Osher, 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.doi:[[[10.1016/0021-9991(88)90002-2]]]
• 2 T. F. Chan, L. A. Vese, "Active contours without edges," IEEE Transactions on Image Processing, vol. 10, no. 2, pp. 266-277, 2001.doi:[[[10.1109/83.902291]]]
• 3 C. Li, C. Y. Kao, J. C. Gore, Z. Ding, "Implicit active contours driven by local binary fitting energy," in Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, Minneapolis, MN, 2007;pp. 1-7. custom:[[[-]]]
• 4 K. Zhang, H. Song, L. Zhang, "Active contours driven by local image fitting energy," Pattern Recognition, vol. 43, no. 4, pp. 1199-1206, 2010.doi:[[[10.1016/j.patcog.2009.10.010]]]
• 5 G. Pan, L. Gao, S. Zhao, "Active contour model driven by local entropy energy," Journal of Image and Graphics (China), vol. 18, no. 1, pp. 78-85, 2013.custom:[[[-]]]
• 6 L. Wang, C. Pan, "Robust level set image segmentation via a local correntropy-based K-means clustering," Pattern Recognition, vol. 47, no. 5, pp. 1917-1925, 2014.doi:[[[10.1016/j.patcog.2013.11.014]]]
• 7 X. Jiang, X. Wu, Y. Xiong, B. Li, "Active contours driven by local and global intensity fitting energies based on local entropy," Optik-International Journal for Light and Electron Optics, vol. 126, no. 24, pp. 5672-5677, 2015.doi:[[[10.1016/j.ijleo.2015.09.021]]]
• 8 C. Li, C. Xu, C. Gui, M. D. Fox, "Level set evolution without re-initialization: a new variational formulation," in Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, San Diego, CA, 2005;pp. 430-436. custom:[[[-]]]
• 9 C. J. He, M. Li, Y. Zhan, "Adaptive distance preserving level set evolution for image segmentation," Journal of Software (China), vol. 19, no. 12, pp. 3161-3169, 2008.doi:[[[10.3724/sp.j.1001.2008.03161]]]
• 10 H. Min, X. F. Wang, D. S. Huang, W. Jia, "A novel dual minimization based level set method for image segmentation," Neurocomputing, vol. 214, pp. 910-926, 2016.doi:[[[10.1016/j.neucom.2016.07.023]]]
• 11 K. He, D. Wang, X. Zhang, "Image segmentation using the level set and improved-variation smoothing," Computer Vision and Image Understanding, vol. 152, pp. 29-40, 2016.doi:[[[10.1016/j.cviu.2016.06.006]]]
• 12 C. Liu, W. Liu, W. Xing, "An improved edge-based level set method combining local regional fitting information for noisy image segmentation," Signal Processing, vol. 130, pp. 12-21, 2017.doi:[[[10.1016/j.sigpro.2016.06.013]]]
• 13 S. Zhou, J. Wang, M. Zhang, Q. Cai, Y. Gong, "Correntropy-based level set method for medical image segmentation and bias correction," Neurocomputing, vol. 234, pp. 216-229, 2017.doi:[[[10.1016/j.neucom.2017.01.013]]]
• 14 M. M. Cheng, N. J. Mitra, X. Huang, P. H. S. Torr, S. M. Hu, "Global contrast based salient region detection," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 3, pp. 569-582, 2015.doi:[[[10.1109/TPAMI.2014.2345401]]]
• 15 S. Sarkar, S. Das, S. S. Chaudhuri, "Hyper-spectral image segmentation using Rényi entropy based multi-level thresholding aided with differential evolution," Expert Systems with Applications, vol. 50, pp. 120-129, 2016.doi:[[[10.1016/j.eswa.2015.11.016]]]
• 16 C. Tsiotsios, M. Petrou, "On the choice of the parameters for anisotropic diffusion in image processing," Pattern Recognition, vol. 46, no. 5, pp. 1369-1381, 2013.doi:[[[10.1016/j.patcog.2012.11.012]]]
• 17 P. Arbelaez, M. Maire, C. Fowlkes, J. Malik, "Contour detection and hierarchical image segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 5, pp. 898-916, 2011.doi:[[[10.1109/TPAMI.2010.161]]]
• 18 V. Thada, V. Jaglan, "Comparison of Jaccard, dice, cosine similarity coefficient to find best fitness value for web retrieved documents using genetic algorithm," International Journal of Innovations in Engineering and Technology, vol. 2, no. 4, pp. 202-205, 2013.custom:[[[-]]]
• 19 D. M. Powers, "Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation," Journal of Machine Learning Technologies, vol. 2, no. 1, pp. 37-63, 2011.custom:[[[-]]]