Dynamic Programming Solution for Detecting Dim Moving Targets Part II: Analysis

1 November 1987

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems

Vol. AES-23 (6) , 776-788
https://doi.org/10.1109/taes.1987.310914

Abstract

An on-board mosaic sensor is staring down from a satellite to afixed point on the ground while collecting frames that contain targetsignatures and background noise. A dynamic programmingalgorithm (DPA) has been developed to optimally detect dim movingtargets that cross the sensor's field of view. The algorithm has beendescribed in Part I of this paper. Here, in Part II, we analyze thealgorithm performance and compare it with that of a simpleassembling of thresholded frames; the DPA's SNR performance isshown to be at least an order of magnitude better.

Keywords

This publication has 12 references indexed in Scilit:

On the distribution of the maximum of bivariate normal random variables with general means and variances
Communications in Statistics - Theory and Methods, 1986
Detection and estimation of frequency-random signals (Corresp.)
IEEE Transactions on Information Theory, 1982
Aspects of dynamic programming in signal and image processing
IEEE Transactions on Automatic Control, 1981
Computer Tracking of Moving Point Targets in Space
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1981
Background Suppression And Tracking With A Staring Mosaic Sensor
Optical Engineering, 1981
An algorithm for tracking multiple targets
IEEE Transactions on Automatic Control, 1979
The viterbi algorithm
Proceedings of the IEEE, 1973
Convolutional Codes and Their Performance in Communication Systems
IEEE Transactions on Communication Technology, 1971
Further results on optimal decoding of convolutional codes (Corresp.)
IEEE Transactions on Information Theory, 1969
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
IEEE Transactions on Information Theory, 1967