检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]防空兵指挥学院,郑州450052 [2]273906部队,南京210003
出 处:《弹箭与制导学报》2010年第4期190-192,共3页Journal of Projectiles,Rockets,Missiles and Guidance
基 金:国防项目资助
摘 要:针对测向交叉定位系统数据关联中存在虚假定位的问题,提出一种改进的分层快速关联算法。该算法先通过挖掘各传感器的相互位置关系与其对同一目标所形成方位量测之间的几何规律,利用候选关联的方位量测构造检验统计量,进行方位粗关联,排除了大部分虚假候选关联.减小了运算量;再对剩余候选关联进行分层组合,提取出正确的关联集合。仿真结果表明,文中算法可快速、准确的排除虚假定位点。Focused on the problem that data association will produce false intersection in passive cross location system of multiple sensors, an improved hierarchical fast association algorithm was presented. As for the algorithm, geometrical rule between mutual position relation to sensors each other and their azimuth measures to the same target was dug out, the azimuth of the candidate associations was used to construct the statistic test and eliminate some false intersection points. Then hierarchical combination was conducted for the remaining candidate associations to pick up true associations. Simulation results show that the algorithm can fast and correctly eliminate false intersection points.
分 类 号:TN971[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30