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...
Saved in:
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 |
Similar Items
-
A 3D directional shrinking algorithm [abstract] /
by: Palágyi Kálmán
Published: (2000) -
2D parallel thinning and shrinking based on sufficient conditions for topology preservation
by: Németh Gábor, et al.
Published: (2011) -
Topology-Preserving Equivalent Parallel and Sequential 4-Subiteration 2D Thinning Algorithms
by: Palágyi Kálmán, et al.
Published: (2015) -
Parallelization of an algorithm for the automatic detection of deformable objects
by: González-Linares J. M., et al.
Published: (2001) -
2D parallel thinning and shrinking based on sufficient conditions for topology preservation
by: Németh Gábor, et al.
Published: (2011)