A Comparison of Detection Performance for Several Track-before-Detect Algorithms

By S. Davey, Mark G. Rutten, Brian Cheung. Fusion, 2008

318 citations recorded by the source corpus.

A typical sensor data processing sequence uses a detection algorithm prior to tracking to extract point measurements from the observed sensor data. Track before detect (TBD) is a paradigm which combines target detection and estimation by removing the detection algorithm and supplying the sensor data directly to the tracker. Various different approaches exist for tackling the TBD problem. This article compares the ability of several different approaches to detect low amplitude targets. The following algorithms are considered in this comparison: Bayesian estimation over a discrete grid, dynamic programming, particle filtering methods, and the histogram probabilistic multihypothesis tracker. Algorithms are compared on the basis of detection performance and computation resource requirements.

Subfields: Artificial Intelligence, Computer Networks and Communications, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/deb44c860b4ea1204620aca03637ee5775ca39dd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. B. Vo
  2. Nam Trung Pham
  3. David Suter
  4. Ba-Ngu Vo
  5. Hung Gia Hoang
  6. Dinh Q. Phung
  7. Jason L. Williams
  8. Karl Granström

In Computer Networks and Communications

  1. B. Vo
  2. Nam Trung Pham
  3. David Suter
  4. Hung Gia Hoang
  5. Ba-Ngu Vo
  6. Jason L. Williams
  7. Karl Granström
  8. Dinh Q. Phung

In Computer Vision and Pattern Recognition

  1. B. Vo
  2. Nam Trung Pham
  3. David Suter

Citations in the corpus