Application of K-means++Partition Method in Intensive Stations
-
摘要: GAMIT软件在解算大型密集测站时一般需要进行分区处理,分区解算对结果的精度具有一定的影响。为了解决一般分区方法中长短基线同时存在而导致整网解算精度降低的问题,引入了K-means++算法和Hash算法实现分区,简称为K-means++分区法。首先利用K-means++算法对测站进行聚类,再利用Hash算法进行排序组合,这样能得到分布均匀的子网。文中采用整网解算结果作为标准值,分析区域分区法和K-means++分区法的基线长度、基线精度及三维坐标差,然后再将K-means++分区方法与间距分区法进行对比分析。实验结果表明,该方法比区域分区法精度更高,与现有的间距分区方法精度相持,且比间距分区法要稳定高效。Abstract: GAMIT software generally needs to perform partition processing when solving large-scale intensive stations. Partition resolution has a certain influence on the accuracy of the results. In order to solve the problem that the long-short baselines exist in the general partitioning method and the accuracy of the whole network solution is reduced, the K-means++algorithm and the Hash algorithm are introduced to implement partitioning, which is referred to as the K-means++partition method. First, using K-means++algorithm to cluster stations, and then using Hash algorithm to sort and combine, so that we can obtain an uniform distribution subnet. In this paper, the result of the whole network solution is used as the standard value. The baseline length, baseline accuracy and three-dimensional coordinate difference of the regional zoning method and the K-means++zoning method are analyzed. Then the K-means++partition method and the spacing zoning method are compared and analyzed. The experimental results show that this method is more accurate than the regional zoning method, and it is in line with the accuracy of the existing spacing zoning method, and is more stable and efficient than the zoning method.
-
Key words:
- K-means++ /
- partition solution /
- baseline accuracy /
- GAMIT
-
[1] HERRING T A,KING R W, FLOYD M A, et al. GAMIT Reference manual(10 .6)[R].2015. [2] 李兵,成英燕,于男,等.密集型CORS站的高精度基线解算方案研究[J].测绘通报,2014(10):50-53. [3] 万军,成英燕,党亚民,等.陆态网测站高精度解算分区方案[J].测绘科学,2016,41(4):1-4,23. [4] 曹炳强,成英燕,许长辉,等.间距分区法在解算卫星连续运行站数据中的应用[J].测绘通报,2016(11): 15-17. [5] 辜声峰,胡羽中,唐卫明.大规模基准站组网与分区服务技术探讨[J].大地测量与地球动力学,2010,30(4):146-150. [6] 杨大鑫,王荣波,黄孝喜,等. 基于最小方差的Kmeans 用户聚类推荐算法[J].计算机技术与发展,2018, 28(1):104-107. [7] 张清华,幸禹可. 一种基于 Hash的快速值约简方法[J]. 广西师范大学学报(自然科学版),2011,29(4):39-43. [8] 姜卫平.GNSS基准站网数据处理方法与应用[M].武汉:武汉大学出版社,2016. [9] 姜卫平,赵倩,刘鸿飞,等. 子网划分在大规模GNSS基准站网数据处理中的应用[J].武汉大学学报(信息科学版),2011, 36(4):389-391. [10] 杨凯. 大规模基准站网子网划分与公共站选取方法研究[J].测绘科学技术,2017, 5(3), 158-165. [11] 刘宗强,党亚民,何涛,等.IGS站的选取对陆态网解算精度的影响[J].测绘工程,2017,26(9):28-31. [12] 曹炳强,许长辉,成英燕,等. 基于GAMIT/GLOBK的卫星定轨研究[J].全球定位系统,2017,42(1):77-80. [13] 杨登科,安向东.基于GAMIT的GPS基线解类型分析[J].测绘地理信息,2016,41(5):25-28. [14] 邱荣海,成英燕,席伟. 利用GLOBK软件提高平差精度的策略[J].导航定位学报,2015,3(4). [15] Department of Earth,Atmospheric,and Planetary Sciences Massachusetts Institute of Technology.GAMIT reference manual,release 10.6[R].USA:MIT,2015. [16] MARTENS,H.R.Observations of ocean tidal load response in South America from subdaily GPS positions[J].Geophusical Journal International,2016,205(3):DOI: 10.1093/gji/ggw087.
点击查看大图
计量
- 文章访问数: 375
- HTML全文浏览量: 64
- PDF下载量: 78
- 被引次数: 0