We analyze a dynamic programming (DP)-based track before detect (TBD) algorithm. By using extreme value theory we obtain explicit expressions for various performance measures of the algorithm such as probability of detection and false alarm. Our analysis has two advantages. First the unrealistic Gaussian and independence assumptions used in previous works are not required. Second, the probability of detection and false alarm curves obtained fit computer simulated performance results significantly more accurately than previously proposed analyses of the TBD algorithm.
Performance analysis of a dynamic programming track before detect algorithm
IEEE Transactions on Aerospace and Electronic Systems ; 38 , 1 ; 228-242
01.01.2002
579401 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
PAPERS - Performance Analysis of a Dynamic Programming Track Before Detect Algorithm
Online Contents | 2002
|Performance of Dynamic Programming Techniques for Track-Before-Detect
Online Contents | 1996
|Student Highlight: Dynamic Programming-Based Track-Before-Detect Approach to Multitarget Tracking
Online Contents | 2012
|