Share Email Print

Proceedings Paper

Target matching in synthetic aperture radar imagery using a nonlinear optimization technique
Author(s): Reuven Meth; Rama Chellappa
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

Recognition of targets in synthetic aperture radar (SAR) imagery is approached from the viewpoint of an optimization problem. Features are extracted from SAR target images and are treated as point sets. The matching problem is formulated as a non-linear objective function to maximize the number of matched features and minimize the distance between features. The minimum of this function is found using a deterministic annealing process. Registration is performed iteratively by using an analytically computed minimum at each temperature of the annealing. Thus, the images do not need to be initially registered as any translational error between them is solved for as part of the optimization. We have also extended the initial objective function to incorporate multiple feature classes. This matching method is robust to spurious, missing and migrating features. Matching results are presented for simulated XPATCH and real MSTAR SAR target imagery demonstrating the utility of this approach.

Paper Details

Date Published: 13 August 1999
PDF: 11 pages
Proc. SPIE 3721, Algorithms for Synthetic Aperture Radar Imagery VI, (13 August 1999); doi: 10.1117/12.357669
Show Author Affiliations
Reuven Meth, Univ. of Maryland/College Park (United States)
Rama Chellappa, Univ. of Maryland/College Park (United States)

Published in SPIE Proceedings Vol. 3721:
Algorithms for Synthetic Aperture Radar Imagery VI
Edmund G. Zelnio, Editor(s)

© SPIE. Terms of Use
Back to Top