Fully parallel 3D thinning algorithms based on sufficient conditions for topology preservation

K. Palágyi, Gábor Németh

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

8 Citations (Scopus)

Abstract

This paper presents a family of parallel thinning algorithms for extracting medial surfaces from 3D binary pictures. The proposed algorithms are based on sufficient conditions for 3D parallel reduction operators to preserve topology for (26,6) pictures. Hence it is self-evident that our algorithms are topology preserving. Their efficient implementation on conventional sequential computers is also presented.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages481-492
Number of pages12
Volume5810 LNCS
DOIs
Publication statusPublished - 2009
Event15th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2009 - Montreal, QC, Canada
Duration: Sep 30 2009Oct 2 2009

Publication series

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

Other

Other15th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2009
CountryCanada
CityMontreal, QC
Period9/30/0910/2/09

Fingerprint

Topology Preservation
Thinning
Topology
Sufficient Conditions
Efficient Implementation
Mathematical operators
Binary
Operator

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Palágyi, K., & Németh, G. (2009). Fully parallel 3D thinning algorithms based on sufficient conditions for topology preservation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5810 LNCS, pp. 481-492). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5810 LNCS). https://doi.org/10.1007/978-3-642-04397-0_41

Fully parallel 3D thinning algorithms based on sufficient conditions for topology preservation. / Palágyi, K.; Németh, Gábor.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5810 LNCS 2009. p. 481-492 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5810 LNCS).

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

Palágyi, K & Németh, G 2009, Fully parallel 3D thinning algorithms based on sufficient conditions for topology preservation. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5810 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5810 LNCS, pp. 481-492, 15th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2009, Montreal, QC, Canada, 9/30/09. https://doi.org/10.1007/978-3-642-04397-0_41
Palágyi K, Németh G. Fully parallel 3D thinning algorithms based on sufficient conditions for topology preservation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5810 LNCS. 2009. p. 481-492. (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-04397-0_41
Palágyi, K. ; Németh, Gábor. / Fully parallel 3D thinning algorithms based on sufficient conditions for topology preservation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5810 LNCS 2009. pp. 481-492 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{022a40d1afc946eaa2ccf4dd50e645e0,
title = "Fully parallel 3D thinning algorithms based on sufficient conditions for topology preservation",
abstract = "This paper presents a family of parallel thinning algorithms for extracting medial surfaces from 3D binary pictures. The proposed algorithms are based on sufficient conditions for 3D parallel reduction operators to preserve topology for (26,6) pictures. Hence it is self-evident that our algorithms are topology preserving. Their efficient implementation on conventional sequential computers is also presented.",
author = "K. Pal{\'a}gyi and G{\'a}bor N{\'e}meth",
year = "2009",
doi = "10.1007/978-3-642-04397-0_41",
language = "English",
isbn = "3642043968",
volume = "5810 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "481--492",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Fully parallel 3D thinning algorithms based on sufficient conditions for topology preservation

AU - Palágyi, K.

AU - Németh, Gábor

PY - 2009

Y1 - 2009

N2 - This paper presents a family of parallel thinning algorithms for extracting medial surfaces from 3D binary pictures. The proposed algorithms are based on sufficient conditions for 3D parallel reduction operators to preserve topology for (26,6) pictures. Hence it is self-evident that our algorithms are topology preserving. Their efficient implementation on conventional sequential computers is also presented.

AB - This paper presents a family of parallel thinning algorithms for extracting medial surfaces from 3D binary pictures. The proposed algorithms are based on sufficient conditions for 3D parallel reduction operators to preserve topology for (26,6) pictures. Hence it is self-evident that our algorithms are topology preserving. Their efficient implementation on conventional sequential computers is also presented.

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

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

U2 - 10.1007/978-3-642-04397-0_41

DO - 10.1007/978-3-642-04397-0_41

M3 - Conference contribution

AN - SCOPUS:77952414581

SN - 3642043968

SN - 9783642043963

VL - 5810 LNCS

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

SP - 481

EP - 492

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

ER -