Authors
C Min Ma, Milan Sonka
Publication date
1996/11/1
Journal
Computer vision and image understanding
Volume
64
Issue
3
Pages
420-433
Publisher
Academic Press
Description
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 inCVGIP: 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.
Total citations
199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023581016181513162711221513251717219161512894227
Scholar articles