共查询到20条相似文献，搜索用时 125 毫秒
1.
全球地形实时绘制中海量多源遥感影像的拼接方法 总被引：1，自引：0，他引：1
设计全球四叉树层次细节模型和基于数据集的存储方案,以支持海量遥感影像数据的高效管理和访问;为保证显示效果,提出以多边形描述数据集的形状,并设计基于数据集形状多边形的影像拼接算法。 相似文献
2.
分析了遥感影像矢量化数据的特征,指出传统的深度搜索匹配方法用于无拓扑矢量化数据公共边提取存在的不足。针对此问题,提出了基于共线搜索匹配的公共边提取算法,提取无拓扑遥感影像矢量化数据中多边形要素的公共边和非公共边,然后使用经典的道格拉斯普克算法压缩,有效地消除了对要素分别压缩时产生的缝隙问题,验证了算法的可靠性。 相似文献
3.
4.
为解决城市大比例尺真正射影像制作问题,提出了一种数字建筑模型（digital building model,DBM）整体投影遮蔽检测方法。该方法利用DBM表面以矢量三角面存储和平面图形投影内部栅格互不遮蔽的特点,首先以三角面为单元对整个建筑物进行正射投影得到房顶多边形;然后进行透视投影得到整个建筑物在像方的成像多边形,通过数字高程模型（digital elevation model,DEM）投影迭代算法得到该建筑物在传统正射影像上的成像多边形,两者求差集得到建筑物的遮蔽区域物方多边形;最后选取最优辅助影像对遮蔽区域进行纹理补偿,制作出真正射影像。实验结果表明,该方法能够快速准确地检测出影像遮蔽区域,为生成高质量真正射影像提供了保障和前提。 相似文献
5.
在已有的利用影像匹配提取出的房屋特征点的基础上,通过对多边形的拓扑结构的分析,分别提出了自动建立凸多边形和直角多边形拓扑关系的算法。 相似文献
6.
分析机载LiDAR点云与影像数据特点,提出了一种建筑物点云与配准后影像相结合的建筑物轮廓信息提取方法。首先,采用α-shapes算法从点云中提取粗糙的建筑物轮廓多边形;然后,采用基于线支撑区域的直线段提取算法从影像中提取边缘信息,并利用投票机制,以点到直线的距离为因子,从中过滤出真实的建筑物边界;最后,提出一种建筑物轮廓精化的新方法,利用从影像中提取的边缘信息修正从点云中提取的粗糙轮廓,并对修正后的轮廓采用道格拉斯-普克算法去除冗余节点,采用强制相交方法恢复建筑物转角,最终得到了准确的建筑物外轮廓多边形,并通过实验验证了该方法的有效性。 相似文献
7.
8.
9.
10.
提出一种利用POS辅助多视角倾斜影像匹配的算法。首先,利用POS数据对倾斜影像进行近似核线纠正;然后,用SIFTGPU算法对纠正影像进行特征匹配,根据匹配结果计算出两张影像的水平和垂直方向视差进而求得其近似重叠区域;将重叠区域进行分块特征匹配,采用比值提纯法、视差约束和RANSAC算法等约束条件剔除误匹配;最后,将匹配结果通过POS数据反算回到原始影像上。试验结果表明,将POS数据应用到多视角倾斜影像匹配中,可快速获得比常规影像匹配方法数量更多、分布更均匀的匹配点。 相似文献
11.
Existing methods of spatial data clustering have focused on point data, whose similarity can be easily defined. Due to the complex shapes and alignments of polygons, the similarity between non‐overlapping polygons is important to cluster polygons. This study attempts to present an efficient method to discover clustering patterns of polygons by incorporating spatial cognition principles and multilevel graph partition. Based on spatial cognition on spatial similarity of polygons, four new similarity criteria (i.e. the distance, connectivity, size and shape) are developed to measure the similarity between polygons, and used to visually distinguish those polygons belonging to the same clusters from those to different clusters. The clustering method with multilevel graph‐partition first coarsens the graph of polygons at multiple levels, using the four defined similarities to find clusters with maximum similarity among polygons in the same clusters, then refines the obtained clusters by keeping minimum similarity between different clusters. The presented method is a general algorithm for discovering clustering patterns of polygons and can satisfy various demands by changing the weights of distance, connectivity, size and shape in spatial similarity. The presented method is tested by clustering residential areas and buildings, and the results demonstrate its usefulness and universality. 相似文献
12.
13.
14.
提出了一种符合空间认知规律的栅格化处理的任意多边形间方向关系的计算方法，该方法计算结果与人眼的判断结果非常接近，在此基础上讨论了多边形间方向关系的可确定问题，并提出了一种基于8方向隶属零值个数的两个多边形方向关系可确定程度的判定方法。 相似文献
15.
Polygonal object is a fundamental type of geometric data in vector GIS. The key step cleaning topological relationship after data collection of polygonal layer is to build polygonal objects from digital arcs. The raw digital arcs may intersect with each other. The algorithm for building polygonal objects after the raw arcs have been split at all intersections is presented. The build-up of polygonal objects in this paper is designed to be implemented by two steps. The first step is to extract all the polygons needed for build-up of polygonal objects from arcs. The second step is to organize polygonal objects from these polygons. For the first step, a tracing algorithm is proposed. The algorithm merely extracts the polygons needed for the build-up of polygonal objects, which is a subset of all the possible polygons that can be induced from the arcs. For the second step, an algorithm based on a specially designed order of polygons is advanced. All the topological relationships among the polygons are shown in a single scan. Experiments show that the two algorithms together offer a robust and efficient solution for building polygonal objects from intersected arcs. 相似文献
16.
WU HuayiWANG YandongGONG Jianya WU Huayi Associate Professor National Laooratory for momation tngineering in Surveying Mapping Remote Sensing Luoyu Road 《地球空间信息科学学报》1999,2(1):63-67
Polygonal object is a fundamental type of geometric data in vector GIS. The key step of cleaning topological relationship after data collection of polygonal layer is to build polygonal objects from digital arcs. The raw digital arcs may intersect with each other. The algorithm for building polygonal objects after the raw arcs have been split at all intersections is presented. The build-up of polygonal objects in this paper is designed to be implemented by two steps. The first step is to extract all the polygons needed for build-up of polygonal objects from arcs. The second step is to organize polygonal objects from these polygons. For the first step, a tracing algorithm is proposed. The algorithm merely extracts the polygons needed for the build-up of polygonal objects, which is a subset of all the possible polygons that can be induced from the arcs. For the second step, an algorithm based on a specially designed order of polygons is advanced. All the topological relationships among the polygons are sho 相似文献
17.
目前在空间关系查询中常用的Plane Sweep算法是一种串行算法,在处理海量空间数据时效率较低,而已有的并行计算方法对于普通的计算机并不适用。本文针对这个问题,提出了一种多边形间空间关系查询的异构多核架构并行算法,该算法先利用STR树索引过滤掉不相交的多边形,然后将过滤后的多边形数据集合分解为点集合和边集合,并对其构建四叉树索引;在保证数据浮点运算精度符合要求的情况下,利用GPU强大的批量运算能力快速处理边与边的相交情况并据此逐步计算得到环间的拓扑关系,再根据环间拓扑关系计算得到多边形间的维度扩展九交模型(DE-9IM)参数值;根据DE-9IM参数值与空间关系查询条件相比对,输出查询结果。最后通过试验验证了算法的准确性与高效性。 相似文献
18.
The demand for analysis of large‐scale data has increased with increased access to spatial vector data. Polygon overlay of vector data in a virtual globe requires proprietary data structures and proprietary analysis algorithms. A vector data structure is designed for rapid polygon overlay in a virtual globe by recording the metadata of the triangles (TriMeta) that constitute polygons. A polygon overlay algorithm is proposed based on this data structure. The overlay of two complex GIS polygons is transformed into the intersection computation of their 3D triangular presentations. The intersection computation of two sets of triangles is reduced considerably by utilizing TriMeta to filter out the disjoint triangle pairs and rapidly identify the contained triangle. The new method improves the overlay efficiency in a virtual globe because the amount of computation required to calculate the intersections of two large polygons and drape the intersections onto a terrain surface is reduced. 相似文献
19.
20.
建筑物白模多边形数据可广泛应用于许多领域,但在实际应用中,由于数据太过细致,且目前使用的建筑物白模多边形数据存在拓扑关系错误,不满足生产要求,这给地图综合中建筑物群的自动合并提出了新的要求。因此提出了一种基于约束性Delaunay三角网的建筑物白模多边形自动合并方法,在保持建筑物整体结构和视觉效果的前提下减少不必要的细节。该方法能够消除原始建筑物图形数据中的空间拓扑关系错误,并对建筑物白模多边形进行一致性处理,有利于独栋整体建筑物的三维可视化。并用C#编程语言开发桌面应用程序对该方法进行了实现,通过和ArcGIS建筑物综合工具的建筑物群合并结果进行对比分析,验证了该方法的有效性和实用性。 相似文献