Implementation and use of 3D pairwise geodesic distance fields for seeding abdominal aortic vessels

PurposePrecise extraction of aorta and the vessels departing from it (i.e. coeliac, renal, and iliac) is vital for correct positioning of a graft prior to abdominal aortic surgery. To perform this task, most of the segmentation algorithms rely on seed points, and better-located seed points provide better initial positions for cross-sectional methods. Under non-optimal acquisition characteristics of daily clinical routine and complex morphology of these vessels, inserting seed points to all these small, but critically important vessels is a tedious, time-consuming, and error-prone task. Thus, in this paper, a novel strategy is developed to generate pathways between user-inserted seed points in order to initialize segmentation methods effectively.MethodThe proposed method requires only a single user-inserted seed for each vessel of interest for initializations. Starting from these initial seeds, it automatically generates pathways that span all vessels in between. To accomplish this, first, a geodesic mask is generated by adaptive thresholding, which reinforces the initial seeds to be kept in the vascular tree. Then, a novel implementation of 3D pairwise geodesic distance field (3D-PGDF) is utilized. It is shown that the minimal-valued geodesic of 3D-PGDF successfully defines a path linking the initial seeds as being the shortest geodesic. Moreover, the robustness of the minimum level set of the 3D-PGDF to local variations and regions of high curvature is increased by a region classification strategy, which adds partial geodesics to these critical regions.ResultsThe proposed method was applied to 19 challenging CT data sets obtained from four different scanners and compared to two benchmark methods. The first method is a high-precision technique with very long processing time (subvoxel precise multi-stencil fast marching—MSFM), while the second is a very fast method with lower accuracy (3D fast marching). The results, which are obtained using various measures, show that the pathways generated by the developed technique enable significantly higher segmentation performance than 3D fast marching and require much less computational power and time than MSFM.ConclusionThe developed technique offers a useful tool for generating pathways between seed points with minimal user interaction. It guarantees to include all important vessels in a computationally effective manner and thus, it can be used to initialize segmentation methods for abdominal aortic tree.

[1]  Milan Sonka,et al.  Three-dimensional thrombus segmentation in abdominal aortic aneurysms using graph search based on a triangular mesh , 2010, Comput. Biol. Medicine.

[2]  Ching Y. Suen,et al.  Thinning Methodologies - A Comprehensive Survey , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Adam Parr,et al.  Comparison of volume and diameter measurement in assessing small abdominal aortic aneurysm expansion examined using computed tomographic angiography. , 2011, European journal of radiology.

[4]  Marcela Hernández Hoyos,et al.  Recursive tracking of vascular tree axes in 3D medical images , 2007, International Journal of Computer Assisted Radiology and Surgery.

[5]  Aly A. Farag,et al.  MultiStencils Fast Marching Methods: A Highly Accurate Solution to the Eikonal Equation on Cartesian Domains , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  W. Press,et al.  Numerical Recipes: The Art of Scientific Computing , 1987 .

[7]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Jong Beom Ra,et al.  Three-Dimensional Blood Vessel Quantification via Centerline Deformation , 2009, IEEE Transactions on Medical Imaging.

[9]  Rangasami L. Kashyap,et al.  Building Skeleton Models via 3-D Medial Surface/Axis Thinning Algorithms , 1994, CVGIP Graph. Model. Image Process..

[10]  Stefan Wesarg,et al.  Segmentation of vessels: the corkscrew algorithm , 2004, SPIE Medical Imaging.

[11]  G. Funka-Lea,et al.  Author ' s personal copy A review of 3 D vessel lumen segmentation techniques : Models , features and extraction schemes , 2009 .

[12]  Alfred M. Bruckstein,et al.  Finding Shortest Paths on Surfaces Using Level Sets Propagation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Max A. Viergever,et al.  Interactive segmentation of abdominal aortic aneurysms in CTA images , 2004, Medical Image Anal..

[14]  Nicolas Flasque,et al.  Acquisition, segmentation and tracking of the cerebral vascular tree on 3D magnetic resonance angiography images , 2001, Medical Image Anal..

[15]  Martin Auer,et al.  Reconstruction and Finite Element Mesh Generation of Abdominal Aortic Aneurysms From Computerized Tomography Angiography Data With Minimal User Interactions , 2010, IEEE Transactions on Medical Imaging.

[16]  Rolf Adams,et al.  Seeded Region Growing , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Marcel Breeuwer,et al.  Segmentation of thrombus in abdominal aortic aneurysms from CTA with nonparametric statistical grey level appearance modeling , 2005, IEEE Transactions on Medical Imaging.

[18]  Heinz-Otto Peitgen,et al.  Template-based multiple hypotheses tracking of small vessels , 2008, 2008 5th IEEE International Symposium on Biomedical Imaging: From Nano to Macro.

[19]  J. Baerentzen,et al.  On the Implementation of Fast Marching Methods for 3d Lattices , .

[20]  Nikos Papamarkos,et al.  A New Approach for Multilevel Threshold Selection , 1994, CVGIP Graph. Model. Image Process..

[21]  Marcel Breeuwer,et al.  Segmentation of Abdominal Aortic Aneurysms with a Non-parametric Appearance Model , 2004, ECCV Workshops CVAMIA and MMBIA.

[22]  Christine Toumoulin,et al.  Evaluation of a 3D Segmentation Software for the Coronary Characterization in Multi-slice Computed Tomography , 2003, FIMH.

[23]  Nikos Papamarkos,et al.  A program for the optimum approximation of real rational functions via linear programming , 1989 .

[24]  S. Napel,et al.  An abdominal aortic aneurysm segmentation method: level set with region and statistical information. , 2006, Medical physics.

[25]  Martin Styner,et al.  Comparison and Evaluation of Methods for Liver Segmentation From CT Datasets , 2009, IEEE Transactions on Medical Imaging.

[26]  Hüseyin Tek,et al.  Robust Vessel Tree Modeling , 2008, MICCAI.

[27]  Pierre Soille,et al.  Generalized geodesy via geodesic time , 1994, Pattern Recognit. Lett..

[28]  Karl Rohr,et al.  Cramér-Rao Bounds for Estimating the Position and Width of 3D Tubular Structures and Analysis of Thin Structures with Application to Vascular Images , 2008, Journal of Mathematical Imaging and Vision.

[29]  Anthony P. Reeves,et al.  Automated aorta segmentation in low-dose chest CT images , 2014, International Journal of Computer Assisted Radiology and Surgery.

[30]  Leo Grady,et al.  Semi-automatic aortic aneurysm analysis , 2007, SPIE Medical Imaging.

[31]  Badrinath Roysam,et al.  Robust 3-D Modeling of Vasculature Imagery Using Superellipsoids , 2007, IEEE Transactions on Medical Imaging.

[32]  Laurent D. Cohen,et al.  Fast extraction of minimal paths in 3D images and applications to virtual endoscopy , 2001, Medical Image Anal..

[33]  Francis K. H. Quek,et al.  A review of vessel extraction techniques and algorithms , 2004, CSUR.

[34]  Edsger W. Dijkstra,et al.  Communication with an Automatic Computer , 1959 .

[35]  R. V. Van Uitert,et al.  Subvoxel precise skeletons of volumetric data based on fast marching methods. , 2007, Medical physics.

[36]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[37]  J. Sethian,et al.  A Fast Level Set Method for Propagating Interfaces , 1995 .