Performance analysis of a track before detect dynamic programming algorithm via generalized pareto distribution

Liang Cai, Chunlei Cao, Yanhua Wang, Guoxiao Yang, Shulin Liu, Le Zheng

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

We analyze a dynamic programming (DP)-based track before detect (TBD) algorithm. By using the generalized Pareto distribution (GPD) in extreme value theory, we obtain explicit expressions for the performance measures of the algorithm such as probability of detection and false alarm. Our analysis has two advantages. First the unrealistic the distribution for data from the exponential class assumptions used in EVT 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.

Original languageEnglish
Title of host publicationIET International Radar Conference 2013
Edition617 CP
DOIs
Publication statusPublished - 2013
EventIET International Radar Conference 2013 - Xi'an, China
Duration: 14 Apr 201316 Apr 2013

Publication series

NameIET Conference Publications
Number617 CP
Volume2013

Conference

ConferenceIET International Radar Conference 2013
Country/TerritoryChina
CityXi'an
Period14/04/1316/04/13

Keywords

  • Dynamic programming
  • Generalized pareto distribution
  • Track before detect

Fingerprint

Dive into the research topics of 'Performance analysis of a track before detect dynamic programming algorithm via generalized pareto distribution'. Together they form a unique fingerprint.

Cite this