Parallel Computing Based Dynamic Programming Algorithm of Track-before-Detect

Parallel Computing Based Dynamic Programming Algorithm of Track-before-Detect

The conventional dynamic programming-based track-before-detect (DP-TBD) methods are usually intractable in multi-target scenarios. The adjacent targets may interfere with each other, and the computational complexity is increased with the number of targets. In this paper, a DP-TBD method using parall...

Full description

Bibliographic Details
Main Authors: Qiang Guo, Zhenwu Li, Wenming Song, Wenyu Fu
Format: Article
Language:English
Published: MDPI AG 2018-12-01
Series:Symmetry
Subjects:
parallel computing
track-before-detect
dynamic programming
weak target
computational complexity
Online Access:http://www.mdpi.com/2073-8994/11/1/29

Internet

http://www.mdpi.com/2073-8994/11/1/29

Similar Items