A 3D parallel shrinking algorithm

Palágyi Kálmán: A 3D parallel shrinking algorithm. In: Acta cybernetica, (15) 2. pp. 201-211. (2001)

[thumbnail of cybernetica_015_numb_002_201-211.pdf]
Cikk, tanulmány, mű

Download (1MB) | Preview


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

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2001
Volume: 15
Number: 2
ISSN: 0324-721X
Page Range: pp. 201-211
Language: English
Place of Publication: Szeged
Event Title: Conference for PhD Students in Computer Science (2.) (2000) (Szeged)
Related URLs: http://acta.bibl.u-szeged.hu/38512/
Uncontrolled Keywords: Számítástechnika, Kibernetika, Algoritmus
Additional Information: Bibliogr.: 211. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 14. 13:16
URI: http://acta.bibl.u-szeged.hu/id/eprint/12673

Actions (login required)

View Item View Item