# Subfield-based Parallel Kernel-thinning Algorithms on the BCC Grid

### Gábor Karai, Péter Kardos, Kálmán Palágyi

#### 2022

#### Abstract

Kernel-thinning is a widely used technique for extracting the topological kernel from a digital object (i.e., producing a minimal structure that is topologically equivalent to the original elongated object). In this paper, two subfield-based parallel kernel-thinning algorithms acting on the non-standard body centered cubic (BCC) grid are presented. Our algorithms combine a sufficient condition for topology preservation with two types of partitionings of the BCC grid, thus both algorithms are topology-preserving. According to our best knowledge, the reported algorithms are the very first parallel thinning algorithms on the BCC grid.

Download#### Paper Citation

#### in Harvard Style

Karai G., Kardos P. and Palágyi K. (2022). **Subfield-based Parallel Kernel-thinning Algorithms on the BCC Grid**. In *Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,* ISBN 978-989-758-549-4, pages 288-295. DOI: 10.5220/0010831000003122

#### in Bibtex Style

@conference{icpram22,

author={Gábor Karai and Péter Kardos and Kálmán Palágyi},

title={Subfield-based Parallel Kernel-thinning Algorithms on the BCC Grid},

booktitle={Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},

year={2022},

pages={288-295},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0010831000003122},

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 - Subfield-based Parallel Kernel-thinning Algorithms on the BCC Grid

SN - 978-989-758-549-4

AU - Karai G.

AU - Kardos P.

AU - Palágyi K.

PY - 2022

SP - 288

EP - 295

DO - 10.5220/0010831000003122