2020
DOI: 10.1109/tvt.2020.2976095
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Frame Track-Before-Detect Algorithm for Maneuvering Target Tracking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
35
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 109 publications
(35 citation statements)
references
References 50 publications
0
35
0
Order By: Relevance
“…But it would cause missed detection and a large number of false alarms when the targets have not strong gray value. Wang J et al use dynamic programming algorithm (DP-TBD) to carry out path integral for the target intensity, and use multiframe accumulation to carry out noise reduction processing and target enhancement at the same time [10,11]. For using the value function to carry out the optimal accumulation at each moment to search for the global strategy combination, DP-TBD assumes that the gray value of the target on the full path maintains maximum value.…”
Section: B Multi-frame-basedmentioning
confidence: 99%
See 1 more Smart Citation
“…But it would cause missed detection and a large number of false alarms when the targets have not strong gray value. Wang J et al use dynamic programming algorithm (DP-TBD) to carry out path integral for the target intensity, and use multiframe accumulation to carry out noise reduction processing and target enhancement at the same time [10,11]. For using the value function to carry out the optimal accumulation at each moment to search for the global strategy combination, DP-TBD assumes that the gray value of the target on the full path maintains maximum value.…”
Section: B Multi-frame-basedmentioning
confidence: 99%
“…In order to reflect the effectiveness of the proposed model, we compare dynamic programming algorithm (DP-TBD) [11], time variance filter algorithm (TVF-TBD) [9], Kalman Filtering (KF-TBD) [8], Spatial-Temporal Local Difference (STLDM) algorithm [21] in this paper. The above algorithms cover the mainstream of dim and small target detection algorithm.…”
Section: Target Detection Performance Experimentsmentioning
confidence: 99%
“…where, a and b are the weights of the HOG-HHG feature response map and the CN feature response map, respectively, max(f HOG-HHG (z)) is the maximum value of the HOG-HHG feature response map, and max(f CN (z)) is maximum value of CN feature response map. The adaptive weights in Equations (14) and (15) can strength the role of the feature response map which has bigger maximum response value. Thus, the main feature can play the more important role to locate the target.…”
Section: Target Detectionmentioning
confidence: 99%
“…In contrast, unsupervised UDT method [12] can resolve the manual labelling problem, however it demands the platform to be very powerful and its tracking accuracy will be degraded. Generally, the tracking accuracy of the methods based on deep learning can be greatly improved, but the large computation cost or workload to label samples constrains the application of these tracking strategies in the real-time detecting and tracking field [13][14][15][16][17][18][19][20][21][22][23][24][25]. In addition, these tracking strategies are also not suitable for tracking target which is outside the training sample set.…”
Section: Introductionmentioning
confidence: 99%
“…In the framework of Bayesian theory, the DP-TBD algorithm estimates the joint posterior probability density function of target states in discrete state space. DP-TBD searches all of the possible paths according to the target motion model, and gradually accumulates the merits of these paths [22], [23]. Common merit functions include posterior density, likelihood ratio and signal amplitude.…”
Section: Introductionmentioning
confidence: 99%