A family of topology-preserving 3d parallel 6-subiteration thinning algorithms

Gábor Németh, Péter Kardos, K. Palágyi

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

4 Citations (Scopus)

Abstract

Thinning is an iterative layer-by-layer erosion until only the skeleton-like shape features of the objects are left. This paper presents a family of new 3D parallel thinning algorithms that are based on our new sufficient conditions for 3D parallel reduction operators to preserve topology. The strategy which is used is called subiteration-based: each iteration step is composed of six parallel reduction operators according to the six main directions in 3D. The major contributions of this paper are: 1) Some new sufficient conditions for topology preserving parallel reductions are introduced. 2) A new 6-subiteration thinning scheme is proposed. Its topological correctness is guaranteed, since its deletion rules are derived from our sufficient conditions for topology preservation. 3) The proposed thinning scheme with different characterizations of endpoints yields various new algorithms for extracting centerlines and medial surfaces from 3D binary pictures.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages17-30
Number of pages14
Volume6636 LNCS
DOIs
Publication statusPublished - 2011
Event14th International Workshop on Combinatorial Image Analysis, IWCIA 2011 - Madrid, Spain
Duration: May 23 2011May 25 2011

Publication series

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

Other

Other14th International Workshop on Combinatorial Image Analysis, IWCIA 2011
CountrySpain
CityMadrid
Period5/23/115/25/11

Fingerprint

Thinning
Topology
Sufficient Conditions
Topology Preservation
Shape Feature
Mathematical operators
Erosion
Operator
Skeleton
Deletion
Correctness
Binary
Iteration
Family

Keywords

  • shape representation
  • skeletonization
  • thinning
  • topology preservation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Németh, G., Kardos, P., & Palágyi, K. (2011). A family of topology-preserving 3d parallel 6-subiteration thinning algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6636 LNCS, pp. 17-30). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6636 LNCS). https://doi.org/10.1007/978-3-642-21073-0_5

A family of topology-preserving 3d parallel 6-subiteration thinning algorithms. / Németh, Gábor; Kardos, Péter; Palágyi, K.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6636 LNCS 2011. p. 17-30 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6636 LNCS).

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

Németh, G, Kardos, P & Palágyi, K 2011, A family of topology-preserving 3d parallel 6-subiteration thinning algorithms. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6636 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6636 LNCS, pp. 17-30, 14th International Workshop on Combinatorial Image Analysis, IWCIA 2011, Madrid, Spain, 5/23/11. https://doi.org/10.1007/978-3-642-21073-0_5
Németh G, Kardos P, Palágyi K. A family of topology-preserving 3d parallel 6-subiteration thinning algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6636 LNCS. 2011. p. 17-30. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-21073-0_5
Németh, Gábor ; Kardos, Péter ; Palágyi, K. / A family of topology-preserving 3d parallel 6-subiteration thinning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6636 LNCS 2011. pp. 17-30 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9908bf2148124c47bddf2ede0577e84e,
title = "A family of topology-preserving 3d parallel 6-subiteration thinning algorithms",
abstract = "Thinning is an iterative layer-by-layer erosion until only the skeleton-like shape features of the objects are left. This paper presents a family of new 3D parallel thinning algorithms that are based on our new sufficient conditions for 3D parallel reduction operators to preserve topology. The strategy which is used is called subiteration-based: each iteration step is composed of six parallel reduction operators according to the six main directions in 3D. The major contributions of this paper are: 1) Some new sufficient conditions for topology preserving parallel reductions are introduced. 2) A new 6-subiteration thinning scheme is proposed. Its topological correctness is guaranteed, since its deletion rules are derived from our sufficient conditions for topology preservation. 3) The proposed thinning scheme with different characterizations of endpoints yields various new algorithms for extracting centerlines and medial surfaces from 3D binary pictures.",
keywords = "shape representation, skeletonization, thinning, topology preservation",
author = "G{\'a}bor N{\'e}meth and P{\'e}ter Kardos and K. Pal{\'a}gyi",
year = "2011",
doi = "10.1007/978-3-642-21073-0_5",
language = "English",
isbn = "9783642210723",
volume = "6636 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "17--30",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A family of topology-preserving 3d parallel 6-subiteration thinning algorithms

AU - Németh, Gábor

AU - Kardos, Péter

AU - Palágyi, K.

PY - 2011

Y1 - 2011

N2 - Thinning is an iterative layer-by-layer erosion until only the skeleton-like shape features of the objects are left. This paper presents a family of new 3D parallel thinning algorithms that are based on our new sufficient conditions for 3D parallel reduction operators to preserve topology. The strategy which is used is called subiteration-based: each iteration step is composed of six parallel reduction operators according to the six main directions in 3D. The major contributions of this paper are: 1) Some new sufficient conditions for topology preserving parallel reductions are introduced. 2) A new 6-subiteration thinning scheme is proposed. Its topological correctness is guaranteed, since its deletion rules are derived from our sufficient conditions for topology preservation. 3) The proposed thinning scheme with different characterizations of endpoints yields various new algorithms for extracting centerlines and medial surfaces from 3D binary pictures.

AB - Thinning is an iterative layer-by-layer erosion until only the skeleton-like shape features of the objects are left. This paper presents a family of new 3D parallel thinning algorithms that are based on our new sufficient conditions for 3D parallel reduction operators to preserve topology. The strategy which is used is called subiteration-based: each iteration step is composed of six parallel reduction operators according to the six main directions in 3D. The major contributions of this paper are: 1) Some new sufficient conditions for topology preserving parallel reductions are introduced. 2) A new 6-subiteration thinning scheme is proposed. Its topological correctness is guaranteed, since its deletion rules are derived from our sufficient conditions for topology preservation. 3) The proposed thinning scheme with different characterizations of endpoints yields various new algorithms for extracting centerlines and medial surfaces from 3D binary pictures.

KW - shape representation

KW - skeletonization

KW - thinning

KW - topology preservation

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

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

U2 - 10.1007/978-3-642-21073-0_5

DO - 10.1007/978-3-642-21073-0_5

M3 - Conference contribution

AN - SCOPUS:79957651399

SN - 9783642210723

VL - 6636 LNCS

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

SP - 17

EP - 30

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

ER -