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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Comparative study of edge-thinning algorithms for target identification


    Additional title:

    Vergleichende Studie von Algorithmen zur Kantenausduennung bei der Zielerkennung


    Contributors:
    Keshavan, H.R. (author) / Lo, C.M. (author)


    Publication date :

    1982


    Size :

    10 Seiten, 10 Bilder, 1 Tabelle, 9 Quellen


    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    Fast Fully Parallel Thinning Algorithms

    Guo, Z. / Hall, R. W. | British Library Online Contents | 1992


    A CONTOUR APPROACH TO THINNING ALGORITHMS

    Tarabek, P. | British Library Online Contents | 2009


    Connectivity Preservation of 3D 6-Subiteration Thinning Algorithms

    Min Ma, C. | British Library Online Contents | 1996



    Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels

    Bertrand, G. | British Library Online Contents | 2008