Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

An iterative thinning algorithm reduces a two-dimensional pattern of strokes to its skeleton by removing layers of edge elements until each stroke has unit thickness. A parallel solution requires the independent calculation of new values for each iteration, using a window of nearest neighbors for each element. The traditional need for at least two subiterations can be avoided by modifying the window to permit the availability of intermediate calculations. Timings on an ICL DAP (an array processor) indicate an improvement of over 40 percent. Additional refinements are suggested to reduce noise in the final skeleton.

REFERENCES

• 1: Hilditch. C.J. Linear skeletons from square cupboards. In Machine lrrfrl/&erw IV, B. Meltzer and D. Michie. Eds., American Elsevier, New York, 1969.403-420.
• 2: R. Stefanelli , A. Rosenfeld, Some Parallel Thinning Algorithms for Digital Pictures, Journal of the ACM (JACM), v.18 n.2, p.255-264, April 1971 [doi>10.1145/321637.321646]
• 3: T. Y. Zhang , C. Y. Suen, A fast parallel algorithm for thinning digital patterns, Communications of the ACM, v.27 n.3, p.236-239, March 1984 [doi>10.1145/357994.358023]

INDEX TERMS

Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES

  I. Computing Methodologies
  I.5 PATTERN RECOGNITION
      I.5.2 Design Methodology
          Subjects: Pattern analysis
      I.5.4 Applications
          Subjects: Computer vision

General Terms:
Algorithms, Design, Theory