A 3D parallel shrinking algorithm

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...

Full description

Saved in:
Bibliographic Details
Main Author: Palágyi Kálmán
Corporate Author: Conference for PhD Students in Computer Science (2.) (2000) (Szeged)
Format: Article
Published: 2001
Series:Acta cybernetica 15 No. 2
Kulcsszavak:Számítástechnika, Kibernetika, Algoritmus
Subjects:
Online Access:http://acta.bibl.u-szeged.hu/12673
Description
Summary: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.
Physical Description:201-211
ISSN:0324-721X