Share Email Print
cover

Proceedings Paper

A study of factors affecting multiple target tracking with a pixelized sensor
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Factors affecting the performance of an algorithm for tracking multiple targets observed using a pixelized sensor are studied. A pixelized sensor divides the surveillance region into a grid of cells with targets generating returns on the grid according to some known probabilistic model. In previous work an efficient particle filtering algorithm was developed for multiple target tracking using such a sensor. This algorithm is the focus of the study. The performance of the algorithm is affected by several considerations. The pixelized sensor model can be used with either thresholded or non-thresholded measurements. While it is known that information is lost when measurements are thresholded, quantitative results have not been established. The development of a tractable algorithm requires that closely-spaced targets are processed jointly while targets which are far apart are processed separately. Selection of the clustering distance involves a trade-off between performance and computational expense. A final issue concerns the computation of the proposal density used in the particle filter. Variations in a certain parameter enable a trade-off between performance and computational expense. The various issues are studied using a mixture of theoretical results and Monte Carlo simulations.

Paper Details

Date Published: 16 September 2005
PDF: 12 pages
Proc. SPIE 5913, Signal and Data Processing of Small Targets 2005, 59130L (16 September 2005); doi: 10.1117/12.617978
Show Author Affiliations
Mark R. Morelande, Univ. of Melbourne (Australia)
Christopher M. Kreucher, General Dynamics Advanced Information Systems (United States)
Keith Kastella, General Dynamics Advanced Information Systems (United States)


Published in SPIE Proceedings Vol. 5913:
Signal and Data Processing of Small Targets 2005
Oliver E. Drummond, Editor(s)

© SPIE. Terms of Use
Back to Top