A Subiteration-Based Surface-Thinning Algorithm with a Period of Three

  • Kálmán Palágyi
Conference paper

DOI: 10.1007/978-3-540-74936-3_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4713)
Cite this paper as:
Palágyi K. (2007) A Subiteration-Based Surface-Thinning Algorithm with a Period of Three. In: Hamprecht F.A., Schnörr C., Jähne B. (eds) Pattern Recognition. DAGM 2007. Lecture Notes in Computer Science, vol 4713. Springer, Berlin, Heidelberg

Abstract

Thinning on binary images is an iterative layer by layer erosion until only the “skeletons” of the objects are left. This paper presents an efficient parallel 3D surface–thinning algorithm. A three–subiteration strategy is proposed: the thinning operation is changed from iteration to iteration with a period of three according to the three deletion directions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Kálmán Palágyi
    • 1
  1. 1.Department of Image Processing and Computer Graphics, University of SzegedHungary

Personalised recommendations