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

Original language | English |
---|---|

Pages (from-to) | 201-211 |

Number of pages | 11 |

Journal | Acta Cybernetica |

Volume | 15 |

Issue number | 2 |

Publication status | Published - 2001 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture
- Software
- Computational Theory and Mathematics
- Theoretical Computer Science

### Cite this

**A 3D parallel shrinking algorithm.** / Palágyi, K.

Research output: Contribution to journal › Article

*Acta Cybernetica*, vol. 15, no. 2, pp. 201-211.

}

TY - JOUR

T1 - A 3D parallel shrinking algorithm

AU - Palágyi, K.

PY - 2001

Y1 - 2001

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

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

UR - http://www.scopus.com/inward/record.url?scp=0035193719&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035193719&partnerID=8YFLogxK

M3 - Article

VL - 15

SP - 201

EP - 211

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 2

ER -