### Abstract

A new algorithm is proposed for the solution of an important class of multidimensional detection problems: The detection of small, barely discernible, moving objects of unknown position and velocity in a sequence of digital images. A large number of candidate trajectories, organized into a tree structure, are hypothesized at each pixel in the sequence and tested sequentially for a shift in mean intensity. The practicality of the algorithm is facilitated by the use of multistage hypothesis testing (MHT) for simultaneous inference, as well as the existence of exact expressions for MHT test performance in Gaussian white noise (GWN). These expressions predict the algorithm’s computation and memory requirements, where it is shown theoretically that several orders of magnitude of processing are saved over a brute-force approach based on fixed sample-size tests. The algorithm is applied to real data by using a robust preprocessing procedure to eliminate background structure and transform the image sequence into a residual representation, modeled as GWN. Results are verified experimentally on a variety of video image sequences.

Original language | English (US) |
---|---|

Pages (from-to) | 1611-1629 |

Number of pages | 19 |

Journal | IEEE Transactions on Signal Processing |

Volume | 39 |

Issue number | 7 |

DOIs | |

State | Published - Jul 1991 |

### ASJC Scopus subject areas

- Signal Processing
- Electrical and Electronic Engineering

## Fingerprint Dive into the research topics of 'Detecting Small, Moving Objects in Image Sequences Using Sequential Hypothesis Testing'. Together they form a unique fingerprint.

## Cite this

*IEEE Transactions on Signal Processing*,

*39*(7), 1611-1629. https://doi.org/10.1109/78.134399