A fully parallel 3D thinning algorithm and its applications
A fully parallel 3D thinning algorithm and its applications
复制标题
DOI：
10.1006/cviu.1996.0069
复制
发表时间：
1996-11-01
影响因子：
4.5
通讯作者：
Sonka, M
中科院分区：
文献类型：
--
作者：
Ma, CM;Sonka, M
细化算法是一种保持连通性的过程，用于逐层腐蚀对象，直到只剩下“骨架”。通常，很难证明3D并行细化算法保持连通性。最近在CVGIP：Image Understanding（59，No.3（1994），328-339）中提出了可以简化这种证明的充分条件。本文的目的之一是提出一种保持连通性的全并行三维细化算法。另一个目的是展示如何使用充分条件来证明一个三维并行细化算法是保持连通性的。通过这种演示，可以设计新一代的三维并行细化算法，并证明保持连接相对容易。(C)出版社：Academic Press，Inc.
A thinning algorithm is a connectivity preserving process which is applied to erode an object layer by layer until only a ''skeleton'' is left. Generally, it is difficult to prove that a 3D parallel thinning algorithm preserves connectivity. Sufficient conditions which can simplify such proofs were proposed recently in CVGIP: Image Understanding (59, No. 3 (1994), 328-339). One of the purposes of this paper is to propose a connectivity preserving fully parallel 3D thinning algorithm. The other purpose is to show how to use the sufficient conditions to prove a 3D parallel thinning algorithm to be connectivity preserving. By this demonstration, a new generation of 3D parallel thinning algorithms can be designed and proved to preserve connectivity relatively easily. (C) 1996 Academic Press, Inc.