A tree search algorithm for target detection in image sequences

Given a time sequence of digital images of a high-noise environment, the authors address the problem of detecting pixel-sized, barely discernible moving objects whose position and trajectories are unknown. The sequences may be temporally sparse and contain significant frame-to-frame drifting background clutter as caused by relative motion between the sensor array and natural terrain, ocean, or clouds. A general, two-step approach is presented. First, time correlation and space-varying background structure are removed. Second, a large, dense set of pixel-sized space-time trajectories are hypothesized and tested in the innovations sequence. The search space is organized into a tree structure. A sequential statistical technique, multistage hypothesis testing, optimized for the innovations model, is used to test the multiple hypotheses and prune the tree-structured list of candidate trajectories.<<ETX>>

[1]  P. J. Huber A Robust Version of the Probability Ratio Test , 1965 .

[2]  N. C. Mohanty Computer Tracking of Moving Point Targets in Space , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Steven D. Blostein,et al.  Detection of small moving objects in image sequences using multistage hypothesis testing , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[4]  J. Collins Robust Estimation of a Location Parameter in the Presence of Asymmetry , 1976 .

[5]  V. David VandeLinde,et al.  Robust detection of known signals , 1977, IEEE Trans. Inf. Theory.

[6]  S. Tantaratana Sequential Detection of a Positive Signal , 1986 .

[7]  S.A. Kassam,et al.  Robust techniques for signal processing: A survey , 1985, Proceedings of the IEEE.

[8]  Wesley E. Snyder,et al.  The detection of unresolved targets using the Hough Transform , 1982, Comput. Vis. Graph. Image Process..