A novel RHT-TBD approach for weak targets in HPRF radar

Abstract

A novel approach, which can handle ambiguous data from weak targets, is proposed within the randomized Hough transform track-before-detect (RHT-TBD) framework. The main idea is that, without the pre-detection and ambiguity resolution step at each time step, the ambiguous measurements are mapped by the multiple hypothesis ranging (MHR) procedure. In this way, all the information, based on the relativity in time and pulse repetition frequency (PRF) domains, can be gathered among different PRFs and integrated over time via a batch procedure. The final step is to perform the RHT with all the extended measurements, and the ambiguous data is unfolded while the detection decision is confirmed at the end of the processing chain. Unlike classic methods, the new approach resolves the problem of range ambiguity and detects the true track for targets. Finally, its application is illustrated to analyze and compare the performance between the proposed approach and the existing approach. Simulation results exhibit the effectiveness of this approach.

Adaptive real‐time recursive radial distance‐time plane Hough transform track‐before‐detect algorithm for hypersonic target

“…For conventional targets, TBD algorithm based on Hough transform in [20–23] usually uses position measurement data to transform, and its transformation equation is as follows: where denotes the location information of measurement data, and denote the eigenvalues of target tracking in parameter space.…”

“…In 1994, Carlson et al applied Hough transform to search radar for the first time, and established the theory of low observable target detection based on Hough transform [17–19]. Since then, many scholars have made a series of developments and improvements on the HT‐TBD algorithm under different backgrounds and conditions [20–23]. Among them, aiming at the problems of MIMO radar's range walk and UWB multistate radar's high false alarm probability, the authors of [20, 22] improve the original algorithm by using Hough transform and effectively improving the system performance.…”

“…Bi et al [21] improve the HT‐TBD algorithm by increasing the dimension of feature parameters and multistage filtering, and achieves better performance to multi‐target detection and tracking. In [23], a new random HT‐TBD algorithm is proposed to solve the range ambiguity problem of high pulse repetition frequency radar, which can detect and track weak targets effectively. As for hypersonic targets, in view of their different motion characteristics from conventional targets, a radial distance‐time plane HT‐TBD algorithm is proposed by the project team to achieve effective detection and tracking of hypersonic targets [24].…”

Two-Step Thresholds TBD Algorithm for Time Sensitive Target Based on Dynamic Programming

“…y If the maximum value of CVF and that of the N independent value functions satisfies equation (10), the CVF is considered to be formed by the mixed measurement, such as the noise, the multiple targets and the extended two-dimensional ambiguous data. Meanwhile, for different CPI data within each frame, we judge that there exist no coincidence between the real targets and their mixed measurement.…”

“…For high-resolution radar, weak target particle filter algorithm [9] based on the measurement model of intensity diffusion function is proposed to verify the reliability of range ambiguity resolution in the high PRF situation. In literature [10], the well-known multihypothesis TBD value function under the range ambiguous condition is demonstrated through constructing the extended ambiguous measurement set. However, the above algorithms only give consideration to one-dimensional ambiguity case.…”