Institutional Repository
| 面向测向交叉定位的2级消元数据关联算法 | |
| Alternative Title | bearing-crossing localization oriented data association algorithm for two-hierarchic elimination |
| 蒋文涛; 孙利民; 吕俊伟; 杨曙辉 | |
| 2012 | |
| Source | 华中科技大学学报(自然科学版)
 |
| ISSN | 16714512 |
| Volume | 40Issue:3Pages:63-67 |
| English Abstract | 针对现有数据关联算法在实时性方面的不足,提出了一种2级消元数据关联算法,其特点是先根据关联判据生成与目标数量相等的候选关联集,再对候选关联集进行粗关联和细关联处理,剔除候选关联集中不满足条件的测向线,直至得到最终的关联结果.该算法无须遍历所有可能的关联组合,大幅降低了关联过程中的计算开销,并且能够有效抑制杂波的影响.仿真实验验证了该算法的实时性和准确性. |
| Indexed Type | cnki,ei,cscd,wanfang |
| 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. |
| Keyword | Association Reactions Clutter (Information Theory) |
| Department | 海军航空工程学院控制工程系;中国科学院软件研究所;中船重工第709研究所; |
| Subject | Engineering |
| Language | 中文 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/14643 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | 蒋文涛,孙利民,吕俊伟,等. 面向测向交叉定位的2级消元数据关联算法[J]. 华中科技大学学报(自然科学版),2012,40(3):63-67. |
| APA | 蒋文涛,孙利民,吕俊伟,&杨曙辉.(2012).面向测向交叉定位的2级消元数据关联算法.华中科技大学学报(自然科学版),40(3),63-67. |
| MLA | 蒋文涛,et al."面向测向交叉定位的2级消元数据关联算法".华中科技大学学报(自然科学版) 40.3(2012):63-67. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 面向测向交叉定位的2级消元数据关联算法.（247KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment