A FULLY PARALLEL 3D THINNING ALGORITHM AND ITS APPLICATIONS

Authors
Citation
Cm. Ma et M. Sonka, A FULLY PARALLEL 3D THINNING ALGORITHM AND ITS APPLICATIONS, Computer vision and image understanding, 64(3), 1996, pp. 420-433
Citations number
26
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Software Graphycs Programming
ISSN journal
10773142
Volume
64
Issue
3
Year of publication
1996
Pages
420 - 433
Database
ISI
SICI code
1077-3142(1996)64:3<420:AFP3TA>2.0.ZU;2-X
Abstract
A thinning algorithm is a connectivity preserving process which is app lied to erode an object layer by layer until only a ''skeleton'' is le ft. Generally, it is difficult to prove that a 3D parallel thinning al gorithm preserves connectivity. Sufficient conditions which can simpli fy such proofs were proposed recently in CVGIP: Image Understanding (5 9, No. 3 (1994), 328-339). One of the purposes of this paper is to pro pose a connectivity preserving fully parallel 3D thinning algorithm. T he other purpose is to show how to use the sufficient conditions to pr ove a 3D parallel thinning algorithm to be connectivity preserving. By this demonstration, a new generation of 3D parallel thinning algorith ms can be designed and proved to preserve connectivity relatively easi ly. (C) 1996 Academic Press, Inc.