Robust Centerline Extraction for Tree-like Blood Vessels based on the Region Growing Algorithm and Level-Set Method

In this paper, we present a tree-like blood vessels based on the region growing algorithm and level sets method for computing centerlines for both 2D and 3D shape analysis. Consider the tree-like vascular structure, we first use region growing technology to generate the shortest distance from the given root to all the pixels, ground on the distance can detect all the extreme nodes of branches automatically. Propagate wave-front from a point of skeleton line with the level sets, track the points of the largest curvature on the surface of the wave-front, through solute differential equations, the skeleton can be gained. The proposed method is computationally inexpensive, not only maintain the position exactly and the shape smoothly and connectedly, and less sensitive to boundary noise.

[1]  Martin Rumpf,et al.  A Continuous Skeletonization Method Based on Level Sets , 2002, VisSym.

[2]  Aly A. Farag,et al.  Robust centerline extraction framework using level sets , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[3]  I. Kakadiaris,et al.  Towards Segmentation of Irregular Tubular Structures in 3 D Confocal Microscope Images , 2006 .

[4]  Seongjai Kim,et al.  An O(N) Level Set Method for Eikonal Equations , 2000, SIAM J. Sci. Comput..

[5]  Kaleem Siddiqi,et al.  The Hamilton-Jacobi skeleton , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

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

[7]  Ron Kimmel,et al.  Fast Edge Integration , 2003 .

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