基于改进Fast-DTW的多维地磁序列匹配算法研究
Research on Multidimensional Geomagnetic Sequence Matching Algorithm Based on Improved Fast-DTW
姚霆宇 1余学祥 1韩雨辰 1朱平1
作者信息
- 1. 安徽理工大学空间信息与测绘工程学院,安徽 淮南 232001;安徽理工大学 矿山采动灾害空天地协同监测与预警安徽普通高校重点实验室,安徽 淮南 232001;安徽理工大学 矿区环境与灾害协同监测煤炭行业工程研究中心,安徽 淮南 232001
- 折叠
摘要
传统单点的地磁匹配定位算法运算量大,且定位时效性及定位精度较差.针对该问题,采用基于序列的快速动态时间规整算法Fast-DTW实现多维的地磁序列匹配,并利用最长公共子序列LCS的有序聚类进行优化.离线阶段通过坐标转换法构建四维地磁指纹库,在线阶段进行实时地磁序列匹配,获得定位结果.实验结果表明,该算法的定位时效性及精度均有提升.
Abstract
The traditional geomagnetic matching positioning algorithms based on single points have a large computational overhead and relatively poor positioning timeliness and accuracy.To address this issue,this paper uses the Fast Dynamic Time Warping(Fast-DTW)algorithm based on sequences to implement multi-dimensional geomagnetic sequence matching,and optimizes it using ordered clustering of the Longest Common Subsequence(LCS).During the offline phase,a four-dimensional geomagnetic fingerprint database is constructed by coordinate transformation methods.In the online phase,real-time geomagnetic sequence is matched to obtain positioning results.The experimental results show that the positioning timeliness and accuracy of the algorithm have been improved.
关键词
地磁室内定位/快速动态时间规整算法/最长公共子序列/地磁指纹库Key words
geomagnetic indoor positioning/Fast-DTW/LCS/geomagnetic fingerprint database引用本文复制引用
基金项目
安徽省重点研发计划(202104a07020014)
安徽省科技重大专项(202103a05020026)
出版年
2024
国家科技期刊平台
NSTL
维普
万方数据