J4 ›› 2012, Vol. 39 ›› Issue (1): 67-74.doi: 10.3969/j.issn.1001-2400.2012.01.013

• Original Articles • Previous Articles     Next Articles

Study of a new track correlation algorithm in data fusion

QUAN Yining1;JIANG Zhen1;HUANG Xiaodong2;LI Weifeng3
  

  1. (1. School of Computer Science and Technology, Xidian Univ., Xi'an  710071, China;
    2. Software Center, Naval Aeronautical Engineering Institute, Yantai  264001, China;
    3. Xi'an Aircraft International Corp., Xi'an  710089, China)
  • Received:2010-11-18 Online:2012-02-20 Published:2012-04-06
  • Contact: QUAN Yining E-mail:ynquan@mail.xidian.edu.cn

Abstract:

Because of being highly dependent on the threshold and lacking the consideration of global solutions, the Nearest Neighbors Algorithm(NNA) will make some mistakes when the density of targets is high. To solve this problem, global search strategy, gating and dynamic programming are used to build a new correlation algorithm-the Global Best Track Correlation Algorithm(GBTCA). In two experiments, both of the two algorithms are run and compared to NNA, GBTCA, which shows that the new algorithm has a higher correct correlation rate and is less dependent on threshold values.

Key words: data fusion, track correlation, global search, dynamic programming, gating

CLC Number: 

  • TP391