AN iterative model-constrained graph-cut algorithm for Abdominal Aortic Aneurysm thrombus segmentation

We present an iterative model-constrained graph-cut algorithm for the segmentation of Abdominal Aortic Aneurysm (AAA) thrombus. Given an initial segmentation of the aortic lumen, our method automatically segments the thrombus by iteratively coupling intensity-based graph min-cut segmentation and geometric parametric model fitting. The geometric model effectively constrains the graph min-cut segmentation from “leaking” to nearby veins and organs. Experimental results on 8 AAA CTA datasets yield robust segmentations of the AAA thrombus in 2 mins computer time with a mean absolute volume difference of 8.0% and mean volumetric overlap error of 12.9%, which is comparable to the interobserver error.

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

[2]  Leo Joskowicz,et al.  Vessels-Cut: A Graph Based Approach to Patient-Specific Carotid Arteries Modeling , 2009, 3DPH.

[3]  Gareth Funka-Lea,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.

[4]  S C Whitaker,et al.  Imaging of abdominal aortic aneurysm before and after endoluminal stent-graft repair. , 2001, European journal of radiology.

[5]  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.

[6]  Nassir Navab,et al.  Hybrid deformable model for aneurysm segmentation , 2009, 2009 IEEE International Symposium on Biomedical Imaging: From Nano to Macro.

[7]  Isabelle Bloch,et al.  A review of 3D vessel lumen segmentation techniques: Models, features and extraction schemes , 2009, Medical Image Anal..

[8]  Calvin R. Maurer,et al.  A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Vladimir Kolmogorov,et al.  Graph cut based image segmentation with connectivity priors , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  A. Comerota,et al.  Aortic Diameter is an Insensitive Measurement of Early Aneurysm Expansion after Endografting , 2004, Journal of endovascular therapy : an official journal of the International Society of Endovascular Specialists.

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

[12]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Gabriel Taubin,et al.  Estimation of Planar Curves, Surfaces, and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Andrew Zisserman,et al.  OBJ CUT , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[15]  Hüseyin Tek,et al.  Segmentation of carotid arteries by graph-cuts using centerline models , 2009, Medical Imaging.