# An Improved Image Segmentation Algorithm CT Superpixel Grid Using Active Contour

Authors: Yuntao Wei; Xiaojuan Wang
Journal: Wireless Communications and Mobile Computing
 (2021)

---

## Abstract

The traditional CT image segmentation algorithm is easy to ignore image contour initialization, which leads to the problem of long time consuming and low accuracy. A superpixel mesh CT image improved segmentation algorithm using active contour was proposed. CT image superpixel gridding was carried out first; secondly, on the basis of gridding, the region growth criterion was improved by superpixel processing, the region growth graph was established, the image edge salient graph was calculated based on the growth graph, and the target edge was obtained as the initial contour; finally, the Mumford-Shah model in the active contour model was improved; the energy functional was constructed based on the improved model and transformed into the symbol distance function. The results show that the proposed algorithm takes less time to mesh superpixels, the accuracy of image edge calculation is high, the correct classification coefficient is as high as 0.9, and the accuracy of CT image segmentation is always higher than 90%, which has superiority.


---

## Body

## 1. Introduction

Computed tomography (CT) has the advantages of fast imaging and high image resolution. It is an important electronic imaging technology [1, 2]. As an important detection method in routine clinical examinations, it has become a computer-assisted human organ examination, and follow-up an important basis for medical treatment is currently widely used in clinical medicine [3, 4]. In the computer-aided diagnosis medical system, segmentation of the region of interest in the CT image is an important step in diagnosis and the key technical support for subsequent 3D image reconstruction. It plays an important role in the precise diagnosis and treatment of diseases and can also reduce calculations to a certain extent [5]. Human CT scan images include multiple organs such as the chest, abdomen, and blood vessels. In view of the complexity, irregularity, and uncertainty of human organs [6], it brings certain difficulties to image segmentation, and ordinary image segmentation techniques are difficult to obtain more accurate. As a result, the limitations are strong, so there is an urgent need to find an effective CT image segmentation algorithm, which is of great significance for clinical auxiliary diagnosis and quantitative analysis with the help of CT images [7].Traditional image segmentation algorithms mostly use pixels as the basic unit and represent the pixels by forming a matrix, but it is often easy to ignore the internal connection between pixels and cannot comprehensively consider pixel characteristics. Segmentation will occur when there is occlusion or low texture [8]. The basic principle of the concept of superpixel is to judge the similarity according to the texture features and brightness of the pixels. Therefore, the pixels can be divided into different subregions, which is convenient for subsequent calculation, improves the efficiency of image segmentation, and makes up for the shortcomings of traditional image segmentation algorithms [9]. Taha and Hanbury propose an efficient evaluation tool implementing the 20 selected metrics. The tool is optimized to perform efficiently in terms of speed and required memory, also if the image size is extremely large as in the case of whole body MRI or CT volume segmentation [10]. Chengcheng et al. [11] used convolutional neural network to extract image features, retrieved the image set, and used Gaussian kernel density estimation to weight the superpixels of the image, thereby improving the pixel matching accuracy and completing high-precision image segmentation; Jiarui et al. [12] perform clustering analysis based on the results of superpixel segmentation and perform superpixel segmentation on the image area to obtain matching areas containing feature points. Based on this, effective feature points can be obtained to help subsequent analysis. Superpixel segmentation is used in this algorithm. Miao et al. [13] improved and analyzed the current superpixel method. First, iteratively clustered images based on local information performed the first superpixel segmentation on the clustered images and then performed iterative segmentation again based on the color standard deviation and merge to obtain an effective superpixel segmentation algorithm.With the help of the concept of superpixel segmentation, this paper proposes an improved segmentation algorithm for superpixel grid CT images using active contours. The main contributions are as follows: (1) Using superpixels to improve the region growth criterion, the determination of the initial contour is more accurate. (2) The paper improves the Mumford-Shah model, fully considers the pixel texture characteristics, and increases the accuracy of CT image segmentation. (3)Various types of CT image data are used for experimental analysis, and the selection of experimental indicators is abundant, which greatly increases the validity of the experimental results.


## 2. Related Work

For CT image segmentation, many studies have been carried out at home and abroad. Literature [14] combines convolutional neural network and superpixel analysis for CT image segmentation, uses the superpixel method to grid the CT image while labeling the label, and uses the convolutional neural network to train the superpixel edge to complete the rough image segmentation. The segmented edge is used as the initial contour to be segmented again to obtain accurate segmentation results, but the algorithm has certain shortcomings in terms of running time; literature [15] also uses the superpixel method for image gridding and convolutional neural network for image edge extraction. The extracted edge pixels are formed as the initial contour and then combined with the integrated energy function to complete the image segmentation. The accuracy of the algorithm needs to be improved; the literature [16] combines superpixel segmentation and fuzzy C-means clustering to perform image segmentation. Use spatial neighborhood information to enhance image grayscale, use morphological knowledge to remove image peripheral influencing factors, and then perform superpixel classification on the grayscale and texture features of the image to obtain a more accurate image segmentation result, but for image pixel blocks underutilized.In foreign studies, the literature [17] proposed a new three-dimensional adaptive active contour method for CT lung image segmentation. The method starts from a sphere in the lung. The force acting on the sphere is divided into the lung. This process is performed iteratively in order to minimize the energy function related to the 3D deformation model. The experimental results show the superiority of this algorithm in CT image segmentation, but the use of active contours needs to be improved; the literature [18] that proposed an image segmentation algorithm based on superpixel clustering is proposed. First, the algorithm uses superpixel preprocessing technology to quickly divide the image into a certain number of superpixel regions with specific information and then uses the similarity matrix to provide input to the spectral clustering algorithm information. The superpixel area is clustered, and the final image segmentation result is obtained, but the segmentation accuracy is not high. Literature [19] focuses on simple linear iterative clustering superpixels and fast and automatically adjustable Gaussian path The image segmentation technology combined with the basis function kernel fuzzy C-means combines superpixels and image segmentation as a preprocessing step for image classification and then provides better results for image classification, but the accuracy of the algorithm is not high [20].In order to obtain more accurate CT image segmentation results, this paper proposes an improved segmentation algorithm for CT images based on active contour superpixel grid. First, the CT image is processed with superpixel grids, and then based on the concept of superpixels, the region growth criterion is improved, and the concept of center-surround contrast is introduced to calculate the prominent area of the image edge, and the initial contour is obtained. The contour initialization problem of image segmentation is well completed. The active contour model is used to complete the segmentation of superpixel grid CT images. The experiment selects two data sets, TCIA and DeepLesion, as data sources and uses lung CT images, brain CT images, and vertebra CT images for analysis. The results show that the proposed algorithm is excellent in time-consuming, correct classification, and segmentation accuracy. Compared with other algorithms, it provides data support for further research on CT images.


## 3. CT Image Superpixel Gridding

In order to effectively complete the CT image segmentation, it is first necessary to perform the CT image superpixel gridding process, so that the pixels of the same pixel block in the image have a high degree of similarity in terms of color, texture, and intensity [21].First, initialize the CT image pixels. The random collection of pixel seed points is represented asD=d1n,d2n,⋯,dkn a grid with 2×2 units, the seed points are evenly distributed in the grid, and the pixels in the neighborhood of the seed points are marked. Expression:
(1)dq=xq,yq=1,dkq=xkq,ykq=∞,where xq,yq represents a certain gray pixel in the neighborhood.The original grayscaleD pixel of the seed point is expressed as xn,yn; in the grid area, all the pixels Din the neighborhood of the seed point are counted, and the distance between the seed point D and the pixel point is calculated separately, and the calculation is based on the grayscale feature. The formula is as follows:
(2)sp,q=xp−xq2+yp−yq2,where sp,q represents the spatial distance of grayscale features between two pixels.Calculated the straightD line distance between the seed point and the pixel point, expressed as:
(3)s′p,q=xp−xq2.The linear distance and the spatial distance are combined to synthesize a single unit of measureG. The formula is as
(4)G=s′∂2+sB2,where ∂ represents the balance coefficient of the pixel gray feature in the straight line and B represents the step length between different seed points, which can be calculated by the following formula:
(5)B=NL,where N means that the CT image contains the number of L pixels and the number of pixel blocks to be divided.


## 4. Target Edge Calculation in CT Image Using Superpixel Region Growth

On the basis of CT image superpixel gridding, based on the superpixel processing to improve the region growth criterion, the target edge of CT image is obtained and used as the initial contour to lay the foundation for accurate image segmentation [22, 23].This section introduces the production criteria to calculate the CT image saliency map to obtain the image target edge. Although the region growth criterion only considers the pixel brightness, there is a problem that the shadow image segmentation effect is not good [24]. This section is based on superpixels to make up for the deficiency of the region growth criterion and incorporates the texture features of superpixels to improve the accuracy of region growth.The energy feature, entropyE feature, inertia H feature, and correlation K feature are, respectively, C used as edge superpixel texture features, combined with gray level features to calculate the similarity of superpixels; the formula is as follows:
(6)T=Ei−Ej2+Hi−Hj2+Ki−Kj2+Ci−Cj2+Fi−Fj2,where T represents the similarity between i the first pixel and j the first pixel at the edge of the image, that is, the characteristic distance. F indicates the average gray scale of the pixel.According to the above formula, the feature distance between the organ pixel block and the background pixel block in the edge of the CT image is obtained, and the average feature distance is obtained by the statistical analysis principle, which can be used as the region growth criterion based on superpixels. Select a pixel block from the edge area of the image, take this pixel block as the center, determine whether the characteristic distance of its neighboring pixel blocks meets the growth criterion; if it meets, merge it, traverse all the pixel blocks according to the above method, and complete the growth. Get the growth map of the edge area of the CT image.On the growth map of the edge area of the CT image, using the center-surround contrast idea [25] to calculate the edge salient area, the target edge can be obtained. The center-surround contrast idea is based on regional texture features and average gray levels. The texture feature distance of the edge region of the image is calculated according to the following formula, that is, the similarity of regional texture features:
(7)T′=Ei−Ej2+Hi−Hj2+Ki−Kj2+Ci−Cj2.Calculated the similarity weight of regional texture features according to the aboveβ formula:
(8)β=255Tmax′,where Tmax′ is the maximum difference of the T′distance of the regional texture feature.Calculate the texture feature distance between the current area and other areas. If the distance value of the current area is large, the area will be integrated into the current area. If the distance value is less than this area, the distance value of the current area will be used to subtract the distance value of the area [26, 27]. Thus, get the global surround contrast of the current M area:
(9)M=F′+χ∑i=1βTi′.F′ represents the gray value χof the current area and the compensation coefficient. Under the condition of comparing the current area with different areas, it will change accordingly. The values are as follows:
(10)χ=1F′>Fout,−1F′≤Fout.Fout represents the gray value of other areas.Considering that there will be organs of a certain area in the actual CT image and may exist as edge locations, in order to clearly express the organ area, the global surround contrast weight should be setδ to calculate the image salience value. The calculation method is as follows:
(11)δ=ZbackZorg.Zback is the area of the background. Zorg is the area of the organ area.Combined withδ the weights, the final significance value can M′ be calculated:
(12)M′=δM.According to the above formula, the salience values of all the edge regions are calculated, and the most salience region is selected; then, the target edge of the CT image can be obtained, which is used as the initial contour.


## 5. The Proposed Algorithm

Active contour model is the mainstream algorithm used in image segmentation in recent years. It combines level set and energy functional, while considering features such as image edges and regions, and has better performance than single feature segmentation algorithms [28, 29]. Active contour models include many types. The Mumford-Shah model (the best approximation of the original image is found by piecewise smoothing function) is selected in this paper to improve CT image segmentation. Proceed as follows:Input: CT image initial contour and superpixel informationOutput: CT image improves segmentation resultsInitialize the image superpixel and contour problem and use the Mumford-Shah model for final image segmentation, as follows:(1)
On the basis of the classic Mumford-Shah model, the level set method is used to solve the Mumford-Shah model and optimize it. This process is similar to curve evolution, transforming the energy function into a level set function, and the function solution value is obtained after continuous iteration. First, simplify the function of the Mumford-Shah model to obtain the energy functional:(13)WA,rorg,rback=M′+λ∫insideAQ−rorg2+λ∫outsideAQ−rback2,where VCCR=K′/Ktotal is the contour line, is the λedge level coefficient, is the rorg target area feature, and is the rback background area feature and Q is the image domain.
(2)
Introduce the levelJx,y,t set function, solve the model, and obtain a new energy functional:(14)W′=Jx,y,t+M′+λ∫insideJQ−rorg2Jx,y,tdxdy+λ∫outsideJQ−rback2Jx,y,tdxdy.(3)
In order to make the segmentation result smoother, a Gaussian function convolution method is added to the energy function to convert the energy function into a signed distance function(4)
CT image segmentation is essentially the process of solving the target contour. In the Mumford-Shah model, it can also be regarded as the process of solving the minimum value of the energy functional (signed distance function), and the sign distance function of each pixel in the CT image is iterated. Use the initial contour obtained in the previous section to obtain the initial value of theU0symbolic distance function. Starting from the initialization of the symbolic distance function, the minimum value of the function is solved by traversal operation:(15)U=U0+argminW′.(5)
In this way, the superpixel grid segmentation of the CT image can be completed, and the final contour can be obtained(6)
EndBased on the above analysis, the flow of improved segmentation algorithm for superpixel grid CT image is given as shown in Figure1.Figure 1
Flow of improved segmentation algorithm for superpixel grid CT image.


## 6. Experimental Results

### 6.1. Experimental Environment and Data Set

In order to verify the effectiveness of the algorithm proposed in this paper, a comparative experiment was designed to highlight the performance of this algorithm. This experiment is run in the same environment, with 3.2GHz CPU, Intel i7-6700 as the central processing unit, Windows 10 as the computer operating system, and running in the experimental platform MATLAB.The experimental data comes from the TCIA data set and DeepLesion data set.TCIA data set. This data set is a large-scale medical. The medical data set contains various image data such as CT and MRI, with abundant clinical medical informationDeepLesion data set. It includes more than 32,000 lesion labels from more than 10,000 case studies, including image data of lesions in the lung, kidney, bone, lymph, and abdomen, a relatively comprehensive medical image data set currently releasedThe lung CT images, brain CT images, and vertebra CT images are selected from the above two data sets; 30 million are selected for each data set, for a total of 60 million data. Half of them are used as training data sets, and half are used as test data sets.The2×2 grid was used to input images, and lung CT images, brain CT images, and vertebral CT images were selected from TCIA data set and deep vision data set. Each data set selected 30 million, a total of 60 million data, of which 40 million were used as training data set, 10 million as verification data set, 10 million as validation data set, and 1000 as test data set.


### 6.2. Experimental Steps

(1)
First installed basic operating software, including CPU acceleration software, combined with the experimental environment parameters set above, and run in the experimental platform MATLAB(2)
Select the superpixel gridding parameter by multiple experiments, that is, the number of pixel blocksL to be divided. In this experiment, the final value of L is selected within [1000-3000](3)
Construct an improved Mumford-Shah model for training, input the test data set after the training is completed, and run the algorithm in the set experimental environment(4)
Repeat experiments to verify the effectiveness of the proposed algorithm


### 6.3. Experimental Indicators

(1)
CT Image Segmentation Results and Manual Segmentation Results.Taking the lung CT images, brain CT images, and vertebra CT images as the objects, respectively, the segmentation maps are drawn by computer, and at the same time, to verify the segmentation effect of the algorithm in this paper, compare the results with manual segmentation.(2)
Superpixel Grid Time-Consuming: Superpixel Grid.Transformation is the prerequisite of image segmentation in this paper. This process requires constant iteration to find the clustering center, so time-consuming can be used as an important indicator to measure the performance of the algorithm.(3)
Image Target Edge Calculation Effect: According to the Public.Equation (12) shows that δ the weight has an important influence on the accuracy of solving the saliency value. δ If the weight is selected properly, the image edge saliency can be calculated accurately. Therefore, the adaptability of δ the weight is selected to judge the accuracy of the algorithm image target edge calculation in this paper.
(4)
Correct Classification Coefficient: Select the Correct Classification System.TheVCCR number is used as an indicator to judge the effect of algorithm segmentation, and the calculation formula is as follows:
(16)VCCR=K′Ktotal,where K′ represents the number of superpixels that are correctly Ktotal segmented and represents the total number of image superpixels.
(5)
Image Segmentation Accuracy: Segmented by CT Image.The accuracy is the index to verify the performance of the algorithm, and the formula is as follows:(17)SEaccu=L1Ltot×100%,where Ltot represents the number of pixel blocks L1actually divided and it represents the number of pixel blocks obtained by algorithmic division.


### 6.4. Results and Discussion

In the environment set in this experiment, the computer is used to draw the lung CT image, brain CT image, and vertebra CT image segmentation of the algorithm in this paper, as shown in the following Figure2.Figure 2
CT image segmentation results.
(a)
CT image of the lung(b)
CT image of the brain(c)
CT images of the vertebraeIt can be seen from Figure2 that the segmentation of lung CT images, brain CT images, and vertebra CT images using the algorithm in this paper is basically consistent with the manual segmentation results, and the segmentation effect is significant, and the accuracy is high, indicating that the algorithm in this paper has a good performance.


#### 6.4.1. Experiment 2

Taking the time consumption of superpixel gridding as an indicator, compare the algorithm in this paper with the algorithm in literature [15–19]. To ensure the efficiency of the algorithm in this paper, the comparison results are shown in Table 1.Table 1
Time-consuming comparison of superpixel gridding(s).
AlgorithmPixel block/piece1000200030004000Literature [15] algorithm0.50.81.21.6Literature [16] algorithm0.91.21.52.0Literature [17] algorithm1.21.61.82.0Literature [18] algorithm1.31.51.51.9Literature [19] algorithm0.81.51.92.5The proposed algorithm0.30.50.60.8Analyzing the time-consuming of superpixel gridding of different algorithms in Table1, it can be seen that as the number of pixel blocks increases, the time-consuming gridding increases, but the algorithm in this paper has a faster overall speed, with the highest time-consuming 0.8 s, literature [19]. The algorithm has the highest time-consuming 2.5 s when the number of pixel blocks is 4000, the highest time-consuming of the algorithm in literature [16] and literature [17] reaches 2.0 s, and the algorithm in literature [15] takes a short time when there are fewer pixel blocks. But with the increase in the number of pixel blocks, the time-consuming increases rapidly, which is much higher than the algorithm in this paper. According to the data comparison, the CT image gridding effect of the algorithm in this paper is better, which is inseparable from the use of superpixels for analysis.


#### 6.4.2. Experiment 3

Use theδ fitness of the weights for analysis. Usually, the fitness factor is higher than 0.5, which means the fitness is good. The fitness of the weights δ used in the algorithm in this paper is shown in Table 2.Table 2
Fitness of weightδ.
Experiment times/timeFitness factor500.661000.691500.752000.782500.80Analysis of Table2 shows that the weights used in the algorithm of this paper have a fitness higher δ than 0.5 in the course of many experiments, which proves that this paper has a good calculation effect on the salience value and can accurately complete the image edge acquisition, that is, the initial. The determination of the contour has certain accuracy, which lays the foundation for the determination of the final segmentation contour of the subsequent image. At the same time, it is proved that this paper uses the center-surround contrast idea to calculate the significant area of the image edge with a certain degree of reliability.


#### 6.4.3. Experiment 4

The value range ofVCCR the correct classification coefficient is usually between [0, 1].The higher the value, the better the algorithm performance. In order to verify the superior segmentation performance of the proposed algorithm, the proposed algorithm is compared with the literature [15–19]. It is shown in Figure 3.Figure 3
Comparison of correct classification coefficients.According to the comparison chart of correct classification coefficient in Figure2, it can be clearly found that the overall curve of the algorithm in this paper is higher than that of other literature algorithms, and the correct classification coefficient is as high as 0.9, followed by the literature [16] algorithm. The correct classification coefficient is [0.5, 0.8]. The algorithm of literature [17] has a maximum value of 0.7, literature [15] has a rapid growth trend, but the maximum does not exceed 0.7, and the maximum value of the remaining literature algorithms is below 0.7. The reason is that the algorithm in this paper first uses superpixels to improve the region growth criteria, calculates the salience value of the edge region of the image, and obtains the initial contour, which provides a basis for obtaining the final segmentation contour and improves the accuracy of pixel classification.


#### 6.4.4. Experiment Five

The comparison results of algorithm segmentation accuracy for CT images are shown in Figure4.Figure 4
Comparison of segmentation accuracy.According to the segmentation accuracy curve in Figure4, it can be found that the algorithm in this paper has very obvious advantages, and the segmentation accuracy is always higher than 90%. Among other documents, the average accuracy of literature [18] and literature [19] is above 80%, followed by literature [15]. In comparison, literature [16] and literature [17] have lower image segmentation accuracy. The average level is around 70%. Based on the initial contours obtained, this paper uses the level set method to improve the Mumford-Shah model in the active contour model. The improved active contour model is used for image segmentation, and the segmentation accuracy is higher.


## 6.1. Experimental Environment and Data Set

In order to verify the effectiveness of the algorithm proposed in this paper, a comparative experiment was designed to highlight the performance of this algorithm. This experiment is run in the same environment, with 3.2GHz CPU, Intel i7-6700 as the central processing unit, Windows 10 as the computer operating system, and running in the experimental platform MATLAB.The experimental data comes from the TCIA data set and DeepLesion data set.TCIA data set. This data set is a large-scale medical. The medical data set contains various image data such as CT and MRI, with abundant clinical medical informationDeepLesion data set. It includes more than 32,000 lesion labels from more than 10,000 case studies, including image data of lesions in the lung, kidney, bone, lymph, and abdomen, a relatively comprehensive medical image data set currently releasedThe lung CT images, brain CT images, and vertebra CT images are selected from the above two data sets; 30 million are selected for each data set, for a total of 60 million data. Half of them are used as training data sets, and half are used as test data sets.The2×2 grid was used to input images, and lung CT images, brain CT images, and vertebral CT images were selected from TCIA data set and deep vision data set. Each data set selected 30 million, a total of 60 million data, of which 40 million were used as training data set, 10 million as verification data set, 10 million as validation data set, and 1000 as test data set.


## 6.2. Experimental Steps

(1)
First installed basic operating software, including CPU acceleration software, combined with the experimental environment parameters set above, and run in the experimental platform MATLAB(2)
Select the superpixel gridding parameter by multiple experiments, that is, the number of pixel blocksL to be divided. In this experiment, the final value of L is selected within [1000-3000](3)
Construct an improved Mumford-Shah model for training, input the test data set after the training is completed, and run the algorithm in the set experimental environment(4)
Repeat experiments to verify the effectiveness of the proposed algorithm


## 6.3. Experimental Indicators

(1)
CT Image Segmentation Results and Manual Segmentation Results.Taking the lung CT images, brain CT images, and vertebra CT images as the objects, respectively, the segmentation maps are drawn by computer, and at the same time, to verify the segmentation effect of the algorithm in this paper, compare the results with manual segmentation.(2)
Superpixel Grid Time-Consuming: Superpixel Grid.Transformation is the prerequisite of image segmentation in this paper. This process requires constant iteration to find the clustering center, so time-consuming can be used as an important indicator to measure the performance of the algorithm.(3)
Image Target Edge Calculation Effect: According to the Public.Equation (12) shows that δ the weight has an important influence on the accuracy of solving the saliency value. δ If the weight is selected properly, the image edge saliency can be calculated accurately. Therefore, the adaptability of δ the weight is selected to judge the accuracy of the algorithm image target edge calculation in this paper.
(4)
Correct Classification Coefficient: Select the Correct Classification System.TheVCCR number is used as an indicator to judge the effect of algorithm segmentation, and the calculation formula is as follows:
(16)VCCR=K′Ktotal,where K′ represents the number of superpixels that are correctly Ktotal segmented and represents the total number of image superpixels.
(5)
Image Segmentation Accuracy: Segmented by CT Image.The accuracy is the index to verify the performance of the algorithm, and the formula is as follows:(17)SEaccu=L1Ltot×100%,where Ltot represents the number of pixel blocks L1actually divided and it represents the number of pixel blocks obtained by algorithmic division.


## 6.4. Results and Discussion

In the environment set in this experiment, the computer is used to draw the lung CT image, brain CT image, and vertebra CT image segmentation of the algorithm in this paper, as shown in the following Figure2.Figure 2
CT image segmentation results.
(a)
CT image of the lung(b)
CT image of the brain(c)
CT images of the vertebraeIt can be seen from Figure2 that the segmentation of lung CT images, brain CT images, and vertebra CT images using the algorithm in this paper is basically consistent with the manual segmentation results, and the segmentation effect is significant, and the accuracy is high, indicating that the algorithm in this paper has a good performance.


### 6.4.1. Experiment 2

Taking the time consumption of superpixel gridding as an indicator, compare the algorithm in this paper with the algorithm in literature [15–19]. To ensure the efficiency of the algorithm in this paper, the comparison results are shown in Table 1.Table 1
Time-consuming comparison of superpixel gridding(s).
AlgorithmPixel block/piece1000200030004000Literature [15] algorithm0.50.81.21.6Literature [16] algorithm0.91.21.52.0Literature [17] algorithm1.21.61.82.0Literature [18] algorithm1.31.51.51.9Literature [19] algorithm0.81.51.92.5The proposed algorithm0.30.50.60.8Analyzing the time-consuming of superpixel gridding of different algorithms in Table1, it can be seen that as the number of pixel blocks increases, the time-consuming gridding increases, but the algorithm in this paper has a faster overall speed, with the highest time-consuming 0.8 s, literature [19]. The algorithm has the highest time-consuming 2.5 s when the number of pixel blocks is 4000, the highest time-consuming of the algorithm in literature [16] and literature [17] reaches 2.0 s, and the algorithm in literature [15] takes a short time when there are fewer pixel blocks. But with the increase in the number of pixel blocks, the time-consuming increases rapidly, which is much higher than the algorithm in this paper. According to the data comparison, the CT image gridding effect of the algorithm in this paper is better, which is inseparable from the use of superpixels for analysis.


### 6.4.2. Experiment 3

Use theδ fitness of the weights for analysis. Usually, the fitness factor is higher than 0.5, which means the fitness is good. The fitness of the weights δ used in the algorithm in this paper is shown in Table 2.Table 2
Fitness of weightδ.
Experiment times/timeFitness factor500.661000.691500.752000.782500.80Analysis of Table2 shows that the weights used in the algorithm of this paper have a fitness higher δ than 0.5 in the course of many experiments, which proves that this paper has a good calculation effect on the salience value and can accurately complete the image edge acquisition, that is, the initial. The determination of the contour has certain accuracy, which lays the foundation for the determination of the final segmentation contour of the subsequent image. At the same time, it is proved that this paper uses the center-surround contrast idea to calculate the significant area of the image edge with a certain degree of reliability.


### 6.4.3. Experiment 4

The value range ofVCCR the correct classification coefficient is usually between [0, 1].The higher the value, the better the algorithm performance. In order to verify the superior segmentation performance of the proposed algorithm, the proposed algorithm is compared with the literature [15–19]. It is shown in Figure 3.Figure 3
Comparison of correct classification coefficients.According to the comparison chart of correct classification coefficient in Figure2, it can be clearly found that the overall curve of the algorithm in this paper is higher than that of other literature algorithms, and the correct classification coefficient is as high as 0.9, followed by the literature [16] algorithm. The correct classification coefficient is [0.5, 0.8]. The algorithm of literature [17] has a maximum value of 0.7, literature [15] has a rapid growth trend, but the maximum does not exceed 0.7, and the maximum value of the remaining literature algorithms is below 0.7. The reason is that the algorithm in this paper first uses superpixels to improve the region growth criteria, calculates the salience value of the edge region of the image, and obtains the initial contour, which provides a basis for obtaining the final segmentation contour and improves the accuracy of pixel classification.


### 6.4.4. Experiment Five

The comparison results of algorithm segmentation accuracy for CT images are shown in Figure4.Figure 4
Comparison of segmentation accuracy.According to the segmentation accuracy curve in Figure4, it can be found that the algorithm in this paper has very obvious advantages, and the segmentation accuracy is always higher than 90%. Among other documents, the average accuracy of literature [18] and literature [19] is above 80%, followed by literature [15]. In comparison, literature [16] and literature [17] have lower image segmentation accuracy. The average level is around 70%. Based on the initial contours obtained, this paper uses the level set method to improve the Mumford-Shah model in the active contour model. The improved active contour model is used for image segmentation, and the segmentation accuracy is higher.


## 6.4.1. Experiment 2

Taking the time consumption of superpixel gridding as an indicator, compare the algorithm in this paper with the algorithm in literature [15–19]. To ensure the efficiency of the algorithm in this paper, the comparison results are shown in Table 1.Table 1
Time-consuming comparison of superpixel gridding(s).
AlgorithmPixel block/piece1000200030004000Literature [15] algorithm0.50.81.21.6Literature [16] algorithm0.91.21.52.0Literature [17] algorithm1.21.61.82.0Literature [18] algorithm1.31.51.51.9Literature [19] algorithm0.81.51.92.5The proposed algorithm0.30.50.60.8Analyzing the time-consuming of superpixel gridding of different algorithms in Table1, it can be seen that as the number of pixel blocks increases, the time-consuming gridding increases, but the algorithm in this paper has a faster overall speed, with the highest time-consuming 0.8 s, literature [19]. The algorithm has the highest time-consuming 2.5 s when the number of pixel blocks is 4000, the highest time-consuming of the algorithm in literature [16] and literature [17] reaches 2.0 s, and the algorithm in literature [15] takes a short time when there are fewer pixel blocks. But with the increase in the number of pixel blocks, the time-consuming increases rapidly, which is much higher than the algorithm in this paper. According to the data comparison, the CT image gridding effect of the algorithm in this paper is better, which is inseparable from the use of superpixels for analysis.


## 6.4.2. Experiment 3

Use theδ fitness of the weights for analysis. Usually, the fitness factor is higher than 0.5, which means the fitness is good. The fitness of the weights δ used in the algorithm in this paper is shown in Table 2.Table 2
Fitness of weightδ.
Experiment times/timeFitness factor500.661000.691500.752000.782500.80Analysis of Table2 shows that the weights used in the algorithm of this paper have a fitness higher δ than 0.5 in the course of many experiments, which proves that this paper has a good calculation effect on the salience value and can accurately complete the image edge acquisition, that is, the initial. The determination of the contour has certain accuracy, which lays the foundation for the determination of the final segmentation contour of the subsequent image. At the same time, it is proved that this paper uses the center-surround contrast idea to calculate the significant area of the image edge with a certain degree of reliability.


## 6.4.3. Experiment 4

The value range ofVCCR the correct classification coefficient is usually between [0, 1].The higher the value, the better the algorithm performance. In order to verify the superior segmentation performance of the proposed algorithm, the proposed algorithm is compared with the literature [15–19]. It is shown in Figure 3.Figure 3
Comparison of correct classification coefficients.According to the comparison chart of correct classification coefficient in Figure2, it can be clearly found that the overall curve of the algorithm in this paper is higher than that of other literature algorithms, and the correct classification coefficient is as high as 0.9, followed by the literature [16] algorithm. The correct classification coefficient is [0.5, 0.8]. The algorithm of literature [17] has a maximum value of 0.7, literature [15] has a rapid growth trend, but the maximum does not exceed 0.7, and the maximum value of the remaining literature algorithms is below 0.7. The reason is that the algorithm in this paper first uses superpixels to improve the region growth criteria, calculates the salience value of the edge region of the image, and obtains the initial contour, which provides a basis for obtaining the final segmentation contour and improves the accuracy of pixel classification.


## 6.4.4. Experiment Five

The comparison results of algorithm segmentation accuracy for CT images are shown in Figure4.Figure 4
Comparison of segmentation accuracy.According to the segmentation accuracy curve in Figure4, it can be found that the algorithm in this paper has very obvious advantages, and the segmentation accuracy is always higher than 90%. Among other documents, the average accuracy of literature [18] and literature [19] is above 80%, followed by literature [15]. In comparison, literature [16] and literature [17] have lower image segmentation accuracy. The average level is around 70%. Based on the initial contours obtained, this paper uses the level set method to improve the Mumford-Shah model in the active contour model. The improved active contour model is used for image segmentation, and the segmentation accuracy is higher.


## 7. Conclusions

The use of CT image detection to assist in clinical medical diagnosis has become the current mainstream. Image segmentation is an important step in image processing, and the results of segmentation play a cornerstone role in image three-dimensional reconstruction and other processing. At present, CT images are still a hot issue in medical image research. In order to obtain more accurate image segmentation results, this paper improves the active contour model and completes the superpixel grid CT image segmentation using the improved model. In the process of algorithm research, the problem of initial contour of the image is mainly considered, superpixels are used to improve the region growth criterion, the significant edge area is calculated, the initial contour is obtained, and the problem is solved by calculating the function based on the initial contour, and the final CT image segmentation is successfully completed. The results show that the proposed algorithm has high segmentation accuracy and short time-consuming, which provides a basis for CT image research.However, this research still has certain shortcomings. The edge salient area obtained by using the region growth criterion and center-surround contrast can only get the largest salient area. In the future, a global saliency calculation method needs to be found to provide more efficient CT image segmentation. In addition, the processing of different types of medical images is also a direction that needs to be studied in the future to provide more useful help for medical diagnosis.



---

*Source: 2906868-2021-06-04.xml*