00953nas a2200133 4500008004100000245003800041210003600079260003300115300001200148490000700160520055500167100002300722856007400745 2001 eng d00aA 3D parallel shrinking algorithm0 a3D parallel shrinking algorithm aSzegedbUniversity of Szeged a201-2110 v153 a

Shrinking is a frequently used preprocessing step in image processing. This paper presents an efficient 3D parallel shrinking algorithm for transforming a binary object into its topological kernel. The applied strategy is called directional: each iteration step is composed of six subiterations each of which can be executed in parallel. The algorithm makes easy implementation possible, since deletable points are given by 3x3x3 matching templates. The topological correctness of the algorithm is proved for (26,6) binary pictures.

1 aPalágyi, Kálmán uhttps://www.inf.szte.hu/publication/a-3d-parallel-shrinking-algorithm