Distributed Computation of Likelihood Maps for Target Tracking

  • Authors:
  • Jonathan Gallagher;Randolph Moses;Emre Ertin

  • Affiliations:
  • Department of Electrical and Computer Engineering, The Ohio State University,;Department of Electrical and Computer Engineering, The Ohio State University,;Department of Electrical and Computer Engineering, The Ohio State University,

  • Venue:
  • DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Using the Bayesian framework of measurement likelihood, sensor data can be combined in a rigorous manner to produce a concise summary of knowledge of a target's location in the state-space. This framework allows sensor data to be fused across time, space and sensor modality. When target motion and sensor measurements are modeled correctly, these "likelihood maps" contain all the relevant information for making inferences about the underlying target state. By combining all data without thresholding for detections, targets with low signal to noise ratio (SNR) can be detected where standard detection algorithms may fail. As the calculation cost of computing likelihood maps over the entire state space is prohibitively high for most practical applications, we propose an approximation which is computed in a distributed fashion, locally at each sensor node. We analyze this approximation, and give cases where it agrees with the centrally calculated likelihood map. Detection and tracking examples using measured data from multi-modal sensors (Radar, EO, Seismic) are presented.