Track-before-detect processing for a range-ambiguous radar

Krämer, Jan; Reid, W. S.

doi:10.1109/nrc.1993.270482

Cited by 15 publications

(8 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To combat the curse of dimensionality in (9), an efficient algorithm is proposed in [15] to sub-optimally solve the highdimensional maximization by assuming that all target states are independent. When all target states are assumed to be independent, the posterior density satisfies …”

Section: Development Of the Proposed Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

An efficient multi-target track-before-detect algorithm for low PRF surveillance radars

Liu

Kong

et al. 2014

2014 IEEE Radar Conference

View full text Add to dashboard Cite

In this paper, we address the problem of simultaneously detecting and tracking multiple targets using dynamic programming (DP) based track-before-detect (DP-TBD) with reference to low pulse repetition frequency (PRF) surveillance radars. The Doppler ambiguity phenomenon in the low PRF radars is the primary cause which complicates the tracking process. In the range-apparent Doppler plane, target states with different velocities may correspond to the same measurement, thus multiple modes are formed in the posterior density, resulting in a more challenging estimation problem. In this work, we propose an efficient multi-target DP-TBD algorithm suitable for low PRF surveillance radars. Simulation results show that the proposed algorithm can effectively repress the ghost trajectories due to the multi-modality of posterior density and correctly estimate the true target states and target number.

show abstract

Section: Development Of the Proposed Algorithmmentioning

confidence: 99%

“…In [13], the authors present a DP based TBD (DP-TBD) procedure for joint maximum a posteriori (MAP) estimation of the target trajectory in the range-apparent Doppler maps and the corresponding sequence of ambiguity numbers. The studies in [9]- [13], however, assume that only a single target appears in the surveillance area.…”

Section: Introductionmentioning

confidence: 99%

An efficient multi-target track-before-detect algorithm for low PRF surveillance radars

Liu

Kong

et al. 2014

2014 IEEE Radar Conference

View full text Add to dashboard Cite

show abstract

“…Dynamic Programming (DP) is an efficient implementation for TBD (DP-TBD) and has been well studied [3]- [6] in recent years. Its application to radar system has been researched in [7]- [10] as well. In DP-TBD, the continuous state space is discretized into a finite number of discrete states so as to carry out the equivalent of exhaust search to find out the optimal estimates.…”

Section: Introductionmentioning

confidence: 99%

A fast implementation of Dynamic Programming based Track-Before-Detect for radar system

Fang

Cui

et al. 2015

2015 IEEE Radar Conference (RadarCon)

View full text Add to dashboard Cite

This paper addresses the problem of computational efficiency with respect to Dynamic Programming (DP) based Track-Before-Detect (TBD). Generally, DP-TBD is a grid-based method that estimates target trajectory by means of searching all the physically admissible paths in a finite discrete state space. However, its computational complexity increases nonlinearly as the state space expands with size or dimension, which heavily restricts its applications for many realistic scenarios, e.g., radar target detection. To alleviate this problem, a fast twostep implementation of DP-TBD is proposed in this work. In the first step, to reduce the computational costs, target states are roughly estimated by searching a discrete grid with larger cell size. In the second step, an accurate search is performed only on the parts of the state space indicated by the results in the first step with reasonable computational cost. Additionally, the proposed algorithm is also suitable for the surveillance radar scenarios. Simulation results show that the proposed algorithm can effectively improve the computational efficiency of DP-TBD with limited performance degradation.

show abstract

“…T RACK-Before-Detect (TBD) [1 ]- [2] techniques are effective methods to detect weak targets. They make use of target information accumulation in each frame to improve the detection performance.…”

Section: Introductionmentioning

confidence: 99%

A Kalman filtering-based dynamic programming track-before-detect algorithm for turn target

Yue

Kong

Yang

et al. 2010

2010 International Conference on Communications, Circuits and Systems (ICCCAS)

View full text Add to dashboard Cite

Dynamic programming-based track-before-detect algorithm is an effective approach to track target with uniform rectilinear or slowly maneuvering motion. But when target performs a turn motion it has a poor performance for the transition step is fixed. In this paper a new algorithm which combines dynamic programming with Kalman filtering has been proposed. This algorithm makes use of state prediction operation in Kalman filtering to change the transition step in DP algorithm adaptively. Numerical results show that this new method has a much better tracking ability than the traditional procedure when target turns.

show abstract

Track-before-detect processing for a range-ambiguous radar

Cited by 15 publications

References 4 publications

An efficient multi-target track-before-detect algorithm for low PRF surveillance radars

An efficient multi-target track-before-detect algorithm for low PRF surveillance radars

A fast implementation of Dynamic Programming based Track-Before-Detect for radar system

A Kalman filtering-based dynamic programming track-before-detect algorithm for turn target

Contact Info

Product

Resources

About