摘要
在对几种常用细化算法进行探讨之后,提出了利用骨架上的像素点至少在某个方向上应处于该方向对象边界的中心点处的特点,从多个方向对细化对象进行切片,并利用这些切片中心点集作为原始数据集,以快速产生对象骨架的方法。实验结果表明,本算法与基于击中-击不中方式和最大圆盘方式的算法相比,具有复杂度低,运算时间少的特点。
Since a skeleton pixel should be in the middle point of one of a pair object boundary, based on the discussion of some commonly used thinning algorithms, a fast thinning algorithm based on midpoints of multi-orientation slices was put forward. The experiment results show that this algorithm is robust and precise, and its running time is shorter than large disc-based or fit-unfit based thinning algorithm.
出处
《解放军理工大学学报（自然科学版）》
EI
2005年第5期419-423,共5页
Journal of PLA University of Science and Technology(Natural Science Edition)
关键词
图像处理
骨架
细化
多向交线中点
image processing
skleton
thinning
midpoint of multi-orientation slice
