
Proceedings Paper
Sufficient conditions for 3-D 6-subiteration parallel thinning algorithms to preserve connectivityFormat | Member Price | Non-Member Price |
---|---|---|
$17.00 | $21.00 |
Paper Abstract
Thinning is a process which erodes an object layer by layer until only its skeleton is left. A thinning algorithm should preserve connectivity, i.e., any object and its skeleton should maintain the same connectivity structure. In this paper, we propose sufficient conditions so that any 3D 6-subiteration parallel thinning algorithm satisfying these conditions is guaranteed to preserve connectivity.
Paper Details
Date Published: 4 January 1995
PDF: 7 pages
Proc. SPIE 2356, Vision Geometry III, (4 January 1995); doi: 10.1117/12.198622
Published in SPIE Proceedings Vol. 2356:
Vision Geometry III
Robert A. Melter; Angela Y. Wu, Editor(s)
PDF: 7 pages
Proc. SPIE 2356, Vision Geometry III, (4 January 1995); doi: 10.1117/12.198622
Show Author Affiliations
Cherng-Min Ma, MingChi Institute of Technology (Taiwan)
Published in SPIE Proceedings Vol. 2356:
Vision Geometry III
Robert A. Melter; Angela Y. Wu, Editor(s)
© SPIE. Terms of Use
