Optics and Precision Engineering, Volume. 17, Issue 10, 2528(2009)
Parallel 3D skeletonization algorithm based on sort ascending rechecking
In order to accurately and efficiently extract skeletons from 3D images, a new parallel 3D skeletonization algorithm is proposed. The distances of original images are firstly transformed, and then iterative parallel thinning is performed. Each iteration is divided into 6 sub iterations, one sub iteration is used to process a kind of boundary points,and the foreground points satisfying the primary selection rule are labeled. After 6 sub iterations are completed, labeled points are rechecked in an ascending distance order,and those who satisfy thinning conditions are deleted. This process is repeated until there is no point deleted. This algorithm is applied to 2D and 3D images, obtained skeletons are consistent with that by the visual apperception. This algorithm guarantees the connectivity and topology of extracted skeletons, and its median can be validated by caculating the distance values of skeleton points,which reflects the essence characteristics of the object.
Get Citation
Copy Citation Text
TENG Qi-zhi, KANG Xia, TANG Tang, HE Xiao-hai. Parallel 3D skeletonization algorithm based on sort ascending rechecking[J]. Optics and Precision Engineering, 2009, 17(10): 2528
Category:
Received: Sep. 24, 2008
Accepted: --
Published Online: Aug. 31, 2010
The Author Email: Qi-zhi TENG (nic5602@scu.edu.cn)
CSTR:32186.14.