Signal sequence detection given noisy, common background image sets.

Abstract

The optimum processing (likelihood functional) is found for a set of M images, each the sum of a member of a signal sequence due to an object to be detected and its parameters estimated, a sample function of a noise field, and a sample function of a common background field. The noise fields are independent, zero mean, white Gaussian fields, all independent of the background field. The latter is assumed to be either (1) completely unknown or of known mean and covariance functions with (2) a certain fluctuation property or (3) Gaussian. Three equivalent forms of the optimum processing are found: (1) a summation of generalized matched filterings of the images, (2) a summation of matched filtering of certain generalized differences of the images, and (3) a summation of 'estimator-correlator' type filterings. The detection performance and optimum signal/image selection under the Neyman-Pearson criterion is given, and is shown that optimum processor and signal design can completely eliminate any effect of the background on detectability.