.png){kind=icon}
.png){kind=icon}
Return
A multi-frame track-before-detect algorithm based on root label clustering for multiple targets
.png){kind=icon}
OA
AI
DOI：10.1016/j.cja.2021.09.014.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a novel multi-frame track-before-detect algorithm is proposed, which is based on root label clustering to reduce the high computational complexity arising by observation area expansion and clutter/noise density increase. A criterion of track extrapolation is used to construct state transition set, root label is marked by state transition set to obtain the distribution information of multiple targets in measurement space, then measurement plots of multi-frame are divided into several clusters, and finally multi-frame track-before-detect algorithm is implemented in each cluster. The computational complexity can be reduced by employing the proposed algorithm. Simulation results show that the proposed algorithm can accurately detect multiple targets in close proximity and reduce the number of false tracks.(c) 2021 Chinese Society of Aeronautics and Astronautics. Production and hosting by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Keywords:
Multi-frame track-before-detect
Multiple targets detection
Root label clustering
State transition set
Track extrapolation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
4.7K
Citations:
1.4W