A geodesic voting method for the segmentation of tubular tree and centerlines

This paper presents a geodesic voting method to segment tree structures, such as cardiac or cerebral blood vessels. Many authors have used minimal cost paths, or similarly geodesics relative to a weight potential P, to find a vessel between two end points. Our goal focuses on the use of a set of such geodesic paths for finding a tubular tree structure, using minimal interaction. This work adapts the geodesic voting method that we have introduced for the segmentation of thin tree structures to the segmentation of centerlines and tubular trees. The original approach of geodesic voting consists in computing geodesics from a set of end points scattered in the image to a given source point. The target structure corresponds to image points with a high geodesic density. Since the potential takes low values on the tree structure, geodesics will locate preferably on this structure and thus the geodesic density should be high. Geodesic voting method gives a good approximation of the localization of the tree branches, but it does not allow to extract the tubular aspect of the tree. Furthermore, geodesic voting does not guarantee that the extracted tree corresponds to the centerline of the tree. Here, we introduce an explicit constraint that moves the high geodesic density to the centerline of the tree and simultaneously approximates the localization of the boundary of the tubular structure. We show results of the segmentation with this approach on 2D angiogram images. This approach can be extended to 3D images in a straight forward manner.

[1]  Anthony J. Yezzi,et al.  Vessels as 4-D Curves: Global Minimal 4-D Paths to Extract 3-D Tubular Surfaces and Centerlines , 2007, IEEE Transactions on Medical Imaging.

[2]  Marko Subasic,et al.  Level Set Methods and Fast Marching Methods , 2003 .

[3]  L. Cohen,et al.  Segmentation of 3D tubular objects with adaptive front propagation and minimal tree extraction for 3D medical imaging , 2007, Computer methods in biomechanics and biomedical engineering.

[4]  Laurent D. Cohen,et al.  3D Multi-branch Tubular Surface and Centerline Extraction with 4D Iterative Key Points , 2009, MICCAI.

[5]  Laurent D. Cohen,et al.  Global Minimum for Active Contour Models: A Minimal Path Approach , 1997, International Journal of Computer Vision.

[6]  Laurent D. Cohen,et al.  The shading zone problem in geodesic voting and its solutions for the segmentation of tree structures. Application to the segmentation of Microglia extensions , 2009, 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.

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

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

[9]  Max A. Viergever,et al.  Vessel Axis Determination Using Wave Front Propagation Analysis , 2001, MICCAI.

[10]  Alejandro F. Frangi,et al.  Model-based quantitation of 3-D magnetic resonance angiographic images , 1999, IEEE Transactions on Medical Imaging.

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

[12]  Brian B. Avants,et al.  An Adaptive Minimal Path Generation Technique for Vessel Tracking in CTA/CE-MRA Volume Images , 2000, MICCAI.

[13]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

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

[15]  Max A. Viergever,et al.  Ridge-based vessel segmentation in color images of the retina , 2004, IEEE Transactions on Medical Imaging.

[16]  Kaleem Siddiqi,et al.  Flux driven automatic centerline extraction , 2005, Medical Image Anal..

[17]  Laurent D. Cohen,et al.  Image segmentation by geodesic voting. Application to the extraction of tree structures from confocal microscope images , 2008, 2008 19th International Conference on Pattern Recognition.