三维空间被动传感器的快速数据关联算法研究  

Fast Data Association Algorithm for Three-Dimensional Passive Sensors

作　　者：陈玲[1] 李少洪[1] 黎莉[2] 

机构地区：[1]北京航空航天大学电子信息工程学院,北京100083 [2]空军第一航空学院,河南信阳464000

出　　处：《电子学报》2005年第9期1549-1552,共4页Acta Electronica Sinica

摘　　要：这篇文章主要研究的是三维被动传感器的静态测量数据关联问题.多维指派算法以及它的诸多近优改进型方法已被证明可有效解决数据关联问题,但它们的缺点是候选关联代价的计算复杂且计算量大.我们提出了一种快速数据关联算法即基准线最小代价算法,该算法实质上是基准线算法与改进的三维指派算法的结合.它的优点是可快速削减候选关联集合的数目,并可简化关联代价的计算.仿真结果表明,该算法的计算量小于标准的三维指派算法.This paper is concerned with the static problem of associating measurements from three-dimensional （3D） passive sensors. Multidimensional assignment methods and a number of near-optimal modifications have been shown to be very effective for data association. But, numerons candidate association cost evaluations of the methods are rather expensive and the computation time is very high. We present a fast data association algorithm called Datum Line Minimum Cost algorithm, which combines datum line algorithm with modified 3D assignment algorithm. The merits of the algorithm are that it can cut candidate associations very fast and reduce the calculations of association costs. Simulation results show significant computational savings over the standard 3D assignment approach.

关 键 词：无源定位 被动传感器 数据关联 指派 

分 类 号：TN911.7[电子电信—通信与信息系统]