1-Attempt 4-Cycle Parallel Thinning Algorithms

Kálmán Palágyi, Gábor Németh

2022

Abstract

Thinning is a frequently applied skeletonization technique. It is an iterative object-reduction in a topology-preserving way: the outmost layer of an object is deleted, and the entire process is repeated until stability is reached. In the case of an 1-attempt thinning algorithm, if a border pixel is not deleted in the very first time, it cannot be deleted in the remaining phases of the thinning process. This paper shows that two 4-cycle parallel 2D thinning algorithms (i.e., one subiteration-based and one subfield-based) are 1-attempt. In addition, we illustrate that both algorithms are considerably faster if we know that they fulfill the 1-attempt property.

Paper Citation

in Harvard Style

Palágyi K. and Németh G. (2022). 1-Attempt 4-Cycle Parallel Thinning Algorithms. In Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-549-4, pages 229-236. DOI: 10.5220/0010819700003122

in Bibtex Style

@conference{icpram22,
author={Kálmán Palágyi and Gábor Németh},
title={1-Attempt 4-Cycle Parallel Thinning Algorithms},
booktitle={Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2022},
pages={229-236},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010819700003122},
isbn={978-989-758-549-4},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - 1-Attempt 4-Cycle Parallel Thinning Algorithms
SN - 978-989-758-549-4
AU - Palágyi K.
AU - Németh G.
PY - 2022
SP - 229
EP - 236
DO - 10.5220/0010819700003122