检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王霄[1,2] 刘士建[1,2] 李冰[1,2] 裘莉娅[1,2] WANG Xiao;LIU Shi-Jian;LI Bing;QIU Li-Ya(Shanghai Institute of Technical Physics of the Chinese Academy of Science,Shanghai 200083,China;Key Laboratory of Infrared Detection and Imaging Technology,Chinese Academy of Sciences Shanghai 200083,China)
机构地区:[1]中国科学院上海技术物理研究所,上海200083 [2]中国科学院红外探测与成像技术重点实验室,上海200083
出 处:《激光与红外》2025年第4期588-593,共6页Laser & Infrared
基 金:国家十四五预研项目(No.514010405-207)资助。
摘 要:为了解决双站多目标配准方法中受各种误差影响使得配准精度降低的问题,提出了一种基于最小张角的配准方法。首先计算双站中所有测角线对应的张角矩阵,然后利用每个站的航迹信息缩量更新张角矩阵,最后基于最小张角和全局最优的原则选择最佳的数据关联组合。通过蒙特卡罗仿真方法,对算法的性能进行了评估,结果表明,算法不仅可以提高配准的精度,还可以大幅度减少运算的时间;目标之间距离30m时,关联的正确率大于97%,算法的运行时间约0.016ms,在精度和性能上均优于其他算法,为提高目标多维定位的精度提供了重要的理论基础。In order to solve the problem of reduced registration accuracy due to various errors in the dualstation multi-target registration method,a minimum angle-based registration method is proposed.Firstly,the angle matrices corre-sponding to all the angle measurement lines in the dual stations are calculated,then the angle matrices are updated by scaling the trajectory information of each station,and finally the optimal combination of data associations is selected based on the principles of minimum angle and global optimum.The capability of the algorithm is evaluated by Monte Carlo simulation method,and the results show that the algorithm can not only enhance the accuracy of registration,but also drastically reduce computation time.When the distance between targets is 30 m,the correct rate exceeds 97%,and the algorithm's running time is approximately 0.016 ms.This algorithm outperforms other algorithms in terms of both accuracy and performance,providing an important theoretical foundation for improving the accuracy of multi-dimensional target positioning.
分 类 号:TN219[电子电信—物理电子学] TP73[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49