dspinczyk@polsl.pl Faculty of Biomedical Background: Liver segmentation in computed tomography is required in many Engineering, Silesian clinical applications. The segmentation methods used can be classified according to a University of Technology, Roosevelta 40, Zabrze, Poland number of criteria. One important criterion for method selection is the shape represen- tation of the segmented organ. The aim of the work is automatic liver segmentation using general purpose shape modeling methods. Methods: As part of the research, methods based on shape information at various lev- els of advancement were used. The single atlas based segmentation method was used as the simplest shape-based method. This method is derived from a single atlas using the deformable free-form deformation of the control point curves. Subsequently, the classic and modified Active Shape Model (ASM) was used, using medium body shape models. As the most advanced and main method generalized statistical shape models, Gaussian Process Morphable Models was used, which are based on multi-dimensional Gaussian distributions of the shape deformation field. Results: Mutual information and sum os square distance were used as similarity measures. The poorest results were obtained for the single atlas method. For the ASM method in 10 analyzed cases for seven test images, the Dice coefficient was above 55% , of which for three of them the coefficient was over 70 % , which placed the method in second place. The best results were obtained for the method of generalized statistical distribution of the deformation field. The DICE coefficient for this method was 88.5% Conclusions: This value of 88.5 % Dice coefficient can be explained by the use of general-purpose shape modeling methods with a large variance of the shape of the modeled object—the liver and limitations on the size of our training data set, which was limited to 10 cases. The obtained results in presented fully automatic method are comparable with dedicated methods for liver segmentation. In addition, the deforam- tion features of the model can be modeled mathematically by using various kernel functions, which allows to segment the liver on a comparable level using a smaller learning set. Keywords: Liver segmentation, Single atlas based segmentation, Active Shape Model, Gaussian Process Morphable Models © The Author(s) 2018. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creat iveco mmons .org/licen ses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creat iveco mmons .org/publi cdoma in/zero/1.0/) applies to the data made available in this article, unless otherwise stated. Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 2 of 13 Background Liver segmentation has been the subject of research by various authors for many years and is required in many clinical applications [1–3]. The most popular imaging mode is computed tomography (CT) or the contrast-enhanced CT, which are used for computer aided diagnosis (CAD) [4, 5] and planning and support of computer assisted interven- tions (CAI) of primary and secondary tumors in liver [6–9]. Precise liver segmentation is also crucial for selective internal radiation therapy (SIRT) [10]. The segmentation methods used can be classified according to a number of criteria. One important criterion for the division is the method of using information about the shape of the organ by a given method [11]. Simple segmentation methods that do not use shape information can be applied to different objects with a uniform intensity distribution and clearly separate the object of the interest from neighboring bodies. Such methods can be applied by selecting the values of several general parameters of the method, which can be selected on the basis of representative examples. In turn, more complex methods contain many parameters that use knowledge in the field of the shape of a segmented object. The aim of the work is automatic liver segmentation using general purpose shape modeling methods. A new element in the work is the application of the generalized sta- tistical model of the shape deformation method presented in [12]. Methods As part of the research, methods based on shape information at various levels of advancement were used. The single atlas based segmentation method was used as the simplest shape-based method. This method is derived from a single atlas using the deformable free-form deformation of the control point curves [13, 14]. Subsequently, the classic and modified Active Shape Model (ASM) was applied, using the medium body shape models and organ model [15]. The most advanced method used was generalized statistical shape models, which are based on multi-dimensional Gaussian distributions of the shape deformation field [12]. Simple atlas method An atlas-based segmentation method propagates the segmentation of an atlas image using the image registration technique (Fig. 1). In this paper the B-spline transformation will be used. A rectan- gular grid G = K × K × K is superimposed on the image (size x y z N × N × N , K << N , K << N , K << N ) which is deformed under the influence x y z x x y y z z of the control points. The dense deformation is given as a summation of tensor products of univariate splines. The displacement field u(x) is given as: 3 3 3 T (x) = B (µ )B (µ )B (µ )d l x m y n z i+l,j+m,k+n (1) l=0 m=0 n=0 where i = ⌊x/N ⌋ − 1 , j =⌊y/N ⌋ − 1 , k =⌊z/N ⌋ − 1 , µ = x/N − ⌊x/N ⌋ , x y z x x x µ = y/N − ⌊y/N ⌋ , µ = z/N −⌊z/N ⌋ , B —represents lth basis function of the y y y z z z l B-splne and d denotes the displacement. Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 3 of 13 Fig. 1 Concept behind the single atlas-based segmentation [5] Registration reffers to as a selection the set of the parameters: µ ˆ = argminC(ψ; I , I ) F M (2) where C(ψ ; I , I )—is the cost function related to the similarity metrics. The other F M important details can be found in a previous paper [5]. Classic and modified Active Shape Model In the 1990s, Tim Cootes and Chris Taylor introduced a new segmentation technique called the Active Shape Model (abbreviated as ASM). This method makes it possible to create a medium model of the shape of the object based on the training set, and then iteratively deform and move its boundaries so that it fits the new case as well as possible. The ASM algorithm can be divided into three main stages, which consists of: determining the training set, estimating the average (statistical) shape model, and optimizing the obtained shape model. The classic ASM method uses the point distri - bution model (PDM), by means of which the pattern of the segmented object is cre- ated [16]. The steps necessary to create a shape model are shown in Fig. 2 The ASM method uses the statistical analysis of coordinate positions to learn a set of landmarks. In order to be able to compare the corresponding points belong- ing to different shape models from the training set, user must first align the axis set. A modified Procrustes analysis is used to transform the training set data by scaling, rotation, and translation [17]. The next step in the ASM is to estimate the statistics of aligned images from the training set. First, the average shape is calculated, which can be expressed by the formula: X = X i (3) i=1 Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 4 of 13 Fig. 2 Stages of determining the shape model in the ASM method where X —average shape, X —i-th shape, N—the number of alligned shape in the train- ing set. Ways of variability, or directions in which points of shape are going together while moving, are found using Principal Component Analysis (PCA) for deviations from the average value. For each shape from the training set, the deviations from the average dX are estimated: dX = X − X (4) i i The calculated dx values are then used to determine the 2n ∗ 2n covariance matrix S, where n is the number of landmarks S = dX dX (5) i=1 The direction of the variation of the points can be described by the eigenvectors p of the covariance matrix S. The eigenvectors of the covariance matrix correspond - ing to the largest eigenvalues represent the most significant variability possibilities of the values on the basis of which the matrix S was created. In addition, the ratio of Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 5 of 13 the total variance to each eigenvalue is equal to the eigenvector for that value. Thanks to these properties, most of the shape changes can be translated by a small number of modes. Each shape s from the training set can be approximated using the average shape and the weighted sum of deviations obtained from the first t modes of variation: s = X + Pb (6) where P—matrix of first t eigenvectors (p p ...p ) , b—vector of weights for each eigen- 1 2 t vector (b b ...b ) 1 2 t The use of the created average shape to the location on the images of the searched object requires that the model contains information not only about the shape, but also about the intensity levels and texture of the objects. For this purpose, the models of the appearance of the intensity level (Gray-Level Appearance Model) are determined [18]. When creating appearance models, statistical values of gray levels are analyzed in the areas around each landmark determined in previous stages of the ASM algo- rithm. By assuming the ASM method, the orientation points correspond to specific locations on objects in all learning images, which is why the designated gray level pat- terns in different images around landmarks should be similar. The adjustment of the previously estimated average shape to the new case can be broadly divided into two steps repeated in an iterative manner: • Creating a series of hypotheses giving approximate locations of model points, • Refining each hypothesis and choosing the best one. The Active Shape Model method has undergone many different modifications and improvements. The main problem of the ASM method is generating learning data that meets the following conditions: • In every set of points there must be n corresponding landmarks, • Each landmark must lie in the image on the edge of the object the model is created, • Each set of n points must form a spatial grid consisting of polygons (creating a vertices-faces representation). In this paper the ASM with the optimal features is used. This is an alternative to the classic ASM abandoning the creation of the Gray-Level Appearance Model using standardized derivative profiles and without estimating the cost function based on the Mahalanobis distance in favor of the algorithm which allows you to move the landmarks towards a better location during optimization along a perpendicular direction to the object edge [15]. The authors assumed that the best location is one for which everything on one side of the profile is outside the object, and everything on the other side is in the middle of the object. In order to determine whether a given location is in or outside the object, the probability is determined for the area around each landmark, on the basis of which the classification is made. The decision on the best new location of the point is made by the non-linear classifier of the k-nearest neighbors classifier (kNN-classifier). The authors of the article [19] proposed using the iterative closest point method (ICP) to generate a training set. Behiels et al. [20] proposed to improve the way the Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 6 of 13 shape of the model is adjusted to the new case in ASM. In classic ASM, the position and shape parameters are corrected at each iteration by minimizing the sum of the squares of differences between model points and points estimated in a given iteration. This criterion of matching with the smallest squares is sensitive to outliers, which results in poorer results. When the outlying points attract further points towards it, the location of the landmarks can longer be improved in the next iteration. For this reason, it has been proposed to correct the suggested dX displacements before updat- ing the position and shape parameters. In order to prepare the data, all the images were subjected to the initial phase of data processing resulting in the generation of volumes on which the liver is visible in 60 cross- sections. The initial processing phase can be divided into two stages. In the process of creating models of liver shape, prepared, segmented images were used. Based on these images, the edge of the liver was marked. Then 20–100 points lying on the designated border were selected. For the first four and last liver cross-sections, the number of land - marks changed by 20 points, while for others the number was constant and amounted to 100. Three image resolution coefficients were used in the calculations: 0.25, 0.5 and 1. For each of them, five iterations with unchanged parameters were made. During results generation, the length of the profiles was 8 pixels, the number of determined landmark positions was 6 and the limits of the own values to 3. Generalized statistical shape model The statistical generalized model—Gaussian Process Morphable Model (GPMM) based on the decomposition of the main components is a linear model that can be presented in a parametric manner [12]. The shape of the object can be represented as a folding of the deformation of an object with a reference shape: s = X + u(X)|X ∈ Ŵ R (7) where s—the shape of the object (the vector of the coordinates of points lying on the surface of the model), X—shape vector, u— → R deformation field (vector field of the shape difference), Ŵ — reference shape. The deformation field is modeled as a multi-dimensional Gaussian process: u = GP(µ, k) (8) 3 3×3 where GP—Gaussian process, µ — → R average deformation, k—× → R covariance function or kernel function. The idea of a statistical model of a shape is based on the decomposition of the prin - cipal components and consists in the representation of a multi-dimensional Gaussian process in the form of a low-dimensional sum of r of the leading base functions: u = µ + α φ i i i (9) i=1 where φ —i-th basic function, —variance of shape corresponding to the i-th base func- i i tion φ i Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 7 of 13 If the modeled shape of the object is characterized by high smoothness, then only a few basic functions are needed to create a good approximation of the shape - hence the name of the low-dimensional representation of the shape. The challenge with this approach is to effectively calculate the value in the sense of computational complex - ity, therefore, with a larger number of model points, Nyström approximations are used [21]. One of the major advantages of a generalized statistical model, based on a multidimensional Gaussian process, in relation to the classical statistical model is the freedom to select the function of the nucleus. For a small training set, shape statistics can be represented by modeling properties of the kernel functions known from the image registration process such as radial functions or spline functions. The method presented above was adapted for the needs of segmentation of the liver organ - using the following main stages: • Rigid registration of input images • Finding correspondence in example sample vectors • Building a statistical shape model based on sample shapes • Segmenting of a new case whose main elements have been characterized below. The more detailed steps are presented in Fig. 3. Rigid registration of input images The data collection of abdominal CT reference images together with the expert out - lines of the liver organ is subjected to a rigid registration of the similarity based on the minimization of MI, which brings the entire set to one common coordinate sys- tem. This is a necessary step because the generalized statistical model simulates shape deformations. Fig. 3 The steps for liver segmentation using generalized statistical shape model Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 8 of 13 Finding correspondence in example shape vectors Ensuring the adequacy of points in shape vectors is a prerequisite for using input data in the further stages of building a Gaussian process. Finding the appropriateness of points in a set of shapes from a training set proceeds in the following main steps: 1. Selecting of one of the shapes as a reference shape. 2. Building a Gaussian process on a reference model using the kernel function for a smooth deformation model. 3. Distributing the Gaussian process to r Karhunen-Loe ve coefficients. 4. Registering of the model to individual shapes from the training set using the model development as a function of regularization in the registration task consisting of minimizing the distance measure. Building a statistical shape model based on sample shapes The use of the selected kernel functions for the Gaussian process modeling shape defor - mation does not ensure that knowledge about the subject shapes of the modeled object is taken into account. The perfect model of shape should only be deformed to shapes that can occur in reality, which is the main assumption behind the construction of statis- tical shape models. In the presented approach, the model is taught this property based on a set of sample shapes Ŵ , ..., Ŵ . After providing correspondence between the refer- 1 N ence shape Ŵ and all the sample shapes, we obtain a set of deformation fields: {u , ..., u }, u : → R (10) 1 N i where u (X)—the deformation field that maps the point of the reference surface X Ŵ to i R its corresponding point u (X) on the i − th surface. The Gaussian process GP(µ , k ) , which models this characteristic deformation, is SM SM obtained by the average estimation of its parameters: µ (X) = u (X) (11) SM i i=1 and k (X, Y ) = (u (X) − µ (X))(u (Y ) − µ (Y )) (12) SM i SM i SM N − 1 i=1 Segmentation of a new case After constructing a generalized model of probabilistic distribution of shape deforma- tion based on shapes from the training set, such a model can be used to segment the object in a new input image. In this case, the properties of a continuous multidimen- sional Gaussian process. The algorithm adjusting the model minimizes the Mahalanobis distance between the given and the average profile along the normal direction to the model. The main difference between ASM and GPMM is the generation of candidates for the new location of the points matching the image of the model. In the classic ASM Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 9 of 13 approach, candidates are found along the normal vector to a model with a given length parameter. In the case under consideration, candidates are generated as samples from the Gaussian distribution of liver shape deformation built on the training set. There - fore, the new position of the model point does not have to be on the normal vector, but results from the probability distribution of the shape deformation field. In order to pre - serve the possibility of comparing the results in the considered scenarios, the same num- ber of model points was used as in the case of the classical ASM algorithm. Input data set For the liver segmentation, 20 CT images of the abdominal cavity with a resolution of 512 by 512 pixels available in the SILVER07 database were used [22]. The number of cross-sections on the images ranged from 64 to 394, while their thickness ranged from 0.7 to 3 cm. Each volume also contained a binary image with a segmented liver organ made with the help of radiologists (experts). Quantifying segmentation quality Ground truth, which are usually manually segmented by a human expert, is necessary to quantify segmentation accuracy. As similarity index the following measures are used: • Dice similarity coefficient (DICE) defined as: |I ∩ I (T )| F−Seg M−Seg DICE(I , I (T )) = 2 ∗ 100% F−Seg M−Seg (13) |I |+|I (T )| F−Seg M−Seg where I , I present two segmentations and | | denominates the number of F−Seg M−Seg voxels inside the segmentation, • Mean surface distance (MSD) is defined as: n y MSD(I , I (T )) = d d F−Seg M−Seg i j (14) n + n X Y i=1 j=1 where n , n represent the number of voxels on the two segmentation surfaces X Y respectively, and d are the closest distances from each voxel on the surface to the other surface. The value of this measure helps to identify distance between registered surfaces. • Hausdorff distance is defined as: H (I , I (T )) = max sup inf d(x, y), sup inf d(x, y) F−Seg M−Seg (15) y∈N x∈N Y X x∈N y∈N X Y where N , N represent the voxels on the two segmentation surfaces respectively, X Y and d and d are the closest distances from each voxel on the surface to the other i j surface. Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 10 of 13 Results The segmentation quality measures defined above (DICE, MSD, Hausdorff ) were used to present the results. Table 1 presents a quantitative summary of the obtained results. Statistical analysis of the results of the DICE coverage coefficient was performed. After demonstrating the lack of normal distribution (Shapiro-Wilk test), the Wilcoxon test was used to verify the median equality. Statistically significant differences in median DICE coefficient for the method of generalized statistical form factor in relation to Active Shape Model based on medium shape and a single atlas were demonstrated. The graphi - cal representation of the results below presents the best and worst result of liver organ segmentation (according to the criterion of the DICE—Fig. 4). Figure 5 presents drawings of registered liver surfaces in axial and coronal projections using the rigid registration method for training data set. Discussion Liver segmentation using the methods used (single-atlas method, ASM and general- ized statistical model of shape deformation) showed differences in results depending on the approach used (Table 1). The more complex the shape model used, the better the results. The poorest results were obtained for the single atlas method, with the meas - ure of MI from the SSD measure being a better measure of similarity. In the case of the ASM method, in 10 analyzed new cases for seven test images, the DICE coefficient was obtained above 55% , of which for three of them the coefficient was over 70 % , which placed the method in second place.The best results were obtained for the method of gen - eralized statistical distribution of the deformation field. The best results had a DICE of 75% . Various specialized methods of liver segmentation are described in the literature [2, 23, 24]. They present DICE coefficients between 85 and 95 % . The lower value of DICE in the presented approach can be explained by the use of general-purpose shape modeling methods, with a large variance of the shape of the modeled object—the liver. Due to the database of contoured expert cases, the training set was limited to 10 cases and number of shape model points was limited to 10,000. To confirm the competitiveness of the proposed method, the approach used was compared with the three best methods dedicated to liver segmentation indicated in the MICCAI challenge [22]. In these studies we demonstrated the scalability of the pro- posed method. We increased the number of model points holding four times with an average DICE rating of 88.5% and scoring according to the MICCAI Challenge criterion 65 pts. The authors of these articles shared the results they obtained. The best methods [25–27] scored 73, 59 and 43 pts respectively. Compared with the dedicated methods Table 1 Quantifying segmentation results according using methods - shape model points was limited to 10,000 and to 10 cases in training set Similarity Single atlas Single atlas Classical Modified GPMM GPMM GPMM measure SSD MI ASM ASM 10,000 19,000 40,000 pts pts pts MSD (mm) 3.49 3.08 2.91 2.85 2.79 1.95 1.7 H (mm) 6.02 4.65 574.29 572.95 4.32 3.7 2.9 DICE (%) 0.49 0.59 0.57 0.57 0.74 0.85 0.885 Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 11 of 13 Fig. 4 The best (left) and worst (right) result of liver segmentation according to the criterion of the dice coefficient: expert delineation (pink color), automated results (green color), common part (white color) Fig. 5 Drawings of registered liver surfaces in projections: axial (left) and coronal (right) using the Rigid registration method for training data set Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 12 of 13 for liver segmentation with MICCAI challenge [22], the method took the 2nd place. The first place was taken by a method containing both a deformation based on Free-Form Segmentation statistics and shape statistics. However, this method required advanced assumptions and calculations related to Constrained Free-Form Deformation for a typi- cal intensity distribution around the liver. In addition, the model the statistical was built on a four times larger training set [25]. The presented method does not contain any stages characteristic for the liver and is also fully automatic. In addition, the deforamtion features of the model can be modeled mathematically by using various kernel functions [12], which allows to segment the liver on a comparable level using a smaller learning set. In the future, it is planned to create a deformation model on a larger training set. Conclusions The aim of the work is automatic liver segmentation using general purpose shape mod - eling methods. A new element in the work is the application of the generalized statistical model of the shape deformation method presented in [12]. Due to the clinical relevance of the problem of automatic liver segmentation and the existence of many highly spe- cialized methods and the development of general-purpose methods of statistical shape modeling, research on the effective use of general-purpose methods to support clinical goals seems to be one of the many significant directions of development of modern bio - medical engineering. In the presented approach, a DICE of 88.5% potentially indicates an the possibility of effective use of the modern general-purpose methods while building the most repre - sentative dictionaries that cover the variability of anatomical shapes in the patient popu- lation. The obtained results in presented fully automatic method are comparable with dedicated methods for liver segmentation. In addition, the deforamtion features of the model can be modeled mathematically by using various kernel functions, which allows to segment the liver on a comparable level using a smaller learning set. Authors’ contributions Conception and design of the work, Drafting the article, Final aproval of the article: DS. Data analyis: AK. All authors read and approved the fnal manuscript. Acknowledgements We want to thanks Andre Woloshuk for English language corrections. Competing interests The authors declare that they have no competing interests. Availability of data and materials The data that support the findings of this study are available as part of the workshop 3D Segmentation in the Clinic: A Grand Challenge, on October 29, 2007 in conjunction with MICCAI 2007 [22]. Consent for publication Not applicable. Ethics approval and consent to participate Bioetic Commission for this study is not necessary. Funding There is no founding for presented research. Publisher’s Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. Spinczyk and Krasoń BioMed Eng OnLine (2018) 17:65 Page 13 of 13 Received: 20 February 2018 Accepted: 23 May 2018 References 1. Moghbel M, Mashohor S, Mahmud R, Saripan MIB. Review of liver segmentation and computer assisted detection/ diagnosis methods in computed tomography. Artif Intell Rev. 2017. https ://doi.org/10.1007/s1046 2-017-9550-x. 2. Mharib AM, Ramli AR, Mashohor S, Mahmood RB. Survey on liver ct image segmentation methods. Artif Intell Rev. 2012;37(2):83–95. 3. Punia R, Singh S. Review on machine learning techniques for automatic segmentation of liver images. Int J Adv Res Comput Sci Softw Eng. 2013;3(4):666–70. 4. Spinczyk D. Preparing the anatomical model for ablation of unresectable liver tumor. Videosurgery Other Miniinva- sive Tech. 2014;9(2):246–51. 5. Spinczyk D, Krason A. Simple atlas selection strategies for liver segmentation in ct images. In: Pietka E, Badura P, Kawa J, Wieclawek W, editors. Information Technologies in Medicine. Cham: Springer; 2016. p. 137–48. 6. Spinczyk D. Assistance in destroying focal lesions in the liver using image navigation. In: Pietka E, Kawa J, Wieclawek W, editors. Information Technologies in Biomedicine, vol. 4. Cham: Springer; 2014. p. 15–24. 7. Spinczyk D. Towards the clinical integration of an image-guided navigation system for percutaneous liver tumor ablation using freehand 2d ultrasound images. Comput Aided Surg. 2015;20(1):61–72. 8. Fabian S, Spinczyk D. Target registration error minimization for minimally invasive interventions involving deform- able organs. Comput Med Imaging Graph. 2018;65:4–10. https ://doi.org/10.1016/j.compm edima g.2017.01.008. 9. Spinczyk D, Fabian S. Target registration error minimization involving deformable organs using elastic body splines and particle swarm optimization approach. Surg Oncol. 2017;26(4):489–97. 10. Kennedy A, Brown DB, Feilchenfeldt J, Marshall J, Wasan H, Fakih M, Gibbs P, Knuth A, Sangro B, Soulen MC, Pit- tari G, Sharma RA. Safety of selective internal radiation therapy with yttrium-90 microspheres combined with systemic anticancer agents: expert consensus. J Gastrointest Oncol. 2017;8(6):1079–99. https ://doi.org/10.21037 / jgo.2017.09.10. 11. Erdt M, Steger S, Sakas G. Regmentation: A new view of image segmentation and registration. Journal of Radiation Oncology Informatics. 2017;4(1):1–23. 12. Lüthi M, Gerig T, Jud C, Vetter T. Gaussian process morphable models. IEEE Trans Pattern Anal Mach Intell. 2018;1(1):99. 13. Slagmolen P, Elen A, Seghers D, Loeckx D, Maes F, Haustermans K Atlas based liver segmentation using nonrigid registration with a b-spline transformation model. In: Proceedings of MICCAI workshop on 3D segmentation in the clinic: a grand challenge. 2007. p. 197–206. 14. Wyawahare MV, Pradeep D, Patil M, Abhyankar HK. Image registration techniques: an overview. Int J Sig Process Image Process Pattern Recognit. 2009;2(3):11–28. 15. van Ginneken B, Frangi AF, Staal JJ, ter Haar Romeny BM, Viergever MA. Active shape model segmentation with optimal features. IEEE Trans Med Imaging. 2002;21(8):924–33. 16. Cootes TF, Taylor CJ, Cooper DH, Graham J. Training models of shape from sets of examples. In: Hogg D, Boyle R, edi- tors. BMVC92. London: Springer; 1992. p. 9–18. 17. Kendall DG. A survey of the statistical theory of shape. Stat Sci. 1989;4(2):87–99. 18. Cootes T, Hill A, Taylor C, Haslam J. Use of active shape models for locating structures in medical images. Image and vision computing. Inf Process Med Imaging. 1994;12(6):355–65. 19. Kos A, Skalski A, Zielinski T. A modified asm algorithm, that considers a ct and mri medical data anisotropy at the stage of statistic shape model generation. Przeglad Elektrotechniczny. 2015;91(5):41–4. 20. Behiels G, Vandermeulen D, Maes F, Suetens P, Dewaele P. Active shape model-based segmentation of digital X-ray images. In: Taylor C, Colchester A, editors. Medical image computing and computer-assisted intervention MICCAI’99. Berlin: Springer; 1999. p. 128–37. 21. Li M, Kwok JT, Lu B-L. Making large-scale nystrom approximation possible In: Li M, Kwok JTY, Lu B. Making large-scale Nystrom approximation possible. In: ICML 2010-proceedings, 27th international conference on machine learning. p. 631– 638. 2010. 22. Ginneken BV, Heimann T, Styner M. 3d segmentation in the clinic: a grand challenge. In: In: MICCAI workshop on 3D segmentation in the clinic: a grand challenge, 2007. 2007. 23. Rathore S, Iftikhar MA, Hussain M, Jalil A. Texture analysis for liver segmentation and classification: a survey. In: 2011 Frontiers of information technology. Piscataway: IEEE; 2011; p. 121– 126. 24. Priyadarsini S, Selvathi D. Survey on segmentation of liver from ct images. In: 2012 IEEE international conference on advanced communication control and computing technologies (ICAC CCT ). 2012; p. 234– 238. 25. Kainmueller D, Lange T, Lamecker H Shape constrained automatic segmentation of the liver based on a heuristic intensity model. In: Proc. MICCAI workshop 3D segmentation in the Clinic. 2007; p. 109– 116. 26. Ruskó L, Bekes G, Németh G, Fidrich M. Fully automatic liver segmentation for contrast-enhanced ct images. In: Proc. MICCAI workshop 3D segmentation in the Clinic. 2007; p. 143– 150. 27. Schmidt G, Athelogou M, Schönmeyer R, Korn R, Binnig G Cognition network technology for a fully automated 3d segmentation of liver. In: Proc. MICCAI workshop 3D segmentation in the Clinic. 2007; p. 125– 133.
BioMedical Engineering OnLine – Springer Journals
Published: May 29, 2018
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”
Daniel C.
“Whoa! It’s like Spotify but for academic articles.”
@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”
@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”
@JoseServera
DeepDyve Freelancer | DeepDyve Pro | |
---|---|---|
Price | FREE | $49/month |
Save searches from | ||
Create folders to | ||
Export folders, citations | ||
Read DeepDyve articles | Abstract access only | Unlimited access to over |
20 pages / month | ||
PDF Discount | 20% off | |
You can share this free article with as many people as you like with the url below! We hope you enjoy this feature!
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.
ok to continue