Skip to main content
Medical Physics logoLink to Medical Physics
. 2013 Apr 24;40(5):051913. doi: 10.1118/1.4802215

A new segmentation framework based on sparse shape composition in liver surgery planning system

Guotai Wang 1, Shaoting Zhang 2, Feng Li 3, Lixu Gu 3,a)
PMCID: PMC3651215  PMID: 23635283

Abstract

Purpose: To improve the accuracy and the robustness of the segmentation in living donor liver transplantation (LDLT) surgery planning system, the authors present a new segmentation framework that addresses challenges induced by the complex shape variations of patients’ livers with cancer. It is designed to achieve the accurate and robust segmentation of hepatic parenchyma, portal veins, hepatic veins, and tumors in the LDLT surgery planning system.

Methods: The segmentation framework proposed in this paper includes two important modules: (1) The robust shape prior modeling for liver, in which the sparse shape composition (SSC) model is employed to deal with the complex variations of liver shapes and obtain patient-specific liver shape priors. (2) The integration of the liver shape prior with a minimally supervised segmentation algorithm to achieve the accurate segmentation of hepatic parenchyma, portal veins, hepatic veins, and tumors simultaneously. The authors apply this segmentation framework to our previously developed LDLT surgery planning system to enhance its accuracy and robustness when dealing with complex cases of patients with liver cancer.

Results: Compared with the principal component analysis, the SSC model shows a great advantage in handling the complex variations of liver shapes. It also effectively excludes gross errors and outliers that appear in the input shape and preserves local details for specific patients. The proposed segmentation framework was evaluated on the clinical image data of liver cancer patients, and the average symmetric surface distance for hepatic parenchyma, portal veins, hepatic veins, and tumors was 1.07 ± 0.76, 1.09 ± 0.28, 0.92 ± 0.35 and 1.13 ± 0.37 mm, respectively. The Hausdorff distance for these four tissues was 7.68, 4.67, 4.09, and 5.36 mm, respectively.

Conclusions: The proposed segmentation framework improves the robustness of the LDLT surgery planning system remarkably when dealing with complex clinical liver shapes. The SSC model is able to handle non-Gaussian errors and preserve local detail information of the input liver shape. As a result, the proposed framework effectively addresses the problems caused by the complex shape variations of livers with cancer. Our framework not only obtains accurate segmentation results for healthy persons and common patients, but also shows high robustness when dealing with specific patients with large variations of liver shapes in complex clinical environments.

Keywords: liver surgery planning, sparse shape composition, segmentation, shape prior

INTRODUCTION

Liver cancer has been one of the most life-threatening diseases with high mortality and poor prognosis all over the world. In 2008, it was estimated that about 750 000 people were diagnosed with liver cancer and nearly 696 000 people died from this disease worldwide.1 Since it is hard to detect the early signs, most liver cancers are in end-stage when they are diagnosed. The best treatment method is liver transplantation, and an important alternative is liver resection, under the consideration of the scarcity of donor.2 Living donor liver transplantation (LDLT) plays a crucial role to extend the scarce donor pool, which prevents waiting list mortality.3 A detailed knowledge of patient-specific liver anatomy is of great significance in the surgery strategy planning for LDLT. To achieve the best resection plan, surgeons need to identify the location of the liver portion that would be cut off, together with the distribution of intrahepatic vessels and tumors. As a result, the preoperative planning based on medical image is highly important.

The most essential module in the LDLT surgery planning system is the segmentation of liver, intrahepatic vessels, and tumors. However, there are several challenges in the liver segmentation. First, the gray levels of liver and its adjacent organs are very similar. Therefore, there may not be obvious boundaries between these organs and thus traditional methods, such as edge detection and region growing, may include adjacent organs easily. Second, in clinical environments, some special pathologies such as tumor and metastasis usually lead to inhomogeneous gray level appearance. In these cases, tumor and metastasis are quite different from healthy liver regions in terms of gray levels, which may result in under-segmentation of these tissues by traditional methods relying on gray level information. To address these two challenges, shape priors are greatly helpful, since they can assist to separate adjacent organs and preserve intrahepatic tissues despite of the inhomogeneous gray level caused by tumor and metastasis.

Though shape prior-based segmentation seems promising, the effectively modeling liver shape prior is extremely challenging. The reason is that liver shapes and anatomies from different individuals vary considerably, and tumor and metastasis usually make liver shapes even more complex and harder to model. The liver shape variations induced by liver cancer and other pathologies mainly include four types: (1) the expansion of hepatic lobes, (2) the shrinkage of hepatic lobes, (3) the bending of liver shapes, and (4) local gross shape changes due to tumors. In addition, combinations of these basic types result in more complex liver shape variations. Figure 1 shows some liver images from a healthy person and three patients with liver cancer. These images are from computed tomography (CT) scans and include the porta hepatis, a special anatomic structure of the liver. In Fig. 1b, the right liver lobe is much narrower than the normal one in Fig. 1a, while the left liver lobe extends to the left of the body in a larger degree than the normal one. In Fig. 1c, the left liver lobe shrinks greatly and the right lobe is also much smaller than the normal one. In Fig. 1d, the tumor in the left lobe expands the liver dramatically. It can be noticed that both the shape of the whole liver and the local details change in a very large scale among different persons. The variations of liver shapes are so complex that it is very challenging to model them effectively. In clinical environments, it is also very common that tumor and metastasis largely deform the liver, and the resulting high variations of liver shapes among different patients make the accurate modeling and segmentation extremely difficult.

Figure 1.

Figure 1

Examples of the complex variations of liver shapes. (a) shows a transverse slice through the porta hepatis of a healthy person. (b)–(d) show the counterparts of (a) from three patients with liver cancer. The right and left circles show the left and right lobe of the liver, respectively. Notice the large variations of liver shapes.

In this paper, we propose a novel shape prior based segmentation framework to address the aforementioned challenges in the segmentation module of the LDLT surgery planning system. The main contribution of this work is threefold: (1) To address the challenges caused by the complex variations of liver shapes, we employ the sparse shape composition (SSC) to model the shape prior of liver. The SSC model does not have any assumption of the parametric distributions of liver shapes, and it preserves local details of liver shapes well. As a result, the shape prior is patient-specific and accurate enough to model the complex variations of liver shapes. (2) The shape prior method is combined with a minimally supervised segmentation algorithm to segment hepatic parenchyma, intrahepatic vessels and tumors simultaneously. (3) The novel segmentation framework is successfully applied to the clinical application of the LDLT surgery planning system. It achieves robust segmentation when dealing with complex cases of liver cancer patients in clinical environments.

RELATED WORK

Many approaches have been proposed for the segmentation in liver surgery planning systems. In some early researches, the segmentation framework in such systems relied greatly on user interactions, and the liver was segmented slice by slice. For example, the German Cancer Research Center in Heidelberg proposed a framework for liver surgery operation planning system.4 The segmentation framework in this system is based on anatomical landmarks identified by user interactions in each slice. Though the user interaction helps achieving accurate segmentation results, it is time consuming. The Center for Medical Diagnostic Systems and Visualization in Germany also developed a software application for the preoperative planning of liver surgery.5 The liver segmentation in that system is performed with a semiautomatic edge-oriented algorithm. It requires users to specify a few seed points per slice to identify the liver contour. In the following years, 3D image segmentation approaches were employed and some efforts were made to reduce user interactions. Researchers in Graz University of Technology proposed a liver surgery planning system using virtual reality.6 The segmentation module in this system employs the active appearance model (AAM) (Ref. 7) to separate the heart and the liver in CT data, with an extended 3D multiobject fuzzy connectedness approach that lets users contribute their knowledge to improve the final segmentation.

Besides, the aforementioned segmentation methods that have been incorporated into liver surgery planning systems, a variety of other effective approaches have also been proposed in recent years. To achieve the automatic segmentation, Ruskó et al.8 developed a region growing method that involves several pre- and postprocessing steps to eliminate oversegmentation. Rikxoort et al.9 and Klein et al.10 employed methods based on atlas matching. Kainmüller et al.,11 and Zhang et al.12 incorporated statistical shape models into their liver segmentation methods. In addition, learning-based liver segmentation methods were also proposed. The algorithm proposed by Ling et al.13 employs a hierarchical shape representation and a learning-based boundary localization technique. Zhan et al.14 also proposed a learning-based hierarchical deformable model that can be used across different imaging modalities. However, automatic methods are not always robust in clinical environments. Thus, a lot of semiautomatic approaches were proposed to improve the robustness of the segmentation. Liu et al.15 used a gradient vector flow (GVF) snake for the delineation of liver contours slice by slice. Beichel et al.16 combined a graph cut method with a 3D virtual reality based refinement approach for liver segmentation. Zheng et al.17 also developed a graph cut-based segmentation algorithm to refine coarse manual segmentation results of liver tumors. Oliveira et al.18 proposed an effective deformable segmentation model based on level set for surgical planning. However, it is implemented at each slice sequentially. Fernandez-de-Manuel et al.19 employed 3D level set in a semiautomatic liver segmentation method based on active surface, but it is designed for the segmentation of healthy cases of the liver. The newest proposed methods can usually obtain satisfactory performance when dealing with healthy persons and common patients. However, most of them have the same problem: the robustness cannot be ensured in many special cases where the tumor and metastasis deform the liver regions to unusual and complex shapes. Therefore, a lot of user interactions are frequently needed to refine the segmentation results. In order to make these systems applicable in complex clinical environments, improving the robustness of the segmentation is still under research.

In recent years, the shape priors have shown great importance for liver image segmentation. Shape prior-based methods usually achieve better performance than methods solely relying on the appearance cues.20 However, to our knowledge, there is a lack of LDLT surgery planning systems employing the shape prior-based segmentation method to robustly handle complex cases of patients with liver cancer.

A key problem of shape prior-based segmentation is how to model the complex shape variations appropriately. Many statistic shape modeling methods have been used in medical image segmentation, among which the active shape model (ASM) (Ref. 21) and its variations22 are the most prevalent. However, the modeling of liver shapes of patients with liver cancer is much more challenging than that of many other organs. The variations of liver shapes from different patients are too complex to accurately model with parametric probability distributions. Besides, since the shape prior should be patient-specific and adaptive in LDLT surgery planning systems, it is critical to handle gross errors and outliers and preserve local details for different patients. The sparse shape composition23, 24 proposes a new way to implicitly model the shape prior and it is effective in modeling complex shape variations.

A variety of methods have also been proposed to extract vessels form medical images.25, 26 Zheng et al.27 proposed a learning-based scheme using a set of features for the detection of vessels from retinal fundus images. These features are used to describe the variation patterns of the image's local geometric structures across various scales. Goch et al.28 proposed an approach based on the GVF for the segmentation of hepatic vascular system. This approach avoids multiscale analysis and related scale space problems. Bauer et al.29 presented a method based on shape priors and graph cuts for the segmentation of tubular tree structures and applied it to the segmentation of portal and hepatic veins in liver surgery planning. However, despite the large amount of previous methods, the segmentation of 3D liver vessels is still a challenging task, due to the complex vascular anatomy and the high variability of size and curvature of vessels.25, 30

METHODS

The novel shape prior-based segmentation framework in the LDLT surgery planning system proposed in this paper focuses on addressing the challenges in the modeling of liver shape priors for patients with liver cancer, as well as the challenges in the accurate segmentation of liver, intrahepatic vessels and tumors. The segmentation framework includes two important modules: (1) Shape prior modeling for liver. The SSC model is employed to deal with the complex variations of liver shapes with its ability to handle non-Gaussian errors and preserve local detail information. (2) Accurate segmentation of hepatic parenchyma, portal veins, hepatic veins, and tumors using clinical enhanced CT scans. It is based on a combination of the patient-specific shape prior and a minimally supervised segmentation algorithm. This algorithm can segment multiobjects simultaneously. We apply this segmentation framework to our previously developed LDLT surgery planning system to enhance its accuracy and robustness when dealing with complex cases of patients with liver cancer. Besides the proposed segmentation framework, our system also consists of another two basic components in a typical liver surgery planning system: one is the liver segment approximation that partitions the liver into several functionally independent segments based on intrahepatic vessels, and the other is the visualization of the segmentation results and different liver segments.

Sparse shape representation for liver

The SSC model represents the shape prior by a sparse linear combination of shapes in the shape repository. It does not rely on any assumption of parametric distribution models. It can also preserve the local detail information that presents in the training set. Therefore, it addresses the main challenges in the modeling of the complex shape variations and patient-specific shape priors.

In the segmentation framework proposed in this paper, a repository consisting of training shapes from a large range of healthy persons is constructed. Each training shape is obtained from the manually segmented result by experienced experts, and it can be regarded as the gold standard of the corresponding liver. All the manual segmentation results are converted to surface meshes. The number of vertices on the mesh is chosen as a tradeoff between the shape prior variability and the computation time: a small number of vertices might not be enough to model the complex shape variations, while a large number increases the computation time. As a compromise, we set the number of vertices to near 1000 according to our empirical experience. Since the spatial position and orientation of different meshes in the repository vary a lot, prealignment of the training shapes is performed based on the generalized Procrustes analysis,31 so that they are in a common coordinate system. The one-to-one correspondence of vertices on different meshes is obtained by taking an arbitrary shape in the repository as the reference and registering it to the others using adaptive focus deformable model (AFDM).32, 33 To remove the bias caused by the selection of the reference, the mean shape is computed and then is registered to all the shapes again. For a patient who needs a surgery plan, a rough initial liver segmentation based on simple region growing method is rapidly performed. The initial segmentation result is converted to a surface mesh. The point correspondence between the new mesh and the mean shape of the repository is also computed using AFDM. In our application, the appearance cues of some CT images, such as scans from patients with liver cancer, may be weak or misleading and can easily result in the oversegmentation or the under-segmentation in the segmented shapes, i.e., gross errors. These gross errors can be very large but these regions are relatively sparse compared with the whole shape. Traditional shape models such as ASM usually represent shape distributions by the mean shape and the major variations, based on the assumption that the errors follow some Gaussian distributions. However, this assumption does not hold for gross and sparse errors. As a result, we explicitly model the errors as a sparse vector e. The liver shape of the patient is approximated by an optimized sparse linear combination of a subset of the repository. The optimization problem is formulated as24

argminx,e,βT(y,β)Dxe22+λ1x1+λ2e1, (1)

where D is a matrix that describes the training set. Each column of D is a vector representing the vertices’ coordinates of one mesh in the shape repository. x represents the coefficients for the training samples. y is a column vector representing the input shape which needs to be refined. T(y, β) is a global transformation operator with parameter β, which is estimated using the generalized Procrustes analysis.31 It aligns the input shape y to the mean shape of the repository. e denotes the gross errors or outliers in the input shape. In our application, it means the oversegmentation or the under-segmentation that appears in the initial segmentation result of liver. λ1 and λ2 control the sparseness of x and e, respectively. The optimized sparse shape representation Dxe is transformed to the original coordinate system of y by the inverse transformation of T(y, β). The result of the transformation is treated as the shape prior for y.

Accurate segmentation based on SSC shape prior

After the patient-specific shape prior is achieved by the SSC model, it can be employed to guide the accurate segmentation of hepatic parenchyma, portal veins, hepatic veins, and tumors. A minimally supervised classification method that considers both statistical and spatial information is employed to segment these tissues in the liver region. This method was originally designed for 2D image segmentation,34 and we extended it to 3D image segmentation and incorporated it with the SSC shape prior.

The segmentation method is an iterative classification approach using Bayesian level set method.35 It can be described as a growing of high-confidence (HC) points of each tissue. HC points are points with the least chance to be misclassified. In the first iteration, HC points of each tissue are selected based on the statistical threshold of intensity and size threshold of the connected blobs of HC points. We consider the image histogram as a Gaussian mixture model (GMM) and use the expectation maximization (EM) (Ref. 36) algorithm to estimate the mean value and the standard deviation of each tissue from seed points. Then a narrow intensity range is obtained to select HC points with the least chance of misclassification. In addition, when the image's signal-to-noise ratio (SNR) is low or intensity ranges of different tissues (such as portal veins and hepatic veins) have large overlap, a size threshold of HC points blobs is used to get rid of misclassified points. This is because the HC points blob in very small size is more likely to be noise due to the spatial continuity of tissues. Based on the statistical threshold and size threshold, the HC points of one given tissue are approximately evenly distributed throughout the region of that tissue. Examples of HC points are shown in Fig. 4.

Figure 4.

Figure 4

Segmentation results of hepatic parenchyma, portal veins, hepatic veins, and tumors for three patients with liver cancer. Every two rows show one case. The first, third, and fifth rows are results of segmentation without shape prior, while the second, fourth, and sixth rows employ SSC shape prior.

After the selection of HC points in the first iteration, a fast marching level set method37 is used to compute the marching process of the surface of HC points blobs, thus the arrival time at each unclassified point can be obtained. The marching speed at each unclassified point is based on its intensity and the spatial relationship between that point and the liver shape prior

V(x,c)=ωV intensity (x,c)+(1ω)V shape (x), (2)

where x denotes the unclassified point. c indicates one certain tissue. ω and 1 − ω are coefficients controlling the weights of the intensity term Vintensity and the shape term Vshape. ω is in a range of 0.0–1.0,

V intensity (x,c)=1+minm(|I(x)I(m)¯|)1+|I(x)I(c)¯|, (3)

where I(x) is the intensity of voxel point x. I(c)¯ is the average intensity of HC points of tissue c. The maximum of Vintensity(x, c) is obtained when I(x) is the closest to I(c)¯,

V shape (x)=Φ(x)max(Φ(x)), (4)

where Φ(x) is a signed distance function based on the liver shape prior. The sign of Φ(x) is positive if x is inside the shape prior, while negative if x is outside the shape prior. For one certain tissue c and an unclassified point x, the larger the difference between I(c)¯ and I(x), or the lower value of Φ(x), the slower the marching speed V(x, c).

After the marching process, the arrival time of HC points marching to each unclassified point is obtained. We classify each point into the tissue with the least arrival time at that point, based on which new HC points are selected for each tissue again, and then a new iteration step begins. The iteration will terminate when the percentage of increase in the volume of hepatic parenchyma is below a given threshold. Thus, the simultaneous segmentation of hepatic parenchyma, portal veins, hepatic veins, and tumors is achieved.

Liver segment approximation and visualization

The proposed segmentation framework is incorporated into our previously developed LDLT surgery planning system, which also includes the liver segment approximation and visualization modules. The liver segment approximation module partitions the liver into several functionally independent segments that can be used as ablation units according to the branching structure of portal veins. In our system, the nearest neighbor segment approximation (NNSA) (Ref. 38) approach and the visualization toolkit (VTK) (Ref. 39) are employed for liver segment approximation and 3D data visualization, respectively.

RESULTS

Clinical abdominal image data of enhanced CT from Shanghai Renji Hospital was used in the experiments. The data were acquired using a GE Discovery CT750 HD system with the following scanning protocol: slice thickness = 1.25 mm, image resolution = 512 × 512, pixel spacing = 0.683594 × 0.683594 mm. The scanning was automatically triggered when the system detects the contrast agent flowing into the hepatic artery, portal veins, and hepatic veins, respectively. The average time delay for the three scans was about 25, 40, and 70 s, respectively after the injection of the contrast agent. We collected the manual segmentation results of livers from 50 healthy persons, aged from 18 to 75, to construct the training data. The image datasets from 18 patients were analyzed by the liver surgery planning system. Most of the patients had tumors or metastasis close to major vessels, and some patients had one part of the liver resected previously. The gray levels of tumor and metastasis are significantly different from those of healthy liver regions. The liver shapes of these patients also vary in a large range.

In our previous study, we found that the performance of SSC is not sensitive to λ1 and λ2, and a fixed set of ω also gives stable results for different patients. Therefore, we fixed these parameters when dealing with different patients. The best parameter set was found offline using the training dataset. It was achieved by traversing each parameter within a large range to find its optimum. During each iteration step, one parameter was tuned, while other two parameters were fixed. Finally, we obtained the best parameter set and fixed it during the experiments. The parameter set for SSC was λ1 = 50, λ2 = 0.3. ω in Eq. 2 was set differently for four tissues. For hepatic parenchyma, we enhanced the weight of the shape term in the speed function, and we set ω to 0.6. For portal veins, hepatic veins and tumors, ω was set to 0.2, 0.2, and 0.8, respectively.

Sparse shape composition

For each patient, the SSC shape prior of liver region was compared with the corresponding gold standard and the PCA shape prior. The same training set was used by PCA and SSC for fair comparisons. All the experiments were performed on a 2.4 GHz PC with 2G RAM, with PYTHON 2.5 and C++ implementations. The average running time of using PCA and SSC was 3.44 and 6.52 s, respectively. Figure 2 shows some visual comparisons between the shape priors based on PCA and SSC. Each column shows one case. The initial segmentation result, the manual segmentation result, the PCA shape prior and its visualized errors, the SSC shape prior and its visualized errors are shown from the top row to the bottom row, respectively. The shortest Euclidean surface distance is measured in millimeters (mm) in the visualization of errors.

Figure 2.

Figure 2

Visual comparisons between shape prior based on PCA and SSC in four cases. (First column) a liver with a large region of tumor in the posterior portion of the right lobe. (Second column) a liver that is adjacent to the heart. (Third column) a liver that is adjacent to the kidney. (Forth column) a liver with a tumor in the interior portion of the left lobe. Notice the SSC shape prior has much less errors compared with PCA shape prior.

In the first column of Fig. 2, a large region of tumor appears in the posterior portion of the right liver lobe. Since the gray level of the tumor region is much lower than that of the healthy liver region, the region growing method fails to extract the tumor region in the initial segmentation result. Both PCA and SSC models restore the posterior portion of the right liver lobe, since a liver lacking that portion does not appear in healthy liver shapes and it will not present in the shape repository. However, the PCA model only restores and preserves the principal components of the input liver shape, which leads to some local details, such as the corner of the left liver lobe, being discarded in the outputted shape prior. However, the SSC model effectively preserves the local details in the corner of the left lobe when it restores the posterior portion of the right liver lobe.

In the application of LDLT surgery planning system, the undersegmentation is mainly caused by tumor and metastasis due to the difference in the intensity between these regions and healthy liver regions. The oversegmentation also occurs frequently, since the heart and abdominal organs, such as the kidney and the spleen, are very close to the liver and they have similar gray levels. In the second column of Fig. 2, the oversegmented region in the heart leads to gross errors in the initial segmentation result. The oversegmented region does not appear in the training set, but it is still well reconstructed by the PCA model. Statistically, the oversegmented region in the heart is approximately in the first mode of liver shapes (i.e., along the direction of the PCA's first principal component). The eigenvalue of the first principal component is large so that the first mode of liver shapes has a large variance, which can easily cover the oversegmented region in the heart. As a result, this region is usually well reconstructed and preserved by PCA during the shape refinement procedure (even including the gross errors). In contrast, such gross errors near by the heart region can be captured by the SSC model successfully. This is benefited from the explicitly modeling the gross and sparse errors. Thus, the SSC model excludes the oversegmented region in the heart effectively. PCA and SSC representations of the oversegmentation occurring in the kidney region are similar to the situation in the heart region, as shown in the third column of Fig. 2. Another case is shown in the fourth column of Fig. 2, where both the undersegmentation and the oversegmentation appear in the initial segmentation result of a liver with cancer. All these results illustrate that the SSC model handles gross errors in the initial segmentation results robustly, but almost does not affect correctly segmented regions that are consistent with training samples in the shape repository.

For the patient a part of whose liver has been resected previously, the integrated liver could not be found in the CT scans so that a common liver surgery planning system could just segment and visualize the remaining part of that liver. However, it is still necessary for surgeons to estimate the whole volume of such liver in order to analyze the liver function change. Figure 3 shows an example of a patient who accepted a resection treatment followed by a radiofrequency ablation in the past. The SSC representation of the liver segmentation result restores the resected portion, which helps surgeons analyze the function of the remaining liver for a comparison with the whole one. Benefited from its robustness against outliers, the SSC model has the capability to reconstruct the integrated liver region, which assists surgeons in achieving a better understanding of the whole liver when making surgery strategy as well as evaluating the surgery result.

Figure 3.

Figure 3

The segmentation result of a liver with one portion resected and its SSC representation. (a) Segmentation result of a liver with one portion resected; (b) The SSC representation of the segmentation result.

Accurate segmentation

The hepatic parenchyma, portal veins, hepatic veins, and tumors are accurately segmented with the liver shape prior. For each patient with liver cancer, the final segmentation results of two methods are compared: Method I is the original minimally supervised classification method without shape prior.34 Method II is our method that employs SSC shape prior.

Figure 4 shows the segmentation results of three typical patients with liver cancer. The first, third, and fifth rows illustrate the segmentation results of Method I, while the second, fourth, and sixth rows show the segmentation results of Method II. The first column shows the initial HC points of hepatic parenchyma, portal veins, hepatic veins, and tumors in the first iteration. The four types of HC points are labeled in four different colors respectively. The second column shows the segmentation results of these tissues, and the third column shows the 3D visualization of them. The segmentation errors of hepatic parenchyma are visualized in the fourth column. We also use the shortest Euclidean surface distance measured in millimeters in the visualization of errors. Yellow curves are the corresponding liver shape priors based on SSC.

The minimally supervised classification method works well on 2D CT data,34 but 3D abdominal images are more challenging due to the similar gray levels of adjoining organs. The first row of Fig. 4 shows that the initial HC points of hepatic parenchyma cover not only the region of liver but also the region of spleen. The reason is that the two tissues adjoin in 3D space and the gray levels of them are almost in the same range. The second row shows the corresponding result of segmentation based on our proposed method using SSC shape prior. The HC points outside the shape prior are excluded in the first iteration and the spleen does not appear in the final segmentation result. Since the SSC shape prior describes the liver shape adaptively, the segmentation results based on the shape prior are quite accurate, with overcoming undersegmentation and oversegmentation effectively.

Experiments on other two patients in Fig. 4 also show that the SSC shape prior plays a great role in improving the accuracy and robustness of the segmentation. In addition, high order branches of intrahepatic vessels are extracted successfully by our proposed method: for hepatic veins, the fourth order branches are captured; and for portal veins, the fifth and higher order branches are segmented, as shown in Figs. 46. Compared with previous methods30, 40 capturing the third and fourth order branches, our algorithm has a better performance in extracting high order vessel branches. This is useful for surgeons to analyze the location relationship between portals veins, hepatic veins, and tumors, based on which an accurate and optimal surgery plan can be achieved.

Figure 6.

Figure 6

Liver segment approximation and visualization. (First column) accurate segmentation result. (Second column) different portions of the portal veins. (Third column) different liver segments. (Fourth column) a semitransparent visualization of the liver segments, portal veins, and tumors. Some liver segments are hided in the third row for a better visualization of the intrahepatic tumor.

The performance of the SSC shape prior modeling and the accurate segmentation was measured using radius of curvature (ROC) curves with respect to each parameter, as shown in Fig. 5. We plotted the fraction of true positive rate versus false positive rate for a wide range of each parameter. The true positive rate is the sensitivity and the false positive rate is defined as one-specificity. Since the modeling of the shape prior and the segmentation are two independent modules in the framework, we analyzed the ROC curves of the two modules, respectively. Figure 5a shows the ROC curve of the SSC shape prior for a wide range of λ1, with λ2 fixed to 0.25. Figure 5b shows the ROC curve of the SSC shape prior for a wide range of λ2, with λ1 fixed to 50. Figure 5c shows the ROC curves of the segmentation of hepatic parenchyma, hepatic veins, portal veins, and tumors. These four curves are produced by varying the set of ω, with λ1 and λ2 fixed to 50 and 0.25, respectively.

Figure 5.

Figure 5

ROC curves of the SSC shape prior and the segmentation. (a) ROC curve of the SSC shape prior with respect to λ1; (b) ROC curve of the SSC shape prior with respect to λ2; (c) ROC curve of the segmentation with respect to ω.

We employ the average symmetric surface distance (ASD) (Ref. 20) and Hausdorff distance41 to evaluate the accuracy of the segmentation method quantitatively. Both the segmentation results of Methods I and II are compared with the gold standard manually segmented by experienced experts

ASD (A,B)=1S(A)+S(B)SAS(A)d(SA,S(B))+SBS(B)d(SB,S(A)), (5)

where S(A) and S(B) denote the set of surface voxels of two segmentation results A and B, respectively. SA is an arbitrary point on surface S(A), and d(SA, S(B)) is the shortest Euclidean distance of SA to the surface S(B).

The Hausdorff distance is defined as the maximum of all the Euclidean distances from a point on the surface of the segmentation result to the closest point on the surface of the gold standard. The average ASD mean value and standard deviation from the 18 patients are shown in Table 1. The average Hausdorff distances from these patients are shown in Table 2. Method II, the SSC shape prior-based method, achieves better performance than Method I, the original minimally supervised classification method without shape prior. The SSC shape prior not only significantly improves the accuracy and robustness of the segmentation of hepatic parenchyma but also contributes to the accurate segmentation of intrahepatic vessels and tumors. In addition, we measured the runtime of the whole segmentation process. The initial segmentation of the liver and the modeling of the shape prior, which were required for Method II but not for Method I, consumed an average time of 4.25 min. The runtime of the classification algorithm in the segmentation stage was 18.22 min with eight iterations in average for Method I, while 10.53 min with four iterations in average for Method II, as shown in Table 2. The result shows that less iteration is required for Method II, which reduces the runtime remarkably. In each iteration, the most time consuming portion is the computation of the arrival time of HC points marching to each unclassified point. It is achieved by sequential computation for hepatic parenchyma, portal veins, hepatic veins, and tumors. However, it is possible to significantly accelerate this process by using parallel computation based on GPUs implementation of the algorithm.

Table 1.

Comparison of ASD between Methods I and II. Method I: the original minimally supervised classification method without shape prior. Method II: our method that employs the SSC shape prior.

Method Hepatic parenchyma (mm) Portal veins (mm) Hepatic veins (mm) Tumors (mm)
Method I 4.69 ± 2.84 1.42 ± 0.35 1.30 ± 0.41 1.58 ± 0.45
Method II 1.07 ± 0.76 1.09 ± 0.28 0.92 ± 0.35 1.13 ± 0.37

Table 2.

Comparison of Hausdorff distance and runtime between Methods I and II.

Method Hepatic parenchyma (mm) Portal veins (mm) Hepatic veins (mm) Tumors (mm) Runtime (min)
Method I 21.49 7.06 6.84 8.45 18.22
Method II 7.68 4.67 4.09 5.36 10.53

Figure 6 shows some results of liver segment approximation and visualization. The first column shows the accurate segmentation results and the second column illustrates the portal veins in each liver segment labeled in different colors. Different liver segments are shown in the third column. The last column shows a semitransparent visualization of these liver segments, portal veins, and tumors.

CONCLUSIONS

In this paper, we proposed a new shape prior-based segmentation framework for the LDLT surgery planning system. The strengths of this proposed method include: (1) modeling complex liver shape variations effectively, (2) achieving patient-specific liver shape prior, and (3) accurate and robust segmentation of liver, intrahepatic vessels, and tumors. We applied this framework to our previously developed LDLT surgery planning system. The framework was validated on a large range of clinical data from patients with liver cancer, and it achieved good performance in shape prior modeling and segmentation. The SSC model is employed in this framework to deal with complex variations of liver shapes and it preserves local detail information of the input shape well, so that the shape prior is adaptive to different patients. The SSC shape prior is combined with a minimally supervised segmentation algorithm. The framework achieves an accurate segmentation of hepatic parenchyma, portal veins, hepatic veins, and tumors simultaneously. Compared with the segmentation methods in state-of-the-art liver surgery planning systems, our framework not only obtains accurate segmentation results for healthy persons and common patients but also shows high robustness when dealing with specific patients with large variations of liver shapes in complex clinical environments. As a result, the framework improves the reliability and applicability of the LDLT surgery planning system remarkably.

Compared with our previous work only modeling the shape prior of healthy livers, the contribution of this paper mainly includes the application of the SSC model in the segmentation of liver with cancers in complex clinical environments, which is significantly more challenging. In addition, we combined it with the minimally supervised segmentation method to obtain accurate and robust results. Our future work will focus on improving the efficiency of the proposed framework by implementing the algorithms on GPUs. We will construct the training dataset with more shape samples, and the extraction of the most representative shapes in the repository will be a research interest in the future.

ACKNOWLEDGMENTS

This research is partially supported by the Chinese NSFC research fund (61190120, 61190124 and 61271318) and biomedical engineering fund of Shanghai Jiao Tong University (YG2012ZD06).

References

  1. Ferlay J., Shin H. R., Bray F., Forman D., Mathers C., and Parkin D. M., “Estimates of worldwide burden of cancer in 2008: GLOBOCAN 2008,” Int. J. Cancer 127(12), 2893–2917 (2010). 10.1002/ijc.25516 [DOI] [PubMed] [Google Scholar]
  2. Sotiropoulos G. C., Drühe N., Sgourakis G., Molmenti E. P., Beckebaum S., Baba H. A., Antoch G., Hilgard P., Radtke A., and Saner F. H., “Liver transplantation, liver resection, and transarterial chemoembolization for hepatocellular carcinoma in cirrhosis: Which is the best oncological approach?,” Dig. Dis. Sci. 54(10), 2264–2273 (2009). 10.1007/s10620-008-0604-4 [DOI] [PubMed] [Google Scholar]
  3. Broering D. C., Sterneck M., and Rogiers X., “Living donor liver transplantation,” J. Hepatology 38(1), 119–135 (2003). 10.1016/S0168-8278(03)00009-6 [DOI] [PubMed] [Google Scholar]
  4. Meinzer H. P. and Thorn M., “Computerized planning of liver surgery–An overview,” Comput. Graphics 26(4), 569–576 (2002). 10.1016/S0097-8493(02)00102-4 [DOI] [Google Scholar]
  5. Bourquain H., Schenk A., Link F., Preim B., Prause G., and Peitgen H. O., “HepaVision2—a software assistant for preoperative planning in living-related liver transplantation and oncologic liver surgery,” in CARS 2002 Computer Assisted Radiology and Surgery, edited by Lemke H., Inamura K., Doi K., Vannier M., Farman A., and Reiber J. C. (Springer, Berlin, Heidelberg, 2002), pp. 341–346. [Google Scholar]
  6. Reitinger B., Bornik A., Beichel R., and Schmalstieg D., “Liver surgery planning using virtual reality,” IEEE Comput. Graphics Appl. 26(6), 36–47 (2006). 10.1109/MCG.2006.131 [DOI] [PubMed] [Google Scholar]
  7. Cootes T. F., Edwards G. J., and Taylor C. J., “Active appearance models,” IEEE Trans. Pattern Analysis and Machine Intelligence 23(6), 681–685 (2001). 10.1109/34.927467 [DOI] [Google Scholar]
  8. Ruskó L., Bekes G., and Fidrich M., “Automatic segmentation of the liver from multi- and single-phase contrast-enhanced CT images,” Med. Image Anal. 13(6), 871–882 (2009). 10.1016/j.media.2009.07.009 [DOI] [PubMed] [Google Scholar]
  9. van Rikxoort E., Arzhaeva Y., and van Ginneken B.,“Automatic segmentation of the liver in computed tomography scans with voxel classification and atlas matching,” in Proceedings of the MICCAI Workshop 3-D Segmentation Clinic: A Grand Challenge, Brisbane, Australia (Springer, Berlin, 2007), pp. 101–108.
  10. Klein S., van der Heide U. A., Lips I. M., van Vulpen M., Staring M., and Pluim J. P. W., “Automatic segmentation of the prostate in 3D MR images by atlas matching using localized mutual information,” Med. Phys. 35, 1407–1417 (2008). 10.1118/1.2842076 [DOI] [PubMed] [Google Scholar]
  11. Kainmüller D., Lange T., and Lamecker H., “Shape constrained automatic segmentation of the liver based on a heuristic intensity model,” in Proceedings of the MICCAI Workshop 3D Segmentation in the Clinic: A Grand Challenge, Brisbane, Australia (Springer, Berlin, 2007), pp. 109–116.
  12. Zhang X., Tian J., Deng K., Wu Y., and Li X., “Automatic liver segmentation using a statistical shape model with optimal surface detection,” IEEE Trans. Biomed. Eng. 57(10), 2622–2626 (2010). 10.1109/TBME.2010.2056369 [DOI] [PubMed] [Google Scholar]
  13. Ling H., Zhou S. K., Zheng Y., Georgescu B., Suehling M., and Comaniciu D., “Hierarchical, learning-based automatic liver segmentation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2008, Anchorage, AK (IEEE, Piscataway, N.J., 2008), pp. 1–8.
  14. Zhan Y., Dewan M., and Zhou X., “Cross modality deformable segmentation using hierarchical clustering and learning,” in Medical Image Computing and Computer-Assisted Intervention–MICCAI 2009, edited by Yang G.-Z., Hawkes D., Rueckert D., Noble A., and Taylor C. (Springer, Berlin, Heidelberg, 2009), Vol. 5762, pp. 1033–1041. [DOI] [PubMed] [Google Scholar]
  15. Liu F., Zhao B., Kijewski P. K., Wang L., and Schwartz L. H., “Liver segmentation for CT images using GVF snake,” Med. Phys. 32, 3699–3706 (2005). 10.1118/1.2132573 [DOI] [PubMed] [Google Scholar]
  16. Beichel R., Bornik A., Bauer C., and Sorantin E., “Liver segmentation in contrast enhanced CT data using graph cuts and interactive 3D segmentation refinement methods,” Med. Phys. 39, 1361–1373 (2012). 10.1118/1.3682171 [DOI] [PMC free article] [PubMed] [Google Scholar]
  17. Zheng Y., Englander S., Baloch S., Zacharaki E. I., Fan Y., Schnall M. D., and Shen D., “STEP: Spatiotemporal enhancement pattern for MR-based breast tumor diagnosis,” Med. Phys. 36(7), 3192–3204 (2009). 10.1118/1.3151811 [DOI] [PMC free article] [PubMed] [Google Scholar]
  18. Oliveira D., Feitosa R., and Correia M., “Segmentation of liver, its vessels and lesions from CT images for surgical planning,” Biomed. Eng. Online 10(1), 1–23 (2011). 10.1186/1475-925X-10-30 [DOI] [PMC free article] [PubMed] [Google Scholar]
  19. Fernandez-de-Manuel L., Rubio J. L., Ledesma-Carbayo M. J., Pascau J., Tellado J. M., Ramon E., Desco M., and Santos A., “3D liver segmentation in preoperative CT images using a levelsets active surface method,” in Proceedings of the Annual International Conference of the IEEE on Engineering in Medicine and Biology Society, EMBC 2009, Minneapolis, MN (IEEE, Piscataway, NJ, 2009), pp. 3625–3628. [DOI] [PubMed]
  20. Heimann T., Van Ginneken B., Styner M. A., Arzhaeva Y., Aurich V., Bauer C., Beck A., Becker C., Beichel R., and Bekes G., “Comparison and evaluation of methods for liver segmentation from CT datasets,” IEEE Trans. Med. Imaging 28(8), 1251–1265 (2009). 10.1109/TMI.2009.2013851 [DOI] [PubMed] [Google Scholar]
  21. Cootes T. F., Taylor C. J., Cooper D. H., and Graham J., “Active shape models-their training and application,” Comput. Vis. Image Underst. 61(1), 38–59 (1995). 10.1006/cviu.1995.1004 [DOI] [Google Scholar]
  22. Heimann T. and Meinzer H. P., “Statistical shape models for 3D medical image segmentation: A review,” Med. Image Anal. 13(4), 543–563 (2009). 10.1016/j.media.2009.05.004 [DOI] [PubMed] [Google Scholar]
  23. Zhang S., Zhan Y., Dewan M., Huang J., Metaxas D. N., and Zhou X. S., “Towards robust and effective shape modeling: Sparse shape composition,” Med. Image Anal. 16(1), 265–277 (2012). 10.1016/j.media.2011.08.004 [DOI] [PubMed] [Google Scholar]
  24. Zhang S., Zhan Y., Dewan M., Huang J., Metaxas D. N., and Zhou X. S., “Sparse shape composition: A new framework for shape prior modeling,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2011, Colorado Springs, CO (IEEE, Piscataway, NJ, 2011), pp. 1025–1032.
  25. Lesage D., Angelini E. D., Bloch I., and Funka-Lea G., “A review of 3D vessel lumen segmentation techniques: Models, features and extraction schemes,” Med. Image Anal. 13(6), 819–845 (2009). 10.1016/j.media.2009.07.011 [DOI] [PubMed] [Google Scholar]
  26. Lorigo L. M., Faugeras O. D., Grimson W. E. L., Keriven R., Kikinis R., Nabavi A., and Westin C. F., “Curves: Curve evolution for vessel segmentation,” Med. Image Anal. 5(3), 195–206 (2001). 10.1016/S1361-8415(01)00040-8 [DOI] [PubMed] [Google Scholar]
  27. Zheng Y., Wang H., Wu J., Gao J., and Gee J. C., “Multiscale analysis revisited: Detection of drusen and vessel in digital retinal images,” in Proceedings of the IEEE International Symposium on Biomedical Imaging: From Nano to Macro, 2011, Chicago, lL (IEEE, Piscataway, NJ, 2011), pp. 689–692.
  28. Goch C., Wang X., Meinzer H.-P. and Wegner I., “Liver vessel segmentation using gradient vector flow,” in Bildverarbeitung für die Medizin 2011, edited by Handels H., Ehrhardt J., Deserno T. M., Meinzer H.-P., and Tolxdorff T. (Springer, Berlin, Heidelberg, 2011), pp. 104–108.
  29. Bauer C., Pock T., Sorantin E., Bischof H., and Beichel R., “Segmentation of interwoven 3d tubular tree structures utilizing shape priors and graph cuts,” Med. Image Anal. 14(2), 172–184 (2010). 10.1016/j.media.2009.11.003 [DOI] [PubMed] [Google Scholar]
  30. Selle D., Preim B., Schenk A., and Peitgen H. O., “Analysis of vasculature for liver surgical planning,” IEEE Trans. Med. Imaging 21(11), 1344–1357 (2002). 10.1109/TMI.2002.801166 [DOI] [PubMed] [Google Scholar]
  31. Goodall C., “Procrustes methods in the statistical analysis of shape,” J. R. Stat. Soc. Ser. B (Methodol.) 53, 285–339 (1991). [Google Scholar]
  32. Shen D., Herskovits E. H., and Davatzikos C., “An adaptive-focus statistical shape model for segmentation and shape modeling of 3-D brain structures,” IEEE Trans. Med. Imaging 20(4), 257–270 (2001). 10.1109/42.921475 [DOI] [PubMed] [Google Scholar]
  33. Cui X., Zhang S., Zhan Y., Gao M., Huang J., and Metaxas D., in Mesh Processing in Medical Image Analysis 2012, edited by Levine J., Paulsen R., and Zhang Y. (Springer, Berlin, 2012), Vol. 7599, pp. 12–21. [Google Scholar]
  34. Li F., Bartz D., Gu L., and Audette M., “An iterative classification method of 2D CT head data based on statistical and spatial information,” in Proceedings of the 19th International Conference on Pattern Recognition, ICPR 2008, Tampa, FL (IEEE, Piscataway, NJ, 2008), pp. 1–4.
  35. Sifakis E., Garcia C., and Tziritas G., “Bayesian level sets for image segmentation,” J. Visual Commun. Image Represent 13(1), 44–64 (2002). 10.1006/jvci.2001.0474 [DOI] [Google Scholar]
  36. Zhang Y., Brady M., and Smith S., “Segmentation of brain MR images through a hidden Markov random field model and the expectation-maximization algorithm,” IEEE Trans. Med. Imaging 20(1), 45–57 (2001). 10.1109/42.906424 [DOI] [PubMed] [Google Scholar]
  37. Sethian J. A., “A fast marching level set method for monotonically advancing fronts,” Proc. Natl. Acad. Sci. U.S.A. 93(4), 1591–1595 (1996). 10.1073/pnas.93.4.1591 [DOI] [PMC free article] [PubMed] [Google Scholar]
  38. Beichel R., Pock T., Janko C., Zotter R. B., Reitinger B., Bornik A., Palagyi K., Sorantin E., Werkgartner G., and Bischof H., “Liver segment approximation in CT data for surgical resection planning,” Proc. SPIE 5370, 1435–1446 (2004). 10.1117/12.535514 [DOI] [Google Scholar]
  39. Schroeder W., Martin K., and Lorensen B., An Object-Oriented Approach To 3D Graphics (Prentice-Hall, Englewood Cliffs, NJ, 1997). [Google Scholar]
  40. Conversano F., Franchini R., Demitri C., Massoptier L., Montagna F., Maffezzoli A., Malvasi A., and Casciaro S., “Hepatic vessel segmentation for 3D planning of liver surgery: Experimental evaluation of a new fully automatic algorithm,” Acad. Radiol. 18(4), 461–470 (2011). 10.1016/j.acra.2010.11.015 [DOI] [PubMed] [Google Scholar]
  41. Huttenlocher D. P., Klanderman G. A., and Rucklidge W. J., “Comparing images using the Hausdorff distance,” IEEE Trans. Pattern Anal. Mach. Intell. 15(9), 850–863 (1993). 10.1109/34.232073 [DOI] [Google Scholar]

Articles from Medical Physics are provided here courtesy of American Association of Physicists in Medicine

RESOURCES