A 3D parallel shrinking algorithm

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)201-211
Number of pages11
JournalActa Cybernetica
Volume15
Issue number2
Publication statusPublished - 2001

Fingerprint

Shrinking
Binary
Template matching
Template Matching
Preprocessing
Image Processing
Correctness
Image processing
kernel
Iteration

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.

In: Acta Cybernetica, Vol. 15, No. 2, 2001, p. 201-211.

Research output: Contribution to journalArticle

Palágyi, K 2001, 'A 3D parallel shrinking algorithm', Acta Cybernetica, vol. 15, no. 2, pp. 201-211.
Palágyi, K. / A 3D parallel shrinking algorithm. In: Acta Cybernetica. 2001 ; Vol. 15, No. 2. pp. 201-211.
@article{023f385e7b694a5ebb9de187cbef510c,
title = "A 3D parallel shrinking algorithm",
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.",
author = "K. Pal{\'a}gyi",
year = "2001",
language = "English",
volume = "15",
pages = "201--211",
journal = "Acta Cybernetica",
issn = "0324-721X",
publisher = "University of Szeged",
number = "2",

}

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 -