A Parallel 3D 12-Subiteration Thinning Algorithm

✍ Scribed by Kálmán Palágyi; Attila Kuba

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 414 KB
• Volume: 61
• Category: Article
• ISSN: 1077-3169
• DOI: 10.1006/gmip.1999.0498

✦ Synopsis

Thinning on binary images is an iterative layer by layer erosion until only the "skeletons" of the objects are left. This paper presents an efficient parallel thinning algorithm which produces either curve skeletons or surface skeletons from 3D binary objects. It is important that a curve skeleton is extracted directly (i.e., without creating a surface skeleton). The strategy which is used is called directional: each iteration step is composed of a number of subiterations each of which can be executed in parallel. One iteration step of the proposed algorithm contains 12 subiterations instead of the usual six. The algorithm makes easy implementation possible, since deletable points are given by 3 × 3 × 3 matching templates. The topological correctness for (26, 6) binary pictures is proved.