An order-independent sequential thinning algorithm

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

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

7 Citations (Scopus)

Abstract

Thinning is a widely used approach for skeletonization. Sequential thinning algorithms use contour tracking: they scan border points and remove the actual one if it is not designated a skeletal point. They may produce various skeletons for different visiting orders. In this paper, we present a new 2-dimensional sequential thinning algorithm, which produces the same result for arbitrary visiting orders and it is capable of extracting maximally thinned skeletons.

Original languageEnglish
Title of host publicationCombinatorial Image Analysis - 13th International Workshop, IWCIA 2009, Proceedings
Pages162-175
Number of pages14
DOIs
Publication statusPublished - Dec 1 2009
Event13th International Workshop on Combinatorial Image Analysis, IWCIA 2009 - Playa del Carmen, Mexico
Duration: Nov 24 2009Nov 27 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5852 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Workshop on Combinatorial Image Analysis, IWCIA 2009
CountryMexico
CityPlaya del Carmen
Period11/24/0911/27/09

    Fingerprint

Keywords

  • Order-independent thinning
  • Shape representation
  • Skeleton
  • Thinning
  • Topology preservation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kardos, P., Németh, G., & Palágyi, K. (2009). An order-independent sequential thinning algorithm. In Combinatorial Image Analysis - 13th International Workshop, IWCIA 2009, Proceedings (pp. 162-175). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5852 LNCS). https://doi.org/10.1007/978-3-642-10210-3_13