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...
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
2001
|
| Sorozat: | Acta cybernetica
15 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Algoritmus |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12673 |
| LEADER | 01362nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12673 | ||
| 005 | 20220614131648.0 | ||
| 008 | 161015s2001 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Palágyi Kálmán | |
| 245 | 1 | 2 | |a A 3D parallel shrinking algorithm |h [elektronikus dokumentum] / |c Palágyi Kálmán |
| 260 | |c 2001 | ||
| 300 | |a 201-211 | ||
| 490 | 0 | |a Acta cybernetica |v 15 No. 2 | |
| 520 | 3 | |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 3 x 3 x 3 matching templates. The topological correctness of the algorithm is proved for (26,6) binary pictures. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika, Algoritmus | ||
| 710 | |a Conference for PhD Students in Computer Science (2.) (2000) (Szeged) | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12673/1/cybernetica_015_numb_002_201-211.pdf |z Dokumentum-elérés |