Thinning Algorithms for Grayscale Pictures

Abstract

Elongated black objects in black-and-white pictures can be 'thinned' to arcs and curves, without changing their connectedness, by (repeatedly) deleting black border points whose deletion does not locally disconnect the black points in their neighborhoods. This technique generalizes to two points are 'connected' if there is a path joining them on wwhich no point is lighter than either of them. It is then possible to 'thin' dark objects by changing each point's gray level to the minimum of its neighbors' gray levels, provided this does not disconnect any pair of points in its neighborhood. Examples illustrating the performance of this technique are given.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1977
Accession Number
ADA049587

Entities

People

  • Azriel Rosenfeld
  • Charles R. Dyer

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Biological Sciences
  • Classification
  • Computer Science
  • Computers
  • Contracts
  • Detectors
  • Image Processing
  • Iterations
  • Maryland
  • Night Vision
  • Pattern Recognition
  • Psychological Phenomena And Processes
  • Security
  • Three Dimensional
  • Universities

Readers

  • Computer Vision.
  • Graph Algorithms and Convex Optimization.