华中科技大学学报：自然科学版2012，Vol.40Issue(3)：63-67,5.
面向测向交叉定位的2级消元数据关联算法
Bearing-crossing localization oriented data association algorithm for two-hierarchic elimination
摘要
Abstract
In view of existing data association algorithms′ deficiency in real time,a two-hierarchic elimination based data association（TEDA） algorithm was proposed.Firstly a series of candidate association sets was generated,whose number was equal to the number of targets,according to an association criterion.Then the unmerited bearing lines were eliminated from the candidate association sets by rough association process and refined association process.The proposed algorithms is not necessary to deal with all the possible association sets,thus it can cut down the computation complexity greatly.Moreover,it can restrain the influence of clutter effectively.Simulations demonstrate the merits of TEDA in terms of efficiency and preciseness.关键词
数据关联算法/2级消元/测向线/关联判据/杂波Key words
data association algorithm/two-hierarchic elimination/bearing line/association criterion/clutter分类
信息技术与安全科学引用本文复制引用
蒋文涛,孙利民,吕俊伟,杨曙辉..面向测向交叉定位的2级消元数据关联算法[J].华中科技大学学报：自然科学版,2012,40(3):63-67,5.基金项目
国家自然科学基金资助项目 （）
国家重点基础研究发展计划资助项目 （）
国家科技重大专项资金资助项目 （）
