# Visual Three-Dimensional Reconstruction of Aortic Dissection Based on Medical CT Images

Authors: Xiaojie Duan; Dandan Chen; Jianming Wang; Meichen Shi; Qingliang Chen; He Zhao; Ruixue Zuo; Xiuyan Li; Qi Wang
Journal: International Journal of Digital Multimedia Broadcasting
 (2017)

---

## Abstract

With the rapid development of CT technology, especially the higher resolution of CT machine and a sharp increase in the amount of slices, to extract and three-dimensionally display aortic dissection from the huge medical image data became a challenging task. In this paper, active shape model combined with spatial continuity was adopted to realize automatic reconstruction of aortic dissection. First, we marked aortic feature points from big data sample library and registered training samples to build a statistical model. Meanwhile, gray vectors were sampled by utilizing square matrix, which set the landmarks as the center. Posture parameters of the initial shape were automatically adjusted by the method of spatial continuity between CT sequences. The contrast experiment proved that the proposed algorithm could realize accurate aorta segmentation without selecting the interested region, and it had higher accuracy than GVF snake algorithm (93.29% versus 87.54% on aortic arch, 94.30% versus 89.25% on descending aorta). Aortic dissection membrane was extracted via Hessian matrix and Bayesian theory. Finally, the three-dimensional visualization of the aortic dissection was completed by volume rendering based on the ray casting method to assist the doctors in clinical diagnosis, which contributed to improving the success rate of the operations.


---

## Body

## 1. Introduction

Aortic dissection (AD) is a cardiovascular disease that is a dangerous threat to human health, which can quickly lead to death [1]. The main reason for this disease is that tissue weakness and high blood pressure lead to one or more aortic tissues perforation(s), blood flow along the intimae resulting in two separate blood flow channels: the true lumen (the primary aorta bed of blood flow) and the false lumen (a channel entirely within the media which appears during an aortic dissection) [2], as shown in Figure 1.Figure 1
The true and the false lumen.At present, the main separation therapy of aortic dissection is the lumen isolation technique requiring that the clinicians can clearly know the crevasse position, range, quantity, severity, and so on before surgery. In order to improve positive rate of aortic dissection, realize automation guidance to interventional treatment, and achieve precise surgery or postoperative evaluation, the aortic dissection 3D reconstruction system is indispensable. The key technology is to achieve aortic segmentation. Threshold-based methods of image segmentation are challenged by intensity gradients within the image volume [3].And edge detection methods are challenged by poor contrast in the medical images. Methods based on specific theory introduce mathematical models into image segmentation areas, and active shape model (ASM) belongs to the strategy of “top-down”; it combines the prior knowledge of top floor with information at the bottom of the image characteristics and is able to achieve accurate segmentation of complex medical images [4]. In three-dimensional space, there is continuity between CT image sequences; the thicker the slice is, the robuster the continuity is kept between CT slices. Based on the above methods, this paper adopts the method that combines active shape model with spatial continuity to extract aorta area quickly and accurately, which eliminates the interference of other organs by shape constraints in the process of extracting the aorta. Then extract aortic dissection membrane using Hessian matrix. And finally, we make use of volume rendering based on ray casting algorithm to perform three-dimensional reconstruction of the aortic dissection. Moreover, we set the transparency and colors of aortic dissection 3D model to make aortic dissection more intuitive; the location and the size of the intimae crevasse can be easily obtained.


## 2. Principle of System

The principle framework of the proposed three-dimensional reconstruction system is shown in Figure2, via segmentation, extraction, and reconstruction of aortic dissection patients’ CT images, to realize three-dimensional visualization of aortic dissection. Firstly, we preprocess the original CT images in order to eliminate noise and adjust the images’ brightness for subsequent processing. Secondly, the active shape model is used to segment the aorta region, combined with the spatial continuity of the huge number of CT image sequences, automatically adjusting the posture parameters of the initial shape of each layer to improve the degree of automation and precision of the segmentation algorithm. Next, use gray gradient changes between aortic wall and membrane to extract the aortic dissection membrane by Hessian matrix and continuity a priori model. Finally, three-dimensionally reconstruct the aorta structure by volume rendering and set the transparency and colors of the aortic dissection three-dimensional model to make the interval more intuitive and clear. Ultimately, the system can provide help for clinical diagnosis and measures.Figure 2
The framework of the three-dimensional reconstruction system.


## 3. Implementation Method

### 3.1. Aorta Segmentation

Due to the complexity of the three-dimensional structure of the aorta, especially the aortic arch and descending aorta shape big differences, we need to set up aortic arch and descending aorta training set, respectively. In this paper, the training set of the aortic arch and descending aorta are composed of a quantity of samples extracted by equal interval from the aortic dissection patients’ CT sequence which contain all the changes in the shape. The two training sets can reflect all the patterns of shape change. We select multiple typical aortic dissection patients’ CT images from the Tianjin chest hospital to build the aortic arch and descending aorta model library; different patients have different aortic CT sequence numbers, in the range of about 700~1000 on average. In order to model a shape, we represent it by a set of landmark points. This must be done for each shape in the training set and must be done correctly and accurately [5]. The number of feature points on each CT image must be consistent. The labeling is important, and each label represents a particular part of the aorta or its boundary [6, 7]. In general, we choose points marking parts of the object with particular application-dependent significance, points marking application-dependent things, and other points that can be interpolated from points of types above [8]. Aortic arch and descending aorta landmark points obtained by the expert are shown in Figure 3, and after marking feature points in each CT image we pick up the aortic arch and descending aorta training sample sets are derived, respectively.Figure 3
Landmark points marking.
(a)
Aortic arch landmark points
(b)
Descending aorta landmark pointsAccording to landmark points, we build aorta big data model library. There is a big deviation in shape and position of different samples, so before modeling, we need to normalized registration shape vectors of two training sets, so as to realize the model building of the aorta [9]. Firstly, select one CT image, respectively, as a benchmark sample from two groups of big data training set, and then scale, rotate, and translate other samples in the library to align them with the benchmark sample; while all the differences between those samples and the reference sample are less than the setting threshold, registration is completed. Registration results of two groups of training set, respectively, are shown in Figure 4, and the horizontal ordinate represents the pixel coordinates in CT image.Figure 4
Registration results.
(a)
Aortic arch sample set before registration
(b)
Aortic arch sample set after registration
(c)
Descending aorta sample set before registration
(d)
Descending aorta sample set after registrationAortic model building is a high-dimensional data processing. In order to simplify calculation process, this paper applies Principal Component Analysis (PCA) approach to reduce dimensionality of the training set which involves all shape vectors to determine the main components [10]. The mean shape vector of the aortic training sample set is calculated by (1)X-=1N∑i=1NXi,Xi=xi1,yi1,xi2,yi2,…,xin,yinT,where N is the number of the samples of the training set; Xi represents the shape vector by stacking n landmark points; then calculate the covariance matrix S by(2)S=1N-1∑i=1NXi-X-Xi-X-T.Calculate the eigenvectorsϕi corresponding to the eigenvalues λi, arrange the eigenvalues in descending order, and choose k eigenvectors which are relative to k bigger eigenvalues, several changing patterns that describe the observed variation of the training set; at the same time, k eigenvalues need to satisfy the formula as follows:(3)∑i=1kλi≥ρ∑i=12nλi,where ρ=0.72 [11]; the search accuracy can reach the highest by the principal components of 72%, and for the general value of 98%, too many constraints will appear when searching. Ultimately, the shape model can be approximated by(4)X=X-+ΦB,where Φ is the first k eigenvectors, Φ=ϕ1,ϕ2,…,ϕk, and B is the projection coefficient on the principal component of the shape vector which is calculated as B=b1,b2,…,bkT; suitable limits of bi are typically determined in the range of (-3√λi,3√λi), to make sure the active shape model changes within a small range.The gray-scale texture model is established to match and search target contour at the time that the shape statistical model is built. In this paper, the gray-scale texture model for each landmark is carried out by putting the point as the center of the square of gray sampling, avoiding the traditional method using only the vertical direction information, leading to incomplete search and error convergence. Each landmark gray vectorgji mean and covariance of vector in the training sample can be approximated by(5)g¯j=1N∑i=1Ngji,j=1,2,…,n,Sj=1N∑i=1Ngji-g¯jgji-g¯jT,j=1,2,…,n.We minimize the Mahalanobis distance between a new profile and the model in the subsequent matching search process as a standard; the matching function is expressed as(6)fGj=Gj-g¯jTSj-1Gj-g¯j,where Gj is the gray vector of the jth feature point of the matching image; we get the best matching point when the matching function takes the minimum, and when we find all the matching points, the new profile is obtained.In order to improve the efficiency and robustness of the model, multiresolution search strategy is adopted [12]. 1 mm thickness at the time of CT scanning is used; therefore a complete set of aorta CT image sequences can be seen continuous, and based on CT image sequence space continuity, by adjusting the initial shape parameters to make the contour close to the target area, the target contour parameters, which are derived from the former image, are used to adjust the current layer, by repeating the above operation between layers. High efficient and accurate segmentation of CT images can be realized; the algorithm is of high degree automation. Figure 5 shows the final segmentation results after iteration convergence.Figure 5
Final result after iteration convergence.
(a)
Descending aorta from segmentation
(b)
Aortic arch from segmentation


### 3.2. Aortic Dissection Extraction and Three-Dimensional Reconstruction

In this paper, we propose a detection algorithm combining Hessian matrix and spatial continuity a priori model. The Hessian matrix can be used to extract the pixels on the dissection and aortic boundary [13], the result is shown in Figure 6(a), and then use the Bayesian theory of spatial continuity model to remove other nontarget pixels, that is, only the dissection membrane pixels extracted; the result is shown in Figure 6(b). This algorithm makes full use of the continuity between the CT images of each layer and limits the offset error of the interlayer membrane to a very small range and realizes the accurate extraction of the interlayer membrane.Figure 6
Aortic dissection extraction result.
(a)
Contour pixel feature points extraction result
(b)
Aortic dissection resultsAfter the aorta segmentation and dissection membrane extraction are complete, the ray casting is carried out to reconstruct the structure. The ray casting method is a direct volume rendering algorithm based on the image sequence [14]. The specific reconstruction process is as follows.(1)
Read the three-dimensional discrete data field; set different opacity values and color values according to the size of the voxels’ pixel values of vertices.(2)
A ray is emitted from each point of the screen based on the direction of the line of sight so that the rays pass through the data field space andk samples are selected equidistantly across all the rays.(3)
The opacity value and the color value of each sampling point are calculated by the trilinear interpolation algorithm using the data values of the eight vertices nearest to the sampling point.(4)
Calculate the opacity and color values for all pixels on the screen based on the cumulative order from front to back.(5)
The opacity value and the color value of each pixel obtained are projected onto the imaging screen to generate the final three-dimensional image.The final 3D reconstruction of a group of aortic region is as shown in Figure7. By setting the aorta transparency and color, the interlayer is shown in red to give the final reconstruction results, as shown in Figure 8.Figure 7
3D visualization of the aorta region.Figure 8
3D visualization of aortic dissection.


## 3.1. Aorta Segmentation

Due to the complexity of the three-dimensional structure of the aorta, especially the aortic arch and descending aorta shape big differences, we need to set up aortic arch and descending aorta training set, respectively. In this paper, the training set of the aortic arch and descending aorta are composed of a quantity of samples extracted by equal interval from the aortic dissection patients’ CT sequence which contain all the changes in the shape. The two training sets can reflect all the patterns of shape change. We select multiple typical aortic dissection patients’ CT images from the Tianjin chest hospital to build the aortic arch and descending aorta model library; different patients have different aortic CT sequence numbers, in the range of about 700~1000 on average. In order to model a shape, we represent it by a set of landmark points. This must be done for each shape in the training set and must be done correctly and accurately [5]. The number of feature points on each CT image must be consistent. The labeling is important, and each label represents a particular part of the aorta or its boundary [6, 7]. In general, we choose points marking parts of the object with particular application-dependent significance, points marking application-dependent things, and other points that can be interpolated from points of types above [8]. Aortic arch and descending aorta landmark points obtained by the expert are shown in Figure 3, and after marking feature points in each CT image we pick up the aortic arch and descending aorta training sample sets are derived, respectively.Figure 3
Landmark points marking.
(a)
Aortic arch landmark points
(b)
Descending aorta landmark pointsAccording to landmark points, we build aorta big data model library. There is a big deviation in shape and position of different samples, so before modeling, we need to normalized registration shape vectors of two training sets, so as to realize the model building of the aorta [9]. Firstly, select one CT image, respectively, as a benchmark sample from two groups of big data training set, and then scale, rotate, and translate other samples in the library to align them with the benchmark sample; while all the differences between those samples and the reference sample are less than the setting threshold, registration is completed. Registration results of two groups of training set, respectively, are shown in Figure 4, and the horizontal ordinate represents the pixel coordinates in CT image.Figure 4
Registration results.
(a)
Aortic arch sample set before registration
(b)
Aortic arch sample set after registration
(c)
Descending aorta sample set before registration
(d)
Descending aorta sample set after registrationAortic model building is a high-dimensional data processing. In order to simplify calculation process, this paper applies Principal Component Analysis (PCA) approach to reduce dimensionality of the training set which involves all shape vectors to determine the main components [10]. The mean shape vector of the aortic training sample set is calculated by (1)X-=1N∑i=1NXi,Xi=xi1,yi1,xi2,yi2,…,xin,yinT,where N is the number of the samples of the training set; Xi represents the shape vector by stacking n landmark points; then calculate the covariance matrix S by(2)S=1N-1∑i=1NXi-X-Xi-X-T.Calculate the eigenvectorsϕi corresponding to the eigenvalues λi, arrange the eigenvalues in descending order, and choose k eigenvectors which are relative to k bigger eigenvalues, several changing patterns that describe the observed variation of the training set; at the same time, k eigenvalues need to satisfy the formula as follows:(3)∑i=1kλi≥ρ∑i=12nλi,where ρ=0.72 [11]; the search accuracy can reach the highest by the principal components of 72%, and for the general value of 98%, too many constraints will appear when searching. Ultimately, the shape model can be approximated by(4)X=X-+ΦB,where Φ is the first k eigenvectors, Φ=ϕ1,ϕ2,…,ϕk, and B is the projection coefficient on the principal component of the shape vector which is calculated as B=b1,b2,…,bkT; suitable limits of bi are typically determined in the range of (-3√λi,3√λi), to make sure the active shape model changes within a small range.The gray-scale texture model is established to match and search target contour at the time that the shape statistical model is built. In this paper, the gray-scale texture model for each landmark is carried out by putting the point as the center of the square of gray sampling, avoiding the traditional method using only the vertical direction information, leading to incomplete search and error convergence. Each landmark gray vectorgji mean and covariance of vector in the training sample can be approximated by(5)g¯j=1N∑i=1Ngji,j=1,2,…,n,Sj=1N∑i=1Ngji-g¯jgji-g¯jT,j=1,2,…,n.We minimize the Mahalanobis distance between a new profile and the model in the subsequent matching search process as a standard; the matching function is expressed as(6)fGj=Gj-g¯jTSj-1Gj-g¯j,where Gj is the gray vector of the jth feature point of the matching image; we get the best matching point when the matching function takes the minimum, and when we find all the matching points, the new profile is obtained.In order to improve the efficiency and robustness of the model, multiresolution search strategy is adopted [12]. 1 mm thickness at the time of CT scanning is used; therefore a complete set of aorta CT image sequences can be seen continuous, and based on CT image sequence space continuity, by adjusting the initial shape parameters to make the contour close to the target area, the target contour parameters, which are derived from the former image, are used to adjust the current layer, by repeating the above operation between layers. High efficient and accurate segmentation of CT images can be realized; the algorithm is of high degree automation. Figure 5 shows the final segmentation results after iteration convergence.Figure 5
Final result after iteration convergence.
(a)
Descending aorta from segmentation
(b)
Aortic arch from segmentation


## 3.2. Aortic Dissection Extraction and Three-Dimensional Reconstruction

In this paper, we propose a detection algorithm combining Hessian matrix and spatial continuity a priori model. The Hessian matrix can be used to extract the pixels on the dissection and aortic boundary [13], the result is shown in Figure 6(a), and then use the Bayesian theory of spatial continuity model to remove other nontarget pixels, that is, only the dissection membrane pixels extracted; the result is shown in Figure 6(b). This algorithm makes full use of the continuity between the CT images of each layer and limits the offset error of the interlayer membrane to a very small range and realizes the accurate extraction of the interlayer membrane.Figure 6
Aortic dissection extraction result.
(a)
Contour pixel feature points extraction result
(b)
Aortic dissection resultsAfter the aorta segmentation and dissection membrane extraction are complete, the ray casting is carried out to reconstruct the structure. The ray casting method is a direct volume rendering algorithm based on the image sequence [14]. The specific reconstruction process is as follows.(1)
Read the three-dimensional discrete data field; set different opacity values and color values according to the size of the voxels’ pixel values of vertices.(2)
A ray is emitted from each point of the screen based on the direction of the line of sight so that the rays pass through the data field space andk samples are selected equidistantly across all the rays.(3)
The opacity value and the color value of each sampling point are calculated by the trilinear interpolation algorithm using the data values of the eight vertices nearest to the sampling point.(4)
Calculate the opacity and color values for all pixels on the screen based on the cumulative order from front to back.(5)
The opacity value and the color value of each pixel obtained are projected onto the imaging screen to generate the final three-dimensional image.The final 3D reconstruction of a group of aortic region is as shown in Figure7. By setting the aorta transparency and color, the interlayer is shown in red to give the final reconstruction results, as shown in Figure 8.Figure 7
3D visualization of the aorta region.Figure 8
3D visualization of aortic dissection.


## 4. Experimental Results and Discussions

### 4.1. Experimental Results

Figure9 shows a three-dimensional model of the aortic dissection of the other two patients reconstructed by the above method. It is clear from the three-dimensional reconstructed images that the dissection membrane occurs in the entire aortic cavity in the first set of models, and the dissection membrane of the second group appears in the aortic arch away from the heart. The results of the two groups intuitively and clearly show the location and extent of the break, so the method provides much more space relationship information of the aortic dissection to the attending physician for the diagnosis of the diseases, surgery, and postoperative evaluation to provide assistance.Figure 9
3D visualization model of another two patients with aortic dissection.
(a)
The first patient’s aortic dissection display
(b)
The second patient’s aortic dissection display


### 4.2. Segmentation Accuracy

In order to verify the algorithm for segmentation of CT image sequence aortic extraction effect, compare the aortic arch and descending aorta extraction results on this proposed method with those based on GVF snake algorithm. To test and verify the reliability of above two algorithms, we compare the extraction results by algorithms above with the manual results by doctor of rich clinical experience and calculate the overlapping rate to test the reliability of the algorithm in this paper; the extraction results by three methods are shown in Figure10.Figure 10
Aortic arch and descending aorta segmentation results by three methods.
(a)
Aortic arch and descending aorta manual segmentation results
(b)
Segmentation results by GVF snake method
(c)
Segmentation results by this proposed methodWe can obtain that, for descending aorta, the segmentation results by both GVF snake model and the proposed segmentation algorithm are close to the real target contour. While for the aortic arch the GVF snake algorithm has certain errors, because of the absence of shape constraints, the curve is vulnerable to the interference of other organizations around the outline in the process of evolution, which is shown in Figure11(a); curve 1 is the initial curve, and curve 2 is the end evolution of the curve. In order to avoid impact from other groups’ contour in the curve evolution, the GVF snake model firstly determines the aorta interested area which involves complete aorta area but as far as possible to introduce the interference of other organizations [15, 16]. Generally speaking, fixed location areas or template matching methods are chosen, which are with low repeatability and adaptability, and the selecting accuracy directly affects the subsequent partitioning extraction results. However we can achieve the aorta automatic segmentation result after directly inputting one CT image with our proposed method. Figure 11(b) shows the iteration results by our proposed method. And this algorithm is of higher degree of automation and stronger robustness than GVF snake model.Figure 11
Iteration results based on two methods.
(a)
Iteration result based on GVF snake method
(b)
Iteration result based on the proposed methodIn order to quantitatively describe the accuracy of the algorithm in this paper, using the overlap rate as evaluation indexes,(7)Overlap=AabAa+Ab-Aab;Aa and Ab, respectively, represent the proportion of the target area from the two images’ segmentation; Aab is the proportion of the target zone overlapping. With thoracic hospital doctors manual segmentation result as the gold standard, our experiment selects large number of images from groups of patients’ CT images and then calculates the two algorithms’ overlap, respectively, and some samples results of those all are displayed in Table 1.Table 1
Two segmentation algorithms’ overlap ratio.
GVF snake method (aortic arch)
Our proposed method (aortic arch)
GVF snake method (descending aorta)
Our proposed method (descending aorta)
Sample 1
84.52%
92.32%
89.75%
95.59%
Sample 2
86.51%
92.97%
88.16%
94.98%
Sample 3
87.63%
93.09%
90.03%
93.26%
Sample 4
89.95%
94.65%
89.80%
93.76%
Sample 5
88.02%
93.23%
88.70%
94.07%
Sample 6
88.63%
93.45%
89.04%
94.12%For extraction accuracy, the proposed method is obviously of higher overlap ratio than the GVF snake method from the table (93.29% versus 87.54% on aortic arch, 94.30% versus 89.25% on descending aorta).


## 4.1. Experimental Results

Figure9 shows a three-dimensional model of the aortic dissection of the other two patients reconstructed by the above method. It is clear from the three-dimensional reconstructed images that the dissection membrane occurs in the entire aortic cavity in the first set of models, and the dissection membrane of the second group appears in the aortic arch away from the heart. The results of the two groups intuitively and clearly show the location and extent of the break, so the method provides much more space relationship information of the aortic dissection to the attending physician for the diagnosis of the diseases, surgery, and postoperative evaluation to provide assistance.Figure 9
3D visualization model of another two patients with aortic dissection.
(a)
The first patient’s aortic dissection display
(b)
The second patient’s aortic dissection display


## 4.2. Segmentation Accuracy

In order to verify the algorithm for segmentation of CT image sequence aortic extraction effect, compare the aortic arch and descending aorta extraction results on this proposed method with those based on GVF snake algorithm. To test and verify the reliability of above two algorithms, we compare the extraction results by algorithms above with the manual results by doctor of rich clinical experience and calculate the overlapping rate to test the reliability of the algorithm in this paper; the extraction results by three methods are shown in Figure10.Figure 10
Aortic arch and descending aorta segmentation results by three methods.
(a)
Aortic arch and descending aorta manual segmentation results
(b)
Segmentation results by GVF snake method
(c)
Segmentation results by this proposed methodWe can obtain that, for descending aorta, the segmentation results by both GVF snake model and the proposed segmentation algorithm are close to the real target contour. While for the aortic arch the GVF snake algorithm has certain errors, because of the absence of shape constraints, the curve is vulnerable to the interference of other organizations around the outline in the process of evolution, which is shown in Figure11(a); curve 1 is the initial curve, and curve 2 is the end evolution of the curve. In order to avoid impact from other groups’ contour in the curve evolution, the GVF snake model firstly determines the aorta interested area which involves complete aorta area but as far as possible to introduce the interference of other organizations [15, 16]. Generally speaking, fixed location areas or template matching methods are chosen, which are with low repeatability and adaptability, and the selecting accuracy directly affects the subsequent partitioning extraction results. However we can achieve the aorta automatic segmentation result after directly inputting one CT image with our proposed method. Figure 11(b) shows the iteration results by our proposed method. And this algorithm is of higher degree of automation and stronger robustness than GVF snake model.Figure 11
Iteration results based on two methods.
(a)
Iteration result based on GVF snake method
(b)
Iteration result based on the proposed methodIn order to quantitatively describe the accuracy of the algorithm in this paper, using the overlap rate as evaluation indexes,(7)Overlap=AabAa+Ab-Aab;Aa and Ab, respectively, represent the proportion of the target area from the two images’ segmentation; Aab is the proportion of the target zone overlapping. With thoracic hospital doctors manual segmentation result as the gold standard, our experiment selects large number of images from groups of patients’ CT images and then calculates the two algorithms’ overlap, respectively, and some samples results of those all are displayed in Table 1.Table 1
Two segmentation algorithms’ overlap ratio.
GVF snake method (aortic arch)
Our proposed method (aortic arch)
GVF snake method (descending aorta)
Our proposed method (descending aorta)
Sample 1
84.52%
92.32%
89.75%
95.59%
Sample 2
86.51%
92.97%
88.16%
94.98%
Sample 3
87.63%
93.09%
90.03%
93.26%
Sample 4
89.95%
94.65%
89.80%
93.76%
Sample 5
88.02%
93.23%
88.70%
94.07%
Sample 6
88.63%
93.45%
89.04%
94.12%For extraction accuracy, the proposed method is obviously of higher overlap ratio than the GVF snake method from the table (93.29% versus 87.54% on aortic arch, 94.30% versus 89.25% on descending aorta).


## 5. Conclusions

This paper introduces a kind of medical CT image processing method to rapidly and accurately obtain aortic dissection characteristic from huge CT image data and to three-dimensionally reconstruct the structure for doctors in clinical diagnosis. The algorithm of this paper has been improved on the basis of the traditional ASM algorithms; not only is the statistical model more accurately constructed and the accuracy of the model matching improved, but also the initialization process combined with the continuity of the CT sequence is simplified and the algorithm effectiveness is improved. Compared to GVF snake algorithm, the experiment can be a strong proof that our algorithm can effectively improve the accuracy of aorta segmentation. This method of this paper can effectively make up for the inadequacy of existing hospital equipment function, so that the attending physicians and patients can deeply understand and grasp the state of the illness. At the same time, for other cardiovascular diseases’ diagnosis and treatment, this method is of great significance.



---

*Source: 3163759-2017-07-19.xml*