Search

Hyperspectral change detection (HSCD) provides an avenue for detecting subtle targets in complex backgrounds. Complicating the problem of change detection is the presence of shadow, illumination, and atmospheric differences, as well as misregistration and parallax error, which often produce the appearance of change. Recent development of a model-based (MB) approach to HSCD has demonstrated potential improvement for mitigating false alarms due specifically to shadow differences using calibrated data. Further development and application of the MB approach is provided here. The method is extended for use on both uncalibrated and relatively calibrated hyperspectral data and is applied to airborne hyperspectral imagery collected using the Hyperspectral Digital Imagery Collection Experiment visible to short-wave infrared sensor and uncalibrated tower imagery collected by the Air Force Research Laboratory. [ABSTRACT FROM PUBLISHER]

We propose a model for generating low-frequency synthetic aperture radar (SAR) clutter that relates model parameters to physical characteristics of the scene. The model includes both distributed scattering and large-amplitude discrete clutter responses. The model also incorporates the SAR imaging process, which introduces correlation among image pixels. The model may be used to generate synthetic clutter for a range of environmental operating conditions for use in target detection performance evaluation of the radar and automatic target detection/recognition algorithms. We derive a statistical representation of the proposed clutter model's pixel amplitudes and compare with measured data from the CARABAS.II SAR. Simulated clutter images capture the structure and amplitude responses seen in the measured data. A statistical analysis shows an order of magnitude improvement in model fit error compared with standard maximum-likelihood (ML) density fitting methods. [ABSTRACT FROM AUTHOR]

This paper discusses the effect of motion measurement errors (MMEs) on measured bistatic synthetic aperture radar (SAR) phase history data that has been motion compensated to the scene origin. We characterize the effect of low-frequency MMEs on bistatic SAR images, and, based on this characterization, we derive limits on the allowable MMEs to be used as system specifications. Finally, we demonstrate that proper orientation of a bistatic SAR image during the image formation process allows application of monostatic SAR autofocus algorithms in postprocessing to mitigate image defocus. [ABSTRACT FROM AUTHOR]

Ad hoc localization of wireless sensor nodes is a fundamental problem in wireless sensor networks. Despite the recent proposals for the development of ad hoc localization algorithms, the fundamental behavior in systems using measurements has not been characterized. In this paper, we take a first step toward such a characterization by examining the behavior of error inducing parameters in multihop localization systems in an algorithm independent manner. We first derive the Cramé Rao Bound for Gaussian measurement error for multihop localization systems using distance and angular measurements. Later on, we use these bounds on a carefully controlled set of scenarios to study the trends in the error induced by the measurement technology accuracy, network density, beacon node concentration, and beacon uncertainty. By exposing these trends, the goal of this paper is to develop a fundamental understanding of the error behavior that can provide a set of guidelines to be considered during the design and deployment of multihop localization systems. [ABSTRACT FROM AUTHOR]

Automatic self-localization is a critical need for the effective use of ad hoc sensor networks in military or civilian applications. In general, self-localization involves the combination of absolute location information (e.g., from a global positioning system) with relative calibration information (e.g., distance measurements between sensors) over regions of the network. Furthermore, it is generally desirable to distribute the computational burden across the network and minimize the amount of intersensor communication. We demonstrate that the information used for sensor localization is fundamentally local with regard to the network topology and use this observation to reformulate the problem within a graphical model framework. We then present and demonstrate the utility of nonparametric belief propagation (NBP), a recent generalization of particle filtering, for both estimating sensor locations and representing location uncertainties. NBP has the advantage that it is easily implemented in a distributed fashion, admits a wide variety of statistical models, and can represent multimodal uncertainty. Using simulations of small to moderately sized sensor networks, we show that NBP may be made robust to outlier measurement errors by a simple model augmentation, and that judicious message construction can result in better estimates. Furthermore, we provide an analysis of NBP's communications requirements, showing that typically only a few messages per sensor are required, and that even low bit-rate approximations of these messages can be used with little or no performance impact. [ABSTRACT FROM AUTHOR]

The polar format algorithm (PFA) for spotlight synthetic aperture radar (SAR) is based on a linear approximation for the differential range to a scatterer. We derive a second-order Taylor series approximation of the differential range. We provide a simple and concise derivation of both the far-field linear approximation of the differential range, which forms the basis of the PFA, and the corresponding approximation limits based on the second-order terms of the approximation. [ABSTRACT FROM AUTHOR]

Matched filtering (MIF) of phase history data is a mathematically ideal but computationally expensive approach to bistatic synthetic aperture radar (SAR) image formation. Fast backprojection algorithms (BPAs) for image formation have recently been shown to give improved O(N2 log2 N) performance. In this paper, an O(N2 log2 N) bistatic polar format algorithm (PFA) based on a bistatic far-field assumption is derived. This algorithm is a generalization of the popular PFA for monostatic SAR image formation and is highly amenable to implementation with existing monostatic image formation processors. Limits on the size of an imaged scene, analogous to those in monostatic systems, are derived for the bistatic PFA. [ABSTRACT FROM AUTHOR]

We consider the effect of unknown signal propagation velocity on direction-of-arrival (DOA) estimation performance using an array of sensors. For general arrays, the DOA estimation variance, as measured by the Cramér-Rao bound (CRB), degrades when the propagation velocity is unknown. In this letter, we show that for both two- and three-dimensional arrays, the CRB on the DOA angle is independent of whether or not the propagation velocity is known if and only if the sensor locations satisfy the isotropy conditions given in earlier work. The results hold for both narrowband and wideband signals. [ABSTRACT FROM AUTHOR]