A Dynamic Programming Track-Before-Detect Algorithm Based on Local Linearization for Non-Gaussian Clutter Background  

作　　者：ZHENG Daikun WANG Shouyong QIN Xing 

机构地区：[1]Air Force Early Warning Academy, Wuhan 430019, China

出　　处：《Chinese Journal of Electronics》2016年第3期583-590,共8页电子学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(No.61179014,No.61302193)

摘　　要：The Dynamic programming track before detect(DP-TBD) algorithm has been widely used for detection and tracking of weak targets. The selection of the merit function has an immediate influence on the performance of the DP-TBD. The amplitude merit function is easy to calculate, but the performance of which will decrease in the presence of non-Gaussian clutter. The likelihood ratio merit function in closed analytical form is difficult to derive under non-Gaussian background without target signal parameters. To solve this problem, a novel DPTBD algorithm based on local linearization is proposed.Taking maximum of the state conditional probability ratio of the target as the optimal criteria, a recursive integration equation is derived. The equation is locally linearized by Taylor series expansion and a suboptimal multi-frame test statistic is developed. The calculation of new merit function in the statistic needs only clutter distribution model,and heavy clutter peak can be restrained by making use of clutter distribution characters. So the proposed algorithm can efficiently extract weak target in strong non-Gaussian clutter. Numerical simulations are provided to assess and compare the performance of the proposed algorithm. It turns out that the proposed algorithm has better detection and tracking performance than the widely used DPTBD algorithm at present and is resilient to various clutter distribution models.The Dynamic programming track before detect（DP-TBD） algorithm has been widely used for detection and tracking of weak targets. The selection of the merit function has an immediate influence on the performance of the DP-TBD. The amplitude merit function is easy to calculate, but the performance of which will decrease in the presence of non-Gaussian clutter. The likelihood ratio merit function in closed analytical form is difficult to derive under non-Gaussian background without target signal parameters. To solve this problem, a novel DPTBD algorithm based on local linearization is proposed.Taking maximum of the state conditional probability ratio of the target as the optimal criteria, a recursive integration equation is derived. The equation is locally linearized by Taylor series expansion and a suboptimal multi-frame test statistic is developed. The calculation of new merit function in the statistic needs only clutter distribution model,and heavy clutter peak can be restrained by making use of clutter distribution characters. So the proposed algorithm can efficiently extract weak target in strong non-Gaussian clutter. Numerical simulations are provided to assess and compare the performance of the proposed algorithm. It turns out that the proposed algorithm has better detection and tracking performance than the widely used DPTBD algorithm at present and is resilient to various clutter distribution models.

关 键 词：Target detection Track-before-detect Dynamic programming Local linearization Non-Gaussian clutter 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术] O221.3[自动化与计算机技术—计算机科学与技术]