Open Access

Segmentation of abdomen MR images using kernel graph cuts with shape priors

  • Qing Luo1, 2,
  • Wenjian Qin1,
  • Tiexiang Wen1, 3,
  • Jia Gu1Email author,
  • Nikolas Gaio1,
  • Shifu Chen1, 3,
  • Ling Li1 and
  • Yaoqin Xie1
Contributed equally
BioMedical Engineering OnLine201312:124

Received: 5 August 2013

Accepted: 8 November 2013

Published: 3 December 2013



Abdominal organs segmentation of magnetic resonance (MR) images is an important but challenging task in medical image processing. Especially for abdominal tissues or organs, such as liver and kidney, MR imaging is a very difficult task due to the fact that MR images are affected by intensity inhomogeneity, weak boundary, noise and the presence of similar objects close to each other.


In this study, a novel method for tissue or organ segmentation in abdomen MR imaging is proposed; this method combines kernel graph cuts (KGC) with shape priors. First, the region growing algorithm and morphology operations are used to obtain the initial contour. Second, shape priors are obtained by training the shape templates, which were collected from different human subjects with kernel principle component analysis (KPCA) after the registration between all the shape templates and the initial contour. Finally, a new model is constructed by integrating the shape priors into the kernel graph cuts energy function. The entire process aims to obtain an accurate image segmentation.


The proposed segmentation method has been applied to abdominal organs MR images. The results showed that a satisfying segmentation without boundary leakage and segmentation incorrect can be obtained also in presence of similar tissues. Quantitative experiments were conducted for comparing the proposed segmentation with other three methods: DRLSE, initial erosion contour and KGC without shape priors. The comparison is based on two quantitative performance measurements: the probabilistic rand index (PRI) and the variation of information (VoI). The proposed method has the highest PRI value (0.9912, 0.9983 and 0.9980 for liver, right kidney and left kidney respectively) and the lowest VoI values (1.6193, 0.3205 and 0.3217 for liver, right kidney and left kidney respectively).


The proposed method can overcome boundary leakage. Moreover it can segment liver and kidneys in abdominal MR images without segmentation errors due to the presence of similar tissues. The shape priors based on KPCA was integrated into fully automatic graph cuts algorithm (KGC) to make the segmentation algorithm become more robust and accurate. Furthermore, if a shelter is placed onto the target boundary, the proposed method can still obtain satisfying segmentation results.


The recent development of open magnetic resonance imaging has provided new opportunities for next generation image-guided surgical and interventional applications. Image-guided surgery is a standard surgical procedure for abdominal disorders that can reduce surgical trauma and open surgery burdens [1]. However, during surgical planning and surgical navigation based on MR images, there are two problems have to be faced: the shape deformation of the organs and the similarity among abdominal organs. For these reasons, an effective and robust algorithm for abdominal organs segmentation is helpful and very important in image-guided surgery and surgical navigation system [2, 3].

Usually, basic image information, such as intensity and gradient, are used for segmentation; Ostu, k-means clustering, region growing, etc. are the most widely used algorithms for segmentation. However, they are not suitable for MR segmentation. Because of its weak boundary, intensity inhomogeneity and noise, the segmentation of MR images is considered a complex procedure [4]. For this reason, developing different advanced and intelligent algorithms for MR image segmentation has become a research hotspot over the last few years.

Abdomen MR image segmentation is a challenging task, because majority of tissues in abdomen are soft tissues, the intensities of abdominal tissues are very similar and shape change in a complex way due to respiratory movements [5]. To provide more information about the tissues and organs in abdomen to the doctors, more effective and robust algorithm to segment abdomen MR images are developed. For example, Hassan et al. [6] proposed a novel method to segment liver MR images automatically. This algorithm utilizes artificial neural networks and watershed algorithm. Moreover, Sheng et al. [7] applied a wavelet-based k-means clustering method to segment the human kidney from MRI data set.

Since the level set method can be performed on a fix Cartesian grid with no need to parameterize these objects, in the past decade it was used more and more frequently in image segmentation [811]. Moreover, the level set method can represent contours with complex topology and change their topology in a natural way. However, the algorithms converge to a local minimum easily, so the results are easily affected by the initial values. Additionally, the execution time may be very long in some applications, especially with large images and multi-object segmentations [12, 13].

Graph cuts techniques have received considerable attention for their global energy optimal advantages. It is used in more and more image segmentation applications for different medical images, such as MR images [14]. However, it requires to choose the object and background seeds interactively, implying a time-consuming procedure. Kernel graph cuts is a fully automatic algorithm based on graph cuts proposed by Salah et al. [15]. It consists of a multi-region image segmentation algorithm based on graph cuts via kernel mapping of the image data. This algorithm is not successful for abdominal organs segmentation due to the weak boundary and surrounding objects with similar intensities. The graph cuts based on active contours method was proposed by Xu et al. [16]. The method identifies an initial contour around the target and then forms the narrow banded area containing the target via dilation and erosion. The segmentation focuses on image data in the narrow banded area, and separates the abdominal organs with similar intensities. However it cannot solve the weak boundary problem that leads to edge leakage. Integrating the prior information into the segmentation is a popular solution for the weak boundary; the prior information can lead to a more accurate segmentation result according to [1720]. Asem et al. [21] proposed graphs cuts integrated shape priors, and applied this method to kidney segmentation in abdomen MR images. The result of the segmentation shows that it can overcome the edge leakage, however, it uses the probabilistic model, which increases its complexity; moreover, it also needs interactive operations. Chen et al. [21] integrate shape information generated from Active Appearance Model (AAM) into graph cuts for abdominal 3D organ segmentation. However, the long computation time and the dependence of initial location limit its applications. Comparing to the linear PCA (principle component analysis), the nonlinear PCA model performs better on problems with nonlinear deformation [22]. Malcolm et al. [23] proposed a segmentation model that integrates the KPCA-based shape priors into graph cuts, but the model executes iteratively so it is time-consuming.

In this paper, we propose a new method, which combines kernel graph cuts with KPCA to segment abdominal organs. First, a seed point is chosen inside the target organ, and then the region growing algorithm is used to obtain approximately segmentation. Second, image morphology operations (dilation and erosion) are used to form an initial contour close to the target organ. Third, KPCA is used to obtain the shape priors by training the relevant shape templates set. At last, the shape priors are integrated into kernel graph cuts to make a better segmentation. The main contribution of this paper is the proposal of novel methods that combine kernel graph cuts algorithm with shape priors for abdominal organs extraction. The shape priors based on KPCA help our algorithm to increase segmentation accuracy while intensity is not sufficient to obtain accurate segmentation results.

This paper is organized as follows. Section Methodology describes the methodology which gives a description of kernel graph cuts and shape priors based on KPCA and detailed introduction of our proposed method. Section Experiments presents the experiments results obtained using the proposed novel method. Finally, the discussion about the algorithms is presented and conclusions are drawn in Section Discussion and Section Conclusions, respectively.


This section starts by briefly describing the KGC and KPCA.

Kernel graph cuts

Graph cuts algorithm was introduced by Boykov et al. [14] for binary image segmentation application. The purpose is to segment an object from a given image using a set of seeds (object and background) placed by user.

The graph cuts algorithm aims to cast the energy-based image segmentation problem into a graph structure global min-cut problem. The energy function of graph cuts contains two terms: a region-based term R(A) and a boundary term B(A), where A stands for an object or background pixel assignment. The region-based term evaluates the penalty for assigning a particular pixel to a given region. The boundary term evaluates the penalty for assigning two neighboring pixels to different regions. These two terms often weight by 0 ≤ ϵ ≤ 1 for relative influence, and the energy function is expressed as follows:
E A = ϵ · R A + 1 ϵ · B A
KGC was proposed by Salah et al. [15] for automatic segmentation by mapping image data into high dimension through kernel function. Graph cuts method is a supervised algorithm which requires user intervention for choosing seeds (object & background). The proposed energy function contains two terms: an original kernel-induced data term which evaluates the deviation of the mapped image data and a regularization term expressed as a function of the region indices. The energy function is expressed as follows:
E μ l , δ = l L p R l ϕ μ l ϕ I p 2 + α p , q D r δ p , δ q

Where E({μ1},δ) measures kernel-induced non Euclidean distances between the observations and the regions parameters μ 1 . φ is a nonlinear mapping from the observation space I to a higher dimensional mapped space J, and the radial basis function (gauss function) kernel is used as usual. a is a positive factor. δ is an indexing function which assigns each point of the image to a region. lL Is a pixel label in some finite set of labels L. PR 1 is a pixel in each region which is characterized by one label l. R(δ((p),δ(q,)) is a smooth regularization function and D is a neighborhood set containing all pairs of neighboring pixels {p,q}.

According to the Mercer’s theorem [24], which states that kernel function can be expressed as a dot product in a high-dimensional space, explicitly the mapping φ is not available. Instead, the kernel function is as follow:
K y , z = ϕ y T · ϕ z , y , z I 2
Substitution of the kernel function gives:
J K I p , μ = ϕ I p ϕ μ 2 = ϕ I p ϕ μ T · ϕ I p ϕ μ = ϕ I p T ϕ I p ϕ μ T ϕ I p ϕ I p T ϕ μ + ϕ μ T ϕ μ = K I p , I p + K μ , μ 2 K I p , μ , μ μ l
Equation (4) is solved forϕ(I p ) − ϕ(μ)2 and substituted in (2). Thus, the kernel-induced energy function is given by:
E μ l , δ = l L p R l J K I p , μ l + α p , q D r δ p , δ q

Now, based on the kernel-induced energy function, the graph cuts algorithm can be executed to segment images more efficiently.

Kernel principle component analysis

KPCA is a nonlinear feature extractor performed in the feature space F. The basic idea of the method is to map the data from the input space S to a feature space F via nonlinear map ϕ:SF. Because KPCA is able to capture nonlinear features in the data comparing to linear PCA, it can be used more effectively if a pre-image of the projection in the feature space is available. Rathi et al. [22] proposed a novel method to reconstruct a unique approximate pre-image of a feature vector and applied it for statistical shape analysis.

To form the statistical model of shape space S, the pre-image of the projection (in the KPCA space) of a test point xS should be found, as shown in Figure 1 from [25]. Let {x 1 , X n }S be a set of aligned training shapes represented by binary mask where 1 is object and 0 is background and spread as vectors.
Figure 1

The pre-image problem in KPCA.

First, the N×N kernel matrix K with the radial basis function (gauss function) has to be computed:
K i j = k x i , x j = exp x i x j 2 2 σ 2
Second, following Eigen decomposition has to be considered :

H is the centering matrix given by H = C 1 N c c T ,C is the N×N identity matrix, c = [11 … 1] T is an N×1 vector, U = [∂1,  ∂ N ] T with ∂ i  = [ai 1, …, a iN ] T is the matrix containing the eigenvectors and Σ = diag(λ1, …, λ N ) contains the corresponding eigen values.

Third, given a point xS one can compute its projection Pϕ(x)F and a subspace is spanned by the first n eigenvectors given by:
x = k = 1 n β k V k + φ ¯
Where φ ¯ = 1 N i = 1 N φ x i ; φ ˜ is the map centralized by φ ˜ x = φ x φ ¯ . V k = i = 1 N a k i λ k φ ˜ x i is the k th orthogonal eigenvector of the covariance matrix in F. The projection of test point x in F project onto the k th component by B k . Then β k = 1 λ k i = 1 N a k i k ˜ x , x i
where k ˜ x , y = < φ ˜ x , φ ˜ y > = k x , y 1 N c T k x 1 N c T k y + 1 N 2 c T Kc
with k x = k x , x 1 , , k x , x N T
Finally, the method in [22] is used to compute the approximate pre-image x ^ :
x ^ = i = 1 N γ ˜ i 1 2 2 φ x i x 2 x i i = 1 N γ ˜ i 1 2 2 φ x i x 2
And the distance used in feature space in equation (9) is defined as follows:
φ x i x 2 = k ˜ x + 2 H 1 N K c k x i T M k ˜ x + 1 N 2 c T K c + K i i 2 N c T k x i

where M = i = 1 N 1 λ i k k T , γ = [∂1, …, ∂ n ]β, γ ˜ = γ + 1 N 1 c T γ .

The pre-image x ^ contains the information that is used to form the shape priors. In following section, the proposed method is presented and summarized.

Proposed method

To mitigate the effect of weak boundary in MR images and to segment abdominal organs from surrounding objects with similar intensities, a novel segmentation method is proposed. The method incorporates KPCA with KGC enlightened by [23]. KPCA is used to form the shape priors based on the statistical model proposed by Rathi et al. [22]. Enlightened by the GCBAC (graph cuts based Active Contours) proposed by Xu et al. [16], the initial dilation and erosion contour idea is introduced into the method to locate the position of shape priors. The framework of the segmentation method is shown in Figure 2.
Figure 2

The proposed segmentation framework.

The proposed segmentation framework can be described in two phases.

Phase I is the pre-segmentation phase. It includes two procedures to form the image data.

First, to form the initial contour, a seed point is chosen inside the target region manually, and then the region growing algorithm is used to segment the target region approximately. Based on the result of region growing algorithm, a lot of isolated small regions in the target region are not segmented correctly. For this reason, the morphological dilate and erode operation are executed over the pre-segmented contour using the region growing algorithms. The dilate operation aims to eliminate those isolated small regions and to form a continuous contour around the target region; the erode operation aims to draw the contour near the real target region after the dilate operation. Same morphological structuring element is used for the operation of erode and dilate. As a result, the initial contour is obtained. However, because of the weak boundary in the MR images, a further processing is needed to overcome this problem to reach a more accurate segmentation.

Second step includes obtaining the shape priors. Because of the differences varying from person to person, and different parameters of MR imaging, the shapes of abdominal organs to be segmented differ from each other. Moreover, the respiratory movements make the deformation more complex. Since the deformation is nonlinear, the KPCA is used to train the shape templates determined by experts. Before training the data set, all the shape templates and the initial contour should be aligned. So the image registration is needed here, and only translating, scaling and rotating transforms are taken into consideration during the registration process. Suppose that X i is the vector of one shape template, one of the shape templates Xj is to be chosen, the fittest parameters can be obtained through translating tj, scaling and rotating transform M(s j j ). The target function is obtained by minimizing the error measure Ej:
E j = X i M s j , θ j X j t j T W X i M s j , θ j X j t j

W is the weight matrix, and the least square method is usually used to solve it.

Commonly, most applications, such as feature extraction and pattern classification, only need the new features generated by KPCA. However, for some other applications, reconstructing the pre-image from the KPCA features is needed. In this case KPCA feature is not necessary to describe the deformation patterns; on the contrary, it is required to reconstruct the shapes from the KPCA features. For a Gaussian kernel, the pre-image x ^ can be obtained using Equations (6-10).

Phase II is the segmentation phase. Since the registration is composed of translating, scaling and rotating transform, and the abdominal organs change from patient to patient, the result of registration contour does not represent the real boundary of MR images, and a more accurate segmentation procedure need to be followed. The image data constructs the graph using energy function (5) in KGC, introducing the shape priors x ^ into the data term to overcome the weak boundary. This work aims to use the data term for representing the penalty of pixel attribute to the object or background. Thus, it is assumed that non-uniform shape priors Pp(O) and Pp(B) represent penalty of the shape priors attribute to the object or background at a pixel P. A parameter η(0≤η≤1) is also introduced to represent the weight of relative influence between kernel-induced data term J K and shape priors, so the new data terms can be written as follows:
R p O = η · J K I p , μ O + 1 η · P p O
R p B = η · J K I p , μ B + 1 η · P p B
Since the pre-image has value between 0 and 1, P p (O) is directly used to represent x ^ and set Pp = ( 1- P p (O)). The smooth term used the original term. At last, based on Equation (5), the new energy function is given by:
E μ l , δ = l L p R l η · J K I p , μ l + 1 η · R p l + α p , q D r δ p , δ q

Where l must be O or B, which stands for object or background. Thus, the multi-region segmentation of KGC turns to be the binary segmentation of object or background. The new energy function is used to construct graph, compute min-cut and get the segmentation.


Segmentation is performed on abdominal organs in the abdomen MR images of T1 sequence, and the proposed novel segmentation method is validated using the MATLAB 7.11 program on Windows XP with Lenovo PC with Intel (R) Core (TM) 2 Duo CPU, E7500, and tested using the liver and kidney dataset in abdomen MR images with size of 462 × 310 pixels. All MR images are obtained by Siemens 3.0T MR imaging equipment and all the shape templates are segmented manually by different experts. The size of train set is 30.


First, the original MR images have to be segmented as shown in Figure 3. Figure 3 (a) is used to segment liver in abdominal organs, and Figure 3 (b) is used to segment both of the two kidneys in abdominal organs.
Figure 3

Original image, (a)the abdomen MR image of liver; (b)the abdomen MR image of kidney.

Second, a seed point is placed inside the liver and kidney region in the MR images, and then the region growing algorithm is used to segment the image approximately. The result of region growing algorithm is shown in Figure 4. From the Figure 4, it can be seen that many isolated small regions are not segmented, and boundary leakage and incorrect segmentation are observed. Many blood vessels exist inside the organ tissues and the noise caused by MR equipment lead to lots of isolated small regions; meanwhile the soft tissues are very similar and the overlaps between different soft tissues lead to weak boundary. So, more work is needed to solve this problem.
Figure 4

Region growing algorithm, (a) liver; (b) right kidney; (c) left kidney.

Third, the morphological dilate and erode operation are implemented to fix the problem caused by region growing algorithm. The result contour of region growing is dilated and then eroded as demonstrated in Figure 5, the yellow contour is the result of dilation and the blue contour is the result of erosion. The type of morphological structuring element that is used in dilation and erosion is a disk whose radius can be adjusted depending on the result of region growing algorithm. In this experiment, the size of radius is 15 pixels in liver segmentation, and 10 pixels in kidney segmentation. Same morphological structuring element is used in the same MR image during the dilation and the erosion operation. The blue contour is close to the real boundary of abdominal organs as can be seen in Figure 5, but boundary leakage is still observable.
Figure 5

Dilation (yellow contour) and erosion (blue contour), (a) liver(radius = 15); (b) right kidney(radius = 10); (c) left kidney(radius = 10).

Finally, the shape priors are added into the segmentation to guide the contour more accurate to the real boundary. The size of the training shape template set is 30, and a registration is performed between initial erosion contour (blue contour) and all shape templates (green contour). The result is shown in Figure 6. Figure 7 demonstrates the shape priors which is obtained by training the shape template set using KPCA method. Finally, KGC is combined with shape priors to segment the region inside initial dilation contour (yellow contour) based on function (14). The result of segmentation is shown in Figure 8, from which we can find the boundary leakage is eliminated and the segmentation becomes more correct and accurate.
Figure 6

Shape template set and initial contour registration, (a) liver; (b) right kidney; (c) left kidney.

Figure 7

Shape priors, (a) liver; (b) right kidney; (c) left kidney.

Figure 8

Segmentation results of proposed novel method, (a) liver ( η =0.65); (b) right kidney ( η =0.72); (c) left kidney ( η =0.75).

Quantitative verification

In order to verify the proposed segmentation method, quantitatively experiments are performed to compare our method and other three methods: DRLSE [11], initial erosion contour, KGC in the initial dilation contour without shape priors. The comparison is based on two quantitative performance measures: the probabilistic rand index (PRI) and the variation of information (VoI) [2629].

The PRI counts the fraction of pairs of pixels whose labels are consistent between the computed segmentation and the ground truth. The VoI metric defines the distance between two segmentations like the average conditional entropy. Since the result segmentation boundaries of the proposed method are very close to the ground truth, visible difference between them cannot be identified, for this reason the PRI and VoI are used to quantify the segmentation results.

For each segmentation method, a higher value of PRI and a lower value of VoI imply that the segmentation results are closer to the expert manual segmentation. The statistic data are illustrated in Table 1, and the results of different segmentation algorithms are shown in Figure 9. As can be seen in the Table 1, no matter whether the abdominal organ is liver, right kidney or left kidney, the proposed method has the highest PRI values and the lowest VoI values. As shown in Figure 9, the segmentation with the proposed method has better performance than the other methods. The KGC with shape priors based on KPCA can overcome the boundary leakage and segment every abdominal organ independently without incorrect segmentation of the similar tissues. It indicates that both for liver and for kidney segmentation, the proposed method is better than the other methods.
Table 1

The PRI and VI of different methods in liver and kidneys





Right kidney

Left kidney


Right kidney

Left kidney








Initial erosion contour







KGC in the initial dilation contour without shape priors







The proposed method







Figure 9

The results of different algorithms on liver, right kidney and left kidney from left to right of each row in order, (a-c) DRLSE; (d-f) initial erosion contour; (g-i) KGC in the initial dilation contour without shape priors; (j-l)the proposed method ( η =0.65, 0.72, 0.75).

Parameter adjustment

The value of parameter represents the relative influence of KGC data term and shape priors term. In Figure 8, the value of η increases gradually from liver to right kidney. Since the incorrect segmentation in the Figure 9(g-i) decreases gradually from liver to right kidney, the KGC data term weighted in the energy function become high. If η has a high value, the weight of KGC data term is high too and the weight of shape priors term is small. For different organs different organs, the value of η can be adjusted to optimize segmentation performance.

As shown in Figure 10, when =0.65, 0.72 and 0.75, the segmentation of liver, right kidney and left kidney reach the best accuracy. From the third row of Table 1, the value of PRI is 0.8903, 0.9808 and 0.9913, and the value of VoI is 2.1212, 0.5351 and 0.3965 from liver to right kidney when using KGC inside initial dilation contour without shape priors. In another words, the segmentation error decreases from liver to right kidney, as also shown in Figure 9 (g-i).
Figure 10

The segmentation of different η using the proposed method, from left to right in each row, (a)liver: η = 0.8, 0.7, 0.65, 0.6; (b) right kidney: η = 0.8, 0.75, 0.72, 0.7; (c) left kidney: η = 0.9, 0. 8, 0.75, 0.7.

As mentioned above, by adjusting the value of parameter η, the segmentation can be optimized. If the incorrect segmentation proportion of KGC inside initial dilation contour without shape priors is small, the weight of KGC data term is high, so that the value of η become bigger. On the contrary, if the incorrect segmentation proportion of KGC inside initial dilation contour without shape priors is high, the value of η should become smaller. In this way, a satisfying segmentation result can be obtained finally.


Because of the noise, weak boundary, intensity inhomogeneity and similar intensities among different abdominal organs, the segmentation of abdominal organs is normally considered a challenging task. Furthermore, the deformation caused by individual difference and respiratory movement makes the segmentation task even more difficult.

KGC is a fully automatic segmentation algorithm based on graph cuts. If the KGC algorithm is used alone to segment abdomen MR image, the segmentation result is not satisfying as shown in the Figure 11 (a). The blood vessels in organ and the overlaps among abdominal organs affect the segmentation, thus, a fully complete boundary of liver or other organs cannot be obtained. To make the segmentation procedure focus on a given organ, the initial contour is produced by region growing algorithm and morphology operation. But this is considered not enough. The segmentation result can be seen from Figure 11(b). For this reason some shape priors has been used to make the segmentation algorithm more robust and accurate. Since KPCA can handle nonlinear deformable information, the shape priors based on KPCA is integrated into KGC. Moreover, if a shelter is placed onto the target’s boundary, a satisfying segmentation result can be also obtained. This is validated by experiments as shown in Figure 11 (c).
Figure 11

Comparison of different constraint with KGC on liver, (a) KGC’s segmentation for liver without initial contour, (b) KGC in the initial dilation contour without shape priors, (c) the proposed method’s segmentation with shelter.

Additionally, to develop reliable prior knowledge, we should choose patients with similar age and weight. In this way their shape prior would guide to the correct segmentation.

On the clinical side, the work assumed that the geometric inaccuracy, such as distortion, does not exist. Because of this, the MR imaging technology has experienced a rapid development to overcome the magnetic field inhomogeneity. Nowadays, the image spatial resolution can be very high and geometric distortion of MR images can be ignored. However, if a more accurate segmentation is needed, geometric distortion should be corrected at first. This will be investigated in future works.


In this paper, a novel method is proposed to segment abdominal organs integrating kernel graph cuts with KPCA shape priors after a series of pre-processing on the abdomen MR images. The morphology operation can eliminate the isolated small region after region growing algorithm. The kernel graph cuts is a fully automatic segmentation algorithm, and it also has global minimization and polynomial time complexity characteristics. The shape priors, generated by pre-image projection via KPCA, can handle nonlinear deformation. Experiments on liver and kidney segmentation of abdomen MR image showed that the novel method can obtain satisfying results. The kernel function used in this method is gauss function, and other kernel functions have not been tested yet. Currently, the seed point is obtained manually, but automation will be considered in future works. For the time performance, the algorithm can be parallelized on Graphic processors to achieve higher performance.




Magnetic resonance


Kernel graph cuts


Kernel principle component analysis


Probabilistic rand index


Variation of information


Distance regularized level set evolution


Active appearance model


Principle component analysis


Graph cuts based active contours.



This work is supported in part by grants from National Natural Science Foundation of China for the Youth(NSFC:61103165), Guangdong Innovative Research Team Program (No. 2011S013) of China, Shenzhen Basic Research for Outstanding Youth(JC201005260248A), Shenzhen Basic Research Program(JCYJ20130401170306812) and National Natural Science Foundation of China (NSFC: 81171402). We thank Shibin Wu for helpful conversations.

Authors’ Affiliations

The Shenzhen Key Laboratory for Low-cost Healthcare, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences
Faculty of Computer, Guangdong University of Technology
University of Chinese Academy of Sciences


  1. Tsutsumi N, Tomikawa M, Uemura M, et al.: Image-guided laparoscopic surgery in an open MRI operating theater[J]. Surgical Endoscopy 2013, 27(6):2178–2184. 10.1007/s00464-012-2737-yView ArticleGoogle Scholar
  2. Oliveira DAB, Feitosa RQ, Correia MM: Segmentation of liver, its vessels and lesions from CT images for surgical planning[J]. Biomedical engineering online 2011, 10(1):1–23. 10.1186/1475-925X-10-1View ArticleGoogle Scholar
  3. Peterhans M, Vom Berg A, Dagon B, et al.: A navigation system for open liver surgery: design, workflow and first clinical applications[J]. The International Journal of Medical Robotics and Computer Assisted Surgery 2011, 7(1):7–16. 10.1002/rcs.360View ArticleGoogle Scholar
  4. Ma Z, Tavares JMRS, Jorge RN, et al.: A review of algorithms for medical image segmentation and their applications to the female pelvic cavity[J]. Comput Methods Biomech Biomed Engin 2010, 13(2):235–246. 10.1080/10255840903131878View ArticleGoogle Scholar
  5. Artan Y, Haider MA, Yetik IS: Graph-based active contours using shape priors for prostate segmentation with MRI[C]/Biomedical Imaging: From Nano to Macro, 2011. IEEE International Symposium on. IEEE; 2011:1459–1462. Chicago, IL; 2011. Date of Conference: March 30 2011-April 2 2011Google Scholar
  6. Masoumi H, Behrad A, Pourmina MA, et al.: Automatic liver segmentation in MRI images using an iterative watershed algorithm and artificial neural network[J]. Biomedical Signal Processing and Control 2012, 7(5):429–437. 10.1016/j.bspc.2012.01.002View ArticleGoogle Scholar
  7. Li S, Zöllner FG, Merrem AD, et al.: Wavelet-based segmentation of renal compartments in DCE-MRI of human kidney: initial results in patients and healthy volunteers[J]. Comput Med Imaging Graph 2012, 36(2):108–118. 10.1016/j.compmedimag.2011.06.005View ArticleGoogle Scholar
  8. Caselles V, Kimmel R, Sapiro G: Geodesic active contours[J]. International journal of computer vision 1997, 22(1):61–79. 10.1023/A:1007979827043View ArticleMATHGoogle Scholar
  9. Chan TF, Vese LA: Active contours without edges[J]. Image Processing, IEEE Transactions on 2001, 10(2):266–277. 10.1109/83.902291View ArticleMATHGoogle Scholar
  10. Li C, Kao CY, Gore JC, et al.: Implicit active contours driven by local binary fitting energy[C]. Minneapolis, MN; 2007. Date of Conference: 17–22 June 2007View ArticleGoogle Scholar
  11. Li C, Xu C, Gui C, et al.: Distance regularized level set evolution and its application to image segmentation[J]. Image Processing, IEEE Transactions on 2010, 19(12):3243–3254.MathSciNetView ArticleGoogle Scholar
  12. Ben Ayed I, Mitiche A, Belhadj Z: Polarimetric image segmentation via maximum-likelihood approximation and efficient multiphase level-sets[J]. Pattern Analysis and Machine Intelligence, IEEE Transactions on 2006, 28(9):1493–1500.View ArticleGoogle Scholar
  13. Li C, Huang R, Ding Z, et al.: A level set method for image segmentation in the presence of intensity inhomogeneities with application to MRI[J]. Image Processing, IEEE Transactions on 2011, 20(7):2007–2016.MathSciNetView ArticleGoogle Scholar
  14. Boykov YY, Jolly MP: Interactive graph cuts for optimal boundary & region segmentation of objects in ND images[C]//Computer Vision, 2001. ICCV 2001. Proceedings. Eighth IEEE International Conference on. IEEE 2001, 1: 105–112.Google Scholar
  15. Salah MB, Mitiche A, Ayed IB: Multiregion image segmentation by parametric kernel graph cuts[J]. Image Processing, IEEE Transactions on 2011, 20(2):545–557.View ArticleGoogle Scholar
  16. Xu N, Ahuja N, Bansal R: Object segmentation using graph cuts based active contours[J]. Comput Vis Image Underst 2007, 107(3):210–224. 10.1016/j.cviu.2006.11.004View ArticleGoogle Scholar
  17. Uzunbas MG, Zhang S, Pohl KM, et al.: Segmentation of myocardium using deformable regions and graph cuts[C]. Barcelona; Date of Conference: 2–5 May 2012Google Scholar
  18. Slabaugh G, Unal G: Graph cuts segmentation using an elliptical shape prior[C]//Image Processing, 2005. Volume 2. II edition. Genoa, Italy: ICIP 2005. IEEE International Conference on. IEEE; 2005:1222–1225. September 11–14Google Scholar
  19. Wang H, Zhang H, Ray N: Adaptive shape prior in graph cut image segmentation[J]. Pattern Recognition 2013, 46(5):1409–1414. 10.1016/j.patcog.2012.11.002View ArticleGoogle Scholar
  20. Song Z, Tustison N, Avants B, et al.: Adaptive graph cuts with tissue priors for brain MRI segmentation[C]//Biomedical Imaging: Nano to Macro, 2006. 3rd IEEE International Symposium on. Arlington, VA: IEEE; 2006:762–765. Date of Conference: 6–9 April 2006View ArticleGoogle Scholar
  21. Ali AM, Farag AA, El-Baz AS: Graph cuts framework for kidney segmentation with prior shape constraints[M]//Medical Image Computing and Computer-Assisted Intervention–MICCAI 2007. Volume 4791. Berlin Heidelberg: Springer; 2007:384–392.Google Scholar
  22. Chen X, Udupa JK, Bagci U, et al.: Medical image segmentation by combining graph cuts and oriented active appearance models[J]. Image Processing, IEEE Transactions on 2012, 21(4):2035–2046.MathSciNetView ArticleGoogle Scholar
  23. Rathi Y, Dambreville S, Tannenbaum A: Statistical shape analysis using kernel PCA [J]. San Jose, California, USA: Society for Imaging Science and Technology (IS&T) and SPIE.; 2006.Google Scholar
  24. Malcolm J, Rathi Y, Tannenbaum A: Graph cut segmentation with nonlinear shape priors[C]//Image Processing, 2007. San Antonio, TX: ICIP 2007. IEEE International Conference on. IEEE; 2007:365–368. Sept. 16 2007-Oct. 19 2007Google Scholar
  25. Muller KR, Mika S, Ratsch G, et al.: An introduction to kernel-based learning algorithms[J]. Neural Networks, IEEE Transactions on 2001, 12(2):181–201. 10.1109/72.914517View ArticleGoogle Scholar
  26. Dambreville S, Rathi Y: NA-MIC Publications Database on Kernel PCA for Segmentation. 2012. Scholar
  27. Unnikrishnan R, Pantofaru C, Hebert M: A measure for objective evaluation of image segmentation algorithms[C]//Computer Vision and Pattern Recognition-Workshops, 2005. San Diego, CA, USA: CVPR Workshops. IEEE Computer Society Conference on. IEEE; 2005:34–34. Date of Conference: 25–25 June 2005Google Scholar
  28. Meilă M: Comparing clusterings by the variation of information[M]//Learning theory and kernel machines. Volume 2777. Springer Berlin Heidelberg; 2003:173–187.Google Scholar
  29. Yang AY, Wright J, Ma Y, et al.: Unsupervised segmentation of natural images via lossy data compression[J]. Comput Vis Image Underst 2008, 110(2):212–225. 10.1016/j.cviu.2007.07.005View ArticleGoogle Scholar


© Luo et al.; licensee BioMed Central Ltd. 2013

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.