Performance analysis of a track before detect dynamic programming algorithm

TitlePerformance analysis of a track before detect dynamic programming algorithm
Publication TypeConference Paper
Year of Publication2000
AuthorsJohnston, L. A., and V. Krishnamurthy
Conference NameAcoustics, Speech, and Signal Processing, 2000. ICASSP '00. Proceedings. 2000 IEEE International Conference on
Pagination49 -52 vol.1
Keywordsasymptotic expressions, data processing, dynamic programming, extremal analysis, extreme value theory, false alarm probability, limiting distributions, performance analysis, probability, signal detection, simulated results, target existence, target tracking, track before detect dynamic programming algorithm, track detection probability
Abstract

ldquo;track-before-detect rdquo; (TBD) is a target tracking technique where the data is processed over a number of frames before decisions on target existence are made. The aim of this paper is to use extreme value theory to analyse the performance of a dynamic programming based TBD algorithms. Asymptotic expressions are obtained for the false alarm and track detection probabilities using extremal analysis of limiting distributions. Apart from fitting the simulated results far more accurately than previous works in the TBD literature, our analysis does not require the unrealistic assumptions of independence and Gaussianity

URLhttp://dx.doi.org/10.1109/ICASSP.2000.861860
DOI10.1109/ICASSP.2000.861860

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia