Abstract
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. © 1996 Academic Press, Inc.
Cite
CITATION STYLE
Ma, C. M., & Sonka, M. (1996). A fully parallel 3D thinning algorithm and its applications. Computer Vision and Image Understanding, 64(3), 420–433. https://doi.org/10.1006/cviu.1996.0069
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.