Institute of Informatics
Acta Cybernetica
Past Issues
Volume 15, Number 2, 2001
A 3D parallel shrinking algorithm
# A 3D parallel shrinking algorithm

**Kálmán Palágyi**

### Abstract (in LaTeX format)

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 $3\times 3\times 3$\ matching templates. The topological correctness of the algorithm is proved for $(26,6)$\ binary pictures.

### Full text

Available electronic editions: PDF.

### DOI

DOI is not available for this article.

### BibTeX entry
`
@article{Palagyi:2001:ActaCybernetica,`

author = {K{\'a}lm{\'a}n Pal{\'a}gyi},

title = {A 3D parallel shrinking algorithm},

journal = {Acta Cybernetica},

year = {2001},

volume = {15},

pages = {201--211},

number = {2},

abstract = {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 $3\times 3\times 3$\ matching templates. The topological correctness of the algorithm is proved for $(26,6)$\ binary pictures.}

}