1-Attempt 4-Cycle Parallel Thinning Algorithms

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

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

1-Attempt 4-Cycle Parallel Thinning Algorithms

Topics: Feature Selection and Extraction

In Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods ICPRAM - Volume 1, 229-236, 2022

Authors: Kálmán Palágyi and Gábor Németh

Affiliation: Department of Image Processing and Computer Graphics, University of Szeged, Szeged, Hungary

Keyword(s): Shape Representation, Skeletonization, Thinning, Digital Topology.

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.16.66.206

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

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 - ICPRAM; ISBN 978-989-758-549-4; ISSN 2184-4313, SciTePress, pages 229-236. DOI: 10.5220/0010819700003122

@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 - ICPRAM},
year={2022},
pages={229-236},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010819700003122},
isbn={978-989-758-549-4},
issn={2184-4313},
}

TY - CONF

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