Comparative Study Of Edge-Thinning Algorithms For Target Identification

H. Kesh R. Keshavan; Chun Moo Lo

doi:10.1117/12.932627

8 March 1982 Comparative Study Of Edge-Thinning Algorithms For Target Identification

H. Kesh R. Keshavan, Chun Moo Lo

Proceedings Volume 0302, Infrared Technology for Target Detection and Classification; (1982) https://doi.org/10.1117/12.932627
Event: 25th Annual Technical Symposium, 1981, San Diego, United States

Abstract

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 a useful silhouette of the target can be generated for target classification purposes. This paper compares the results from three candidate edge thinning algorithms: nonmaximum sup-pression 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.*

Citation Download Citation

H. Kesh R. Keshavan and Chun Moo Lo "Comparative Study Of Edge-Thinning Algorithms For Target Identification", Proc. SPIE 0302, Infrared Technology for Target Detection and Classification, (8 March 1982); https://doi.org/10.1117/12.932627

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available