A 3D 3-subiteration thinning algorithm for medial surfaces

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

4 Citations (Scopus)

Abstract

Thinning on a binary picture is an iterative layer by layer erosion to extract a reasonable approximation to its skeleton. This paper presents an efficient 3D parallel thinning algorithm which produces medial surfaces. Three-subiteration directional strategy is proposed: each iteration step is composed of three parallel subiterations according to the three deletion directions. The algorithm makes easy implementation possible, since deletable points are given by matching templates containing twenty eight elements. The topological correctness of the algorithm for (26, 6) binary pictures is proved.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages406-418
Number of pages13
Volume1953 LNCS
Publication statusPublished - 2000
Event9th International Conference on Discrete Geometry for Computer Imagery, DGCI 2000 - Uppsala, Sweden
Duration: Dec 13 2000Dec 15 2000

Publication series

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

Other

Other9th International Conference on Discrete Geometry for Computer Imagery, DGCI 2000
CountrySweden
CityUppsala
Period12/13/0012/15/00

Fingerprint

Thinning
Binary
Template matching
Template Matching
Erosion
Skeleton
Deletion
Correctness
Iteration
Approximation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Palágyi, K. (2000). A 3D 3-subiteration thinning algorithm for medial surfaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1953 LNCS, pp. 406-418). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1953 LNCS).

A 3D 3-subiteration thinning algorithm for medial surfaces. / Palágyi, K.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1953 LNCS 2000. p. 406-418 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1953 LNCS).

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

Palágyi, K 2000, A 3D 3-subiteration thinning algorithm for medial surfaces. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1953 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1953 LNCS, pp. 406-418, 9th International Conference on Discrete Geometry for Computer Imagery, DGCI 2000, Uppsala, Sweden, 12/13/00.
Palágyi K. A 3D 3-subiteration thinning algorithm for medial surfaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1953 LNCS. 2000. p. 406-418. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Palágyi, K. / A 3D 3-subiteration thinning algorithm for medial surfaces. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1953 LNCS 2000. pp. 406-418 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2c4b53f976e14c5bad9acb880006603a,
title = "A 3D 3-subiteration thinning algorithm for medial surfaces",
abstract = "Thinning on a binary picture is an iterative layer by layer erosion to extract a reasonable approximation to its skeleton. This paper presents an efficient 3D parallel thinning algorithm which produces medial surfaces. Three-subiteration directional strategy is proposed: each iteration step is composed of three parallel subiterations according to the three deletion directions. The algorithm makes easy implementation possible, since deletable points are given by matching templates containing twenty eight elements. The topological correctness of the algorithm for (26, 6) binary pictures is proved.",
author = "K. Pal{\'a}gyi",
year = "2000",
language = "English",
isbn = "3540413960",
volume = "1953 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "406--418",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A 3D 3-subiteration thinning algorithm for medial surfaces

AU - Palágyi, K.

PY - 2000

Y1 - 2000

N2 - Thinning on a binary picture is an iterative layer by layer erosion to extract a reasonable approximation to its skeleton. This paper presents an efficient 3D parallel thinning algorithm which produces medial surfaces. Three-subiteration directional strategy is proposed: each iteration step is composed of three parallel subiterations according to the three deletion directions. The algorithm makes easy implementation possible, since deletable points are given by matching templates containing twenty eight elements. The topological correctness of the algorithm for (26, 6) binary pictures is proved.

AB - Thinning on a binary picture is an iterative layer by layer erosion to extract a reasonable approximation to its skeleton. This paper presents an efficient 3D parallel thinning algorithm which produces medial surfaces. Three-subiteration directional strategy is proposed: each iteration step is composed of three parallel subiterations according to the three deletion directions. The algorithm makes easy implementation possible, since deletable points are given by matching templates containing twenty eight elements. The topological correctness of the algorithm for (26, 6) binary pictures is proved.

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

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

M3 - Conference contribution

AN - SCOPUS:84884612359

SN - 3540413960

SN - 9783540413967

VL - 1953 LNCS

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

SP - 406

EP - 418

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

ER -