A FAST PARALLEL ALGORITHM FOR THINNING DIGITAL PATTERNS
A FAST PARALLEL ALGORITHM FOR THINNING DIGITAL PATTERNS
复制标题
DOI：
10.1145/357994.358023
复制
发表时间：
1984-01-01
影响因子：
22.7
通讯作者：
SUEN, CY
中科院分区：
文献类型：
--
作者：
ZHANG, TY;SUEN, CY
提出了一种快速并行细化算法。它包括两个子迭代：一个旨在删除东南边界点和西北角点，另一个旨在删除西北边界点和东南角点。保留端点和像素连接。每个图案被减薄到单一厚度的”骨架”。实验结果表明，该方法是非常有效的。
A fast parallel thinning algorithm is proposed in this paper. It consists of two subiterations: one aimed at deleting the south-east boundary points and the north-west corner points while the other one is aimed at deleting the north-west boundary points and the south-east corner points. End points and pixel connectivity are preserved. Each pattern is thinned down to a" skeleton" of unitary thickness. Experimental results show that this method is very effective.