Systems Engineering and Electronics ›› 2019, Vol. 41 ›› Issue (11): 2479-2487.doi: 10.3969/j.issn.1001-506X.2019.11.11

Previous Articles     Next Articles

Dynamic programming track-Before-detect algorithm based on hidden Markov model

ZHANG Yuanpeng, ZHENG Daikun, LI Xinzhe, SUN Yongjian   

  1. The First Department, Air Force Early Warning Academy, Wuhan 430019, China
  • Online:2019-10-30 Published:2019-11-05

Abstract: The traditional dynamic programming track-before-detect(DP-TBD)algorithm can effectively detect and track targets of uniform linear motion. However, the ignorance of the target’s state transition probability among successive flames results in an incorrect state association and it is easy to be disturbed by the noise when detecting and tracking maneuvering targets. This paper proposes a DP-TBD algorithm based on the hidden Markov model (HMM). The algorithm uses the HMM to describe the motion of the target. A series of hidden states are used to represent the turning rate of the target, which are also estimated and predicted by the hidden state estimation theory of the HMM to the turning rate. The predicted value of the current target state will be obtained at the same time. According to the distance between the predicted state and the next echo data, we calculate the state transition probability. Then this probability is applied to the energy accumulation process of the DP-TBD algorithm to improve the detection and tracking performance. Based on the maneuvering target,the simulation gives the detection and tracking performance of the proposed algorithm, compares the proposed algorithm with the traditional DP-TBD algorithm, the direction-weighted DP-TBD algorithm and the linear least squares DP-TBD algorithm,and the effectiveness of the proposed algorithm is verified.


Key words: track-before-detect (TBD), dynamic programming (DP), hidden Markov model (HMM), state prediction, state transition probability

[an error occurred while processing this directive]