Affordable Access

Publisher Website

A thinning algorithm for discrete binary images

Authors
Journal
Computer Graphics and Image Processing
0146-664X
Publisher
Elsevier
Publication Date
Volume
13
Issue
2
Identifiers
DOI: 10.1016/s0146-664x(80)80037-2
Disciplines
  • Computer Science

Abstract

The paper discusses thinning algorithms and introduces a characterization of skeletal pixels in terms of how many arcs of the boundary pass through a pixel. A new algorithm is proposed which proceeds by peeling off successive contours of the set to be thinned while identifying pixels where disjoint parts of the boundary have been mapped. The union of these pixels (plus a few others with similar properties) forms the skeleton. The algorithm can be implemented in such a way as to have time complexity which is a linear function of the area.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Fast thinning algorithm for binary images

on Image and Vision Computing Jan 01, 1985

Parallel Thinning Algorithms on 3D (18, 6) Binary...

on Computer Vision and Image Unde... Jan 01, 2000

A new one-pass parallel thinning algorithm for bin...

on Pattern Recognition Letters Jan 01, 1992

Two symmetrical thinning algorithms for 3D binary...

on Pattern Recognition Jan 01, 2007
More articles like this..