A parallel algorithm for decomposition of binary objects through skeletonization

https://doi.org/10.1016/0167-8655(91)90037-MGet rights and content

Abstract

A simple decomposition technique is proposed for binary objects. First a certain skeleton of a binary object is found and then the skeleton is decomposed into connected components. Finally a simple object part is reconstructed from each such skeletal component. The algorithms proposed for skeletonization and reconstruction are parallelizable.

References (3)

  • T. Pavlidis

    Structural Pattern Recognition

    (1977)
There are more references available in the full text version of this article.

Cited by (6)

  • Appendix: Digital topology - A brief introduction and bibliography

    1996, Machine Intelligence and Pattern Recognition
  • Hierarchic Voronoi skeletons

    1995, Pattern Recognition
  • Image analysis and computer vision: 1991

    1992, CVGIP: Image Understanding
  • Digital Geometry: Geometric Methods for Digital Picture Analysis

    2004, Digital Geometry: Geometric Methods for Digital Picture Analysis
View full text