Euclidean Distance-Ordered Thinning for Skeleton Extraction
The skeleton is an important feature for the representation of a shape in image analysis. In this paper, we propose a novel Euclidean distance-ordered thinning algorithm for skeleton extraction. We first give the deletion templates which can determine a given pixel to be safely deleted or not from the pattern of its 8-neighbors. Then we delete the points which satisfy the deletion templates until there is no point that can be deleted in the linked lists of ascending order. Finally, the skeleton of the object is obtained. The experiment results show that the algorithm is able to extract the connected and onepixel wide skeleton that can correctly preserve the topology of the object. Furthermore, the extracted skeleton locates on the accurate position and it is insensitive to boundary noise.
skeleton distance-ordered thinning deletion template
Le Zhang Qing He Shin-ichi Ito Kenji Kita
Faculty of Engineer The University of Tokushima Tokushima, Japan School of Information Science and Technology Donghua University Shanghai, China Center for Advanced Information Technology The University of Tokushima Tokushima, Japan
国际会议
上海
英文
311-315
2010-06-22（万方平台首次上网日期，不代表论文的发表时间）