Tracker Operating Characteristic for Integrated Probabilistic Data Association
File version
Accepted Manuscript (AM)
Author(s)
Williams, JL
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
Brisbane, Australia
License
Abstract
Integrated Probabilistic Data Association (IPDA) is a popular approach to target tracking and to track initiation and termination. In regards to track initiation, it may be said to belong to the "detect-then-track" class in which processing begins with sensor-level detections. This is in contrast to "track-before-detect" (TkBD) approaches in which un-thresholded sensor-level measurements are directly incorporated into a track-initiation statistic. In IPDA, the track-initiation statistic is the probability of existence (PoE). How should the confirmation threshold be set? We perform a statistical analysis that yields an accurate approximation of the false-track and track detection probabilities as a function of the threshold on the PoE. From these probabilities, IPDA's tracker operating characteristic (TOC) can be derived. We further propose a tracker using similar ideas but which belongs to the TkBD class. Its TOC is likewise derived and compared with IPDA. The results of numerical simulations are presented which support the theoretical derivations.
Journal Title
Conference Title
2018 International Conference on Radar, RADAR 2018
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Item Access Status
Note
Access the data
Related item(s)
Subject
Theory of computation