Share Email Print

Proceedings Paper

Efficient implementation of an expectation-maximization algorithm for imaging diffuse radar targets
Author(s): Aaron D. Lanterman
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We explore a statistical view of radar imaging in which target reflectances are realizations of an underlying random process. For diffuse targets, this process is zero-mean complex Gaussian. The data consists of a realization of this process, observed through a linear transformation, and corrupted by additive noise. Image formation corresponds to estimating the elements of a diagonal covariance matrix. In general, maximum-likelihood estimates of these parameters cannot be computed in closed form. Snyder, O'Sullivan, and Miller proposed an expectation-maximization algorithm for computing these estimates iteratively. Straightforward implementations of the algorithm involve multiplication and inversion operations on extremely large matrices, which makes them computationally prohibitive. We present an implementation which exploits Strassen's recursive strategy for matrix multiplication and inversion, which may make the algorithm feasible for image sizes of interest in high-resolution radar applications.

Paper Details

Date Published: 27 August 2001
PDF: 11 pages
Proc. SPIE 4382, Algorithms for Synthetic Aperture Radar Imagery VIII, (27 August 2001); doi: 10.1117/12.438238
Show Author Affiliations
Aaron D. Lanterman, Univ. of Illinois/Urbana-Champaign (United States)

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

© SPIE. Terms of Use
Back to Top