Dynamic Programming Solution for Detecting Dim Moving Targets
- 1 January 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. AES-21 (1), 144-156
- https://doi.org/10.1109/taes.1985.310548
Abstract
An on-board scanning or mosaic sensor is staring down from a satellite to a fixed ground point while producing a set of frames that contain target and background signals. Detecting dim moving targets should ideally be done by exhaustively searching over all in he maery(mached fltering), as ppoed possible trajectories in the imagery (matched filtering) as opposed to assembling trajectories from thresholded frames. The dynamic programming approach equivalently substitutes the above prohibitive exhaustive search by a feasible algorithm.Keywords
This publication has 10 references indexed in Scilit:
- Detection and estimation of frequency-random signals (Corresp.)IEEE Transactions on Information Theory, 1982
- Aspects of dynamic programming in signal and image processingIEEE Transactions on Automatic Control, 1981
- Computer Tracking of Moving Point Targets in SpaceIEEE Transactions on Pattern Analysis and Machine Intelligence, 1981
- Background Suppression And Tracking With A Staring Mosaic SensorOptical Engineering, 1981
- An algorithm for tracking multiple targetsIEEE Transactions on Automatic Control, 1979
- The viterbi algorithmProceedings of the IEEE, 1973
- Convolutional Codes and Their Performance in Communication SystemsIEEE 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 algorithmIEEE Transactions on Information Theory, 1967
- A dynamic programming approach to trajectory estimationIEEE Transactions on Automatic Control, 1966