The aim of the edge thinning process is to remove the inherent edge broadness in gradient images while retaining edge continuity of the image. Such a process is required so that useful silhouette of the target can be generated for target classification purposes. This paper compares the results from three candidate edge thinning algorithms: nonmaximum suppression technique by D. Miligram and A. Rosenfeld, modified USC thinning algorithm, and Reeves' algorithm. The results are compared subjectively and in terms of the number of computations required for their implementation.
Comparative study of edge-thinning algorithms for target identification
Vergleichende Studie von Algorithmen zur Kantenausduennung bei der Zielerkennung
1982
10 Seiten, 10 Bilder, 1 Tabelle, 9 Quellen
Aufsatz (Konferenz)
Englisch
Fast Fully Parallel Thinning Algorithms
British Library Online Contents | 1992
|A CONTOUR APPROACH TO THINNING ALGORITHMS
British Library Online Contents | 2009
|Connectivity Preservation of 3D 6-Subiteration Thinning Algorithms
British Library Online Contents | 1996
|Digitally Continuous Multivalued Functions, Morphological Operations and Thinning Algorithms
British Library Online Contents | 2012
|Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels
British Library Online Contents | 2008
|