ACM Home Page
Please provide us with feedback. Feedback
A flexible thinning algorithm allowing parallel, sequential, and distributed application
Full text PdfPdf (647 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 18 ,  Issue 1  (March 1992) table of contents
Pages: 35 - 45  
Year of Publication: 1992
ISSN:0098-3500
Author
Jan Olszewski  University of Saarland
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 36,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/128745.128748
What is a DOI?

ABSTRACT

A parallel thinning algorithm for digital patterns is presented. This algorithm can also be used for sequential thinning without the simulation of parallel computation. The mathematical background of the algorithm bases on the notion of the Euler characteristic. The proposed algorithm is simple and particularly faster than other parallel algorithms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
GOLDBERG, S.I. Curvature and Homology. Academic Press, San Diego, Calif., 1962, 60-61.
 
3
HmDITC~, C. J. Linear skeletons from square cupboards. In Machine Intelligence IV, B. Meltzer and D. Michie, Eds., American Elsevier, New York, 1969, 403-420.
4
5
 
6
DE LOTTO, I. Un inseguitore di contorno. Alta Frequenza 32 (Oct. 1963), 703-705.
7
 
8
 
9
NEustus, C., OLSZ~WSKL J., ANn SCHEERER, D. An efficient distributed thinning algorithm. To appear in Parallel CompuL
 
10
PAVHDtS, T. Algorithms for ,Graphics and Image Processing. Springer-Verlag, New York, 1982, 195-214.
11
12



REVIEW

"Norman Stanley Scott : Reviewer"

The author purports to describe a flexible thinning algorithm for digital patterns that allows parallel, sequential, and distributed application. The mathematical basis of the algorithm is the use of the Euler characteristic of a pattern in th  more...