Equivalent 2D sequential and parallel thinning algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

Thinning is a frequently applied skeletonization technique: border points that satisfy certain topological and geometric constraints are deleted in iteration steps. Sequential thinning algorithms may alter just one point at a time, while parallel algorithms can delete a set of border points simultaneously. Two thinning algorithms are said to be equivalent if they can produce the same result for each input binary picture. This work shows that the existing 2D fully parallel thinning algorithm proposed by Manzanera et al. is equivalent to a topology-preserving sequential thinning algorithm with the same deletion rule.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages91-100
Number of pages10
Volume8466 LNCS
ISBN (Print)9783319071473
DOIs
Publication statusPublished - 2014
Event16th International Workshop on Combinatorial Image Analysis, IWCIA 2014 - Brno, Czech Republic
Duration: May 28 2014May 30 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8466 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other16th International Workshop on Combinatorial Image Analysis, IWCIA 2014
CountryCzech Republic
CityBrno
Period5/28/145/30/14

Fingerprint

Thinning
Skeletonization
Parallel algorithms
Geometric Constraints
Parallel Algorithms
Deletion
Topology
Binary
Iteration

Keywords

  • Digital Topology
  • Discrete Geometry
  • Equivalent Thinning Algorithms
  • Thinning

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Palágyi, K. (2014). Equivalent 2D sequential and parallel thinning algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8466 LNCS, pp. 91-100). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8466 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-07148-0_9

Equivalent 2D sequential and parallel thinning algorithms. / Palágyi, K.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8466 LNCS Springer Verlag, 2014. p. 91-100 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8466 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Palágyi, K 2014, Equivalent 2D sequential and parallel thinning algorithms. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 8466 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8466 LNCS, Springer Verlag, pp. 91-100, 16th International Workshop on Combinatorial Image Analysis, IWCIA 2014, Brno, Czech Republic, 5/28/14. https://doi.org/10.1007/978-3-319-07148-0_9
Palágyi K. Equivalent 2D sequential and parallel thinning algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8466 LNCS. Springer Verlag. 2014. p. 91-100. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-07148-0_9
Palágyi, K. / Equivalent 2D sequential and parallel thinning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8466 LNCS Springer Verlag, 2014. pp. 91-100 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1d3d1ab83c914078b4f42387c309b575,
title = "Equivalent 2D sequential and parallel thinning algorithms",
abstract = "Thinning is a frequently applied skeletonization technique: border points that satisfy certain topological and geometric constraints are deleted in iteration steps. Sequential thinning algorithms may alter just one point at a time, while parallel algorithms can delete a set of border points simultaneously. Two thinning algorithms are said to be equivalent if they can produce the same result for each input binary picture. This work shows that the existing 2D fully parallel thinning algorithm proposed by Manzanera et al. is equivalent to a topology-preserving sequential thinning algorithm with the same deletion rule.",
keywords = "Digital Topology, Discrete Geometry, Equivalent Thinning Algorithms, Thinning",
author = "K. Pal{\'a}gyi",
year = "2014",
doi = "10.1007/978-3-319-07148-0_9",
language = "English",
isbn = "9783319071473",
volume = "8466 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "91--100",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Equivalent 2D sequential and parallel thinning algorithms

AU - Palágyi, K.

PY - 2014

Y1 - 2014

N2 - Thinning is a frequently applied skeletonization technique: border points that satisfy certain topological and geometric constraints are deleted in iteration steps. Sequential thinning algorithms may alter just one point at a time, while parallel algorithms can delete a set of border points simultaneously. Two thinning algorithms are said to be equivalent if they can produce the same result for each input binary picture. This work shows that the existing 2D fully parallel thinning algorithm proposed by Manzanera et al. is equivalent to a topology-preserving sequential thinning algorithm with the same deletion rule.

AB - Thinning is a frequently applied skeletonization technique: border points that satisfy certain topological and geometric constraints are deleted in iteration steps. Sequential thinning algorithms may alter just one point at a time, while parallel algorithms can delete a set of border points simultaneously. Two thinning algorithms are said to be equivalent if they can produce the same result for each input binary picture. This work shows that the existing 2D fully parallel thinning algorithm proposed by Manzanera et al. is equivalent to a topology-preserving sequential thinning algorithm with the same deletion rule.

KW - Digital Topology

KW - Discrete Geometry

KW - Equivalent Thinning Algorithms

KW - Thinning

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

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

U2 - 10.1007/978-3-319-07148-0_9

DO - 10.1007/978-3-319-07148-0_9

M3 - Conference contribution

AN - SCOPUS:84901673995

SN - 9783319071473

VL - 8466 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 91

EP - 100

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -