Access Restriction

Author Perrott, Ronald H. ♦ Holt, Christopher M. ♦ Clint, Maurice ♦ Stewart, Alan
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
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.
Description Affiliation: Queen's Univ. of Belfast, Belfast, Northern Ireland (Holt, Christopher M.; Stewart, Alan; Clint, Maurice; Perrott, Ronald H.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 30
Issue Number 2
Page Count 5
Starting Page 156
Ending Page 160

Open content in new tab

   Open content in new tab
Source: ACM Digital Library