共查询到14条相似文献,搜索用时 85 毫秒
1.
分析了球面Quaternary编码的特点,给出了三角格网方向判断的规则,并对该算法与Bartholdi邻近搜索算法的时间复杂度进行了对比。结果表明,分解算法的平均时间耗时量约是Bartholdi邻近搜索算法的23.66%。 相似文献
2.
球面退化四叉树格网单元的邻近搜索算法 总被引:3,自引:0,他引:3
为了克服传统经纬度格网与全球四元三角网(quaternary triangular mesh,QTM)存在的不足,提出了一种球面退化四叉树格网(degenerate quadtree grid,DQG)的剖分方法及相应的格网编码方案,分析了不同位置格网的邻近特征,给出了一套详细的DQG单元邻近搜索算法,并进行了相关实验与对比分析。结果表明,该算法的搜索速度比传统QTM格网的Bartholdi搜索算法和分解搜索算法分别提高了约100倍和30倍。 相似文献
3.
格网单元的邻近搜索是聚类、索引、查询等空间操作的基础,但现有方法大都局限于单个剖分层次,无法直接满足全球多尺度数据集成查询和操作的应用需求。在球面退化四叉树格网(DQG)模型基础上,提出了一种基于多层次格网的邻近搜索算法。首先采用视点相关技术建立DQG格网的多层次模型,然后引入细分评价函数确定格网单元的邻近单元层次,设计并实现了一种相邻格网单元层次差不超过1的动态多层次格网单元邻近搜索算法,最后与单层次邻近搜索算法进行了对比实验。结果表明,搜索同一区域,该算法的耗时成本约为DQG单层次搜索算法的1/3(层次为11);将该算法用于全球地形实时可视化表达,平均刷新帧率达到60帧/s。 相似文献
4.
Classification is always the key point in the field of remote sensing. Fuzzy c-Means is a traditional clustering algorithm that has been widely used in fuzzy clustering. However, this algorithm usually has some weaknesses, such as the problems of falling into a local minimum, and it needs much time to accomplish the classification for a large number of data. In order to overcome these shortcomings and increase the classification accuracy, Gustafson-Kessel (GK) and Gath-Geva (GG) algorithms are proposed to improve the traditional FCM algorithm which adopts Euclidean distance norm in this paper. The experimental result shows that these two methods are able to detect clusters of varying shapes, sizes and densities which FCM cannot do. Moreover, they can improve the classification accuracy of remote sensing images. 相似文献
5.
6.
7.
8.
Tao Wang 《地球空间信息科学学报》2008,11(2):103-106
This paper proposes a new algorithm for determining the starting points of contour lines. The new algorithm is based on the interval tree. The result improves the algorithm's efficiency remarkably. Further, a new strategy is designed to constrain the direction of threading and the resulting contour bears more meaningful information. 相似文献
9.
10.
11.
The characteristic of Quaternary codes is analyzed. The rule of distinguishing triangle direction is given out. An algorithm of neighbor finding by decomposing the Quaternary code from back to front is presented in this paper. The contrastive analysis of time complexity between this algorithm and Bartholdi’s algorithm is approached. The result illustrates that the average consumed time of this algorithm is about 23.66% of Bartholdi’s algorithm. 相似文献
12.
基于三角网光滑规则的LiDAR点云噪声剔除算法 总被引:1,自引:0,他引:1
通过对传统移动均值法、频率域信号分析等离散点云噪声剔除算法局限性的分析,结合LiDAR点云离散空间分布特性,本文提出一种基于三角网光滑规则的点云噪声剔除算法。该算法先快速生成离散点云的二维Delaunay三角网,并构建任意点的邻接拓扑关系,然后依据设定的光滑规则进行噪声信号点检测,并输出非噪声点信号。针对条带数据进行实验,结论表明本文算法适合离散点状噪声剔除,可较大程度提高点云数据的信噪比。 相似文献
13.
"主从相关器"结构的接收机常被用来监测C/A码相关函数相关峰的形变,但受制于相关器数量的影响,在GPS卫星低仰角时,监测器并不能及早地发现信号形变,针对这一问题,该文在"主从相关器"结构的接收机基础上,采用了虚拟相关对技术,通过已知的3组相关对(一组"主相关对",两组"从相关对")和Prompt相关器输出,以码片间距为自变量,采用最小二乘的方法,拟合相关器相关值输出三次曲线。拟合曲线上的点作为构建的虚拟相关对输出,它们与已知相关器的输出一起进入之后的相关函数相关峰性形变监测部分处理。采用此种方法,不仅不会遗漏传统算法用到的待测量,而且能扩大待测量的样本空间。同时,该方法不会因为加入新的待测量产生误测。通过仿真发现,在使用3组相关对和Prompt相关器,且GPS卫星仰角较低时,该算法比传统算法更早监测到C/A码形变。 相似文献