Search NASA⌕ Search

Engineering topics

Foy, Bernard R

Publications and source records attributed to Foy, Bernard R.

Change detection for hyperspectral sensing in a transformed low-dimensional space

We present an approach to the problem of change in hyperspectral imagery that operates in a two-dimensional space. The coordinates in the space are related to Mahalanobis distances for the combined ('stacked') data and the individual hyperspectral scenes. Although it is only two-dimensional, this space is rich enough to include several well-known change detection algorithms, including the hyperbolic anomalous change detector, based on Gaussian scene clutter, and the EC-uncorrelated detector based on heavy-tailed (elliptically contoured) clutter. Because this space is only two-dimensional, adaptive machine learning methods can produce new change detectors without being stymied by the curse of dimensionality. We investigate, in particular, the utility of the support vector machine for learning boundaries in this 2-D space, and compare the performance of the resulting nonlinearly adaptjve detector to change detectors that have themselves shown good performance.

99 GENERAL AND MISCELLANEOUS↗

Parametric probability distributions for anomalous change detection

The problem of anomalous change detection arises when two (or possibly more) images are taken of the same scene, but at different times. The aim is to discount the 'pervasive differences' that occur thoughout the imagery, due to the inevitably different conditions under which the images were taken (caused, for instance, by differences in illumination, atmospheric conditions, sensor calibration, or misregistration), and to focus instead on the 'anomalous changes' that actually take place in the scene. In general, anomalous change detection algorithms attempt to model these normal or pervasive differences, based on data taken directly from the imagery, and then identify as anomalous those pixels for which the model does not hold. For many algorithms, these models are expressed in terms of probability distributions, and there is a class of such algorithms that assume the distributions are Gaussian. By considering a broader class of distributions, however, a new class of anomalous change detection algorithms can be developed. We consider several parametric families of such distributions, derive the associated change detection algorithms, and compare the performance with standard algorithms that are based on Gaussian distributions. We find that it is often possible to significantly outperform these standard algorithms, even using relatively simple non-Gaussian models.

97 MATHEMATICS AND COMPUTING↗