Share Email Print

Proceedings Paper

Sparse reconstruction for radar
Author(s): Lee C Potter; Philip Schniter; Justin Ziniel
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Imaging is not itself a system goal, but is rather a means to support inference tasks. For data processing with linearized signal models, we seek to report all high-probability interpretations of the data and to report confidence labels in the form of posterior probabilities. A low-complexity recursive procedure is presented for Bayesian estimation in linear regression models. A Gaussian mixture is chosen as the prior on the unknown parameter vector. The algorithm returns both a set of high posterior probability mixing parameters and an approximate minimum mean squared error (MMSE) estimate of the parameter vector. Emphasis is given to the case of a sparse parameter vector. Numerical simulations demonstrate estimation performance and illustrate the distinctions between MMSE estimation and maximum a posteriori probability (MAP) model selection. The proposed tree-search algorithm provides exact ratios of posterior probabilities for a set of high probability solutions to the sparse reconstruction problem. These relative probabilities serve to reveal potential ambiguity among multiple candidate solutions that are ambiguous due to low signal-to-noise ratio and/or significant correlation among columns in the super-resolving regressor matrix.

Paper Details

Date Published: 4 April 2008
PDF: 15 pages
Proc. SPIE 6970, Algorithms for Synthetic Aperture Radar Imagery XV, 697003 (4 April 2008); doi: 10.1117/12.786286
Show Author Affiliations
Lee C Potter, The Ohio State Univ. (United States)
Philip Schniter, The Ohio State Univ. (United States)
Justin Ziniel, The Ohio State Univ. (United States)

Published in SPIE Proceedings Vol. 6970:
Algorithms for Synthetic Aperture Radar Imagery XV
Edmund G. Zelnio; Frederick D. Garber, Editor(s)

© SPIE. Terms of Use
Back to Top