Share Email Print

Proceedings Paper

Very fast SAR detection
Author(s): Jeffrey S. Salowe
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 14 June 1996
PDF: 12 pages
Proc. SPIE 2755, Signal Processing, Sensor Fusion, and Target Recognition V, (14 June 1996); doi: 10.1117/12.243204
Show Author Affiliations
Jeffrey S. Salowe, QuesTech, Inc. (United States)

Published in SPIE Proceedings Vol. 2755:
Signal Processing, Sensor Fusion, and Target Recognition V
Ivan Kadar; Vibeke Libby, Editor(s)

© SPIE. Terms of Use
Back to Top