Very fast SAR detection

Jeffrey S. Salowe

doi:10.1117/12.243204

14 June 1996 Very fast SAR detection

Jeffrey S. Salowe

Proceedings Volume 2755, Signal Processing, Sensor Fusion, and Target Recognition V; (1996) https://doi.org/10.1117/12.243204
Event: Aerospace/Defense Sensing and Controls, 1996, Orlando, FL, United States

Abstract

Given as input a large (roughly 1000 by 2000) high- resolution SAR image and a target description, the SAR automatic target recognition (ATR) problem is to locate all occurrences of the target in the image ATR algorithms are assessed by their detection probability, their false alarm probability, and their running time. We propose an algorithm with a high detection probability, a moderate false alarm probability, and a fast running time -- it completes in seconds on a conventional workstation. Such an algorithm is suitable for the first stage in a multi-stage ATR algorithm. Our main contribution is determining that template shape is the crucial factor in fast binary template matching. The methodology presented should prove useful in other situations where binary template matching is effective in detecting targets.

Citation Download Citation

Jeffrey S. Salowe "Very fast SAR detection", Proc. SPIE 2755, Signal Processing, Sensor Fusion, and Target Recognition V, (14 June 1996); https://doi.org/10.1117/12.243204

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