Resource-Constrained Adaptive Search and Tracking for Sparse Dynamic Targets

This paper considers the problem of resource-constrained and noise-limited localization and estimation of dynamic targets that are sparsely distributed over a large area. We generalize an existing framework [Bashan et al, 2008] for adaptive allocation of sensing resources to the dynamic case, accounting for time-varying target behavior such as transitions to neighboring cells and varying amplitudes over a potentially long time horizon. The proposed adaptive sensing policy is driven by minimization of a modified version of the previously introduced ARAP objective function, which is a surrogate function for mean squared error within locations containing targets. We provide theoretical upper bounds on the performance of adaptive sensing policies by analyzing solutions with oracle knowledge of target locations, gaining insight into the effect of target motion and amplitude variation as well as sparsity. Exact minimization of the multi-stage objective function is infeasible, but myopic optimization yields a closed-form solution. We propose a simple non-myopic extension, the Dynamic Adaptive Resource Allocation Policy (D-ARAP), that allocates a fraction of resources for exploring all locations rather than solely exploiting the current belief state. Our numerical studies indicate that D-ARAP has the following advantages: (a) it is more robust than the myopic policy to noise, missing data, and model mismatch; (b) it performs comparably to well-known approximate dynamic programming solutions but at significantly lower computational complexity; and (c) it improves greatly upon non-adaptive uniform resource allocation in terms of estimation error and probability of detection.Comment: 49 pages, 1 table, 11 figure

Adaptive Sensing Techniques for Dynamic Target Tracking and Detection with Applications to Synthetic Aperture Radars.

This thesis studies adaptive allocation of a limited set of sensing or computational resources in order to maximize some criteria, such as detection probability, estimation accuracy, or throughput, with specific application to inference with synthetic aperture radars (SAR). Sparse scenarios are considered where the interesting element is embedded in a much larger signal space. Policies are examined that adaptively distribute the constrained resources by using observed measurements to inform the allocation at subsequent stages. This thesis studies adaptive allocation policies in three main directions. First, a framework for adaptive search for sparse targets is proposed to simultaneously detect and track moving targets. Previous work is extended to include a dynamic target model that incorporates target transitions, birth/death probabilities, and varying target amplitudes. Policies are proposed that are shown empirically to have excellent asymptotic performance in estimation error, detection probability, and robustness to model mismatch. Moreover, policies are provided with low computational complexity as compared to state-of-the-art dynamic programming solutions. Second, adaptive sensor management is studied for stable tracking of targets under different modalities. A sensor scheduling policy is proposed that guarantees that the target spatial uncertainty remains bounded. When stability conditions are met, fundamental performance limits are derived such as the maximum number of targets that can be tracked stably and the maximum spatial uncertainty of those targets. The theory is extended to the case where the system may be engaged in tasks other than tracking, such as wide area search or target classification. Lastly, these developed tools are applied to tracking targets using SAR imagery. A hierarchical Bayesian model is proposed for efficient estimation of the posterior distribution for the target and clutter states given observed SAR imagery. This model provides a unifying framework that models the physical, kinematic, and statistical properties of SAR imagery. It is shown that this method generally outperforms common algorithms for change detection. Moreover, the proposed method has the additional benefits of (a) easily incorporating additional information such as target motion models and/or correlated measurements, (b) having few tuning parameters, and (c) providing a characterization of the uncertainty in the state estimation process.PHDElectrical Engineering-SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/97931/1/newstage_1.pd

The unlikely rise of masking interferometry: leading the way with 19th century technology

The exquisite precision delivered by interferometric techniques is rapidly being applied to more and more branches of optical astronomy. One particularly successful strategy to obtain structures at the scale of the diffraction limit is Aperture Masking Interferometry, which is presently experience a golden age with implementations at a host of large telescopes around the world. This startlingly durable technique, which turns 144 years old this year, presently sets the standard for the recovery of faint companions within a few resolution elements from the core of a stellar point spread function. This invited review will give a historical introduction and overview of the modern status of the technique, the science being delivered, and prospects for new advances and applications.Comment: This is an invited review for SPIE Amsterdam in 2012. It presents a brief history of masking interferometry, and some thoughts on future progress. 11 pages, 4 figs, lots of ref