地磁匹配双等值线算法仿真研究  

Research on Dual Iterative Closet Contour Point Algorithm for Geomagnetic Matching

作　　者：郭庆[1] 魏瑞轩[1] 胡明朗[1] 周炜[1] 沈东[1] 

机构地区：[1]空军工程大学工程学院,西安710038

出　　处：《系统仿真学报》2010年第7期1576-1579,共4页Journal of System Simulation

基　　金：863项目创新基金(2008AA203)

摘　　要：地磁场数据的缓变特性导致地磁匹配等值线(Iterative Closet Contour Point,ICCP)算法存在着局限性,针对这种情况,在对地磁场数据特征量交叉特性研究的基础上,提出了适合地磁场数据的地磁匹配双等值线(Dual Iterative Closet Contour Point,DICCP)算法,建立了算法的模型,并对算法的粗匹配和精匹配过程进行了仿真研究,仿真结果证实了算法的有效性,特别是在降低对INS精度要求时,能够得到比ICCP算法更高的匹配精度。Giving the restrictions brought forth by slow-changing character of geomagnetism data of ICCP algorithm in geomagnetism matching,a dual-ICCP algorithm of geomagnetic matching was put forward on the basis of study into the crossing characteristic of geomagnetism eigenvector.And the process of both the rude and exact matching of the algorithm was studied.As shown in the simulation,a more excellent matching precision compared to ICCP algorithm is easily acquired,especially when it comes to reduce the required precision of INS.

关 键 词：地磁匹配 等值线算法 双等值线 交叉特性 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]