共查询到20条相似文献,搜索用时 109 毫秒
1.
王珍 《测绘与空间地理信息》2015,(3):121-124
分析GPS网三维无约束平差和二维约束平差的理论模型,根据GPS网三维无约束平差和二维约束平差的特性,对地铁5号线GPS网平差结果和交叉线路的GPS控制点较差进行了对比分析,并给出地铁5号线与交叉线路平面控制衔接的合理解决方案。 相似文献
2.
3.
分析了地图自动成图中斜坡坡面符号生成算法的基本原理,据此将斜坡分成梯形斜坡、矩形斜坡、倒梯形斜坡三种类型,并概括了他们的特点,介绍了已有的斜坡坡面符号生成算法及其优缺点,在此基础上,提出了一种基于约束Delaunay三角网的斜坡坡面符号生成算法,对预处理后的上下坡脚线建立约束Delaunay三角网,根据三角形组合的不同特点,将三角形的组合分类成两种类型,依次寻找匹配点,最后生成斜坡符号线。此算法避免了斜坡坡面符号线相交等情况,亦可用于栅栏等地图符号的自动生成。 相似文献
4.
多重约束下的建筑物阴影提取 总被引:6,自引:0,他引:6
在基于结构线一侧灰度统计法进行阴影检测的基础上,结合了灰度约束、几何约束、上下文约束和其他辅助信息,提出了一种多重约束下的建筑物阴影提取方法,实现了对建筑物阴影的提取,并利用IKONOS影像和航空像片进行了试验,证明该算法是有效而稳健的。 相似文献
5.
针对基于最近邻距离比率约束和几何条件约束的影像特征匹配方法,在处理重复纹理影像以及视角和尺度变化大的宽基线影像时,存在匹配正确率低和匹配点对数量少的问题,设计了结合运动平滑约束与核线约束的AKAZE特征匹配提纯算法。①为提高影像特征的不变性、显著性和时效性,采用AKAZE算子提取影像特征,经暴力匹配快速构建初始匹配集;②基于网格运动统计区分真假匹配,剔除不能满足运动平滑约束的匹配点对;③为消除局部相似特征引起的误匹配,采用核线约束提高匹配纯度。实验结果表明:所提算法实现了重复纹理影像、倾斜影像和宽基线影像同名点对的高精度匹配,增加了匹配点对数量,拓展了特征匹配的适用范围。 相似文献
6.
由于受到多重因素的影响,影像中提取的线特征经常出现断裂、变形、遮挡等问题。为克服上述问题对线特征匹配的影响,本文提出一种结合离散化描述与同名点约束的航空影像线特征匹配算法。算法首先利用单应性约束结合核线约束精简候选线特征数量;然后采用“以点代线”的方式,通过统计线上同名点的分布情况确定线特征初匹配结果;最后根据线特征与其邻域内同名点间的距离关系对匹配结果进行核验,以保证匹配的可靠性。选取AMC580相机系统所获得的航空影像进行线特征匹配试验,结果表明,本文算法匹配正确率高,匹配速度相对较快,并可实现曲线匹配及断裂线特征的多对多匹配。与已有匹配算法进行比较,本文算法在影像间存在有尺度、亮度、旋转变换等复杂条件下的匹配正确率均高于90%,具有较好的匹配稳定性。 相似文献
7.
8.
《武汉大学学报(信息科学版)》2015,(9)
地形特征线的正确拓扑表达是进行地表形态描述、地形拓扑简化和地貌综合的基础。传统的基于Morse复形从三角格网地形提取特征线的算法,存在山谷线与山脊线在正则点处"交叉"及无法识别"宏"鞍点等问题。本文利用Morse复形的对偶特征,提出了一种较为通用的改进算法。该算法将下降(或上升)Morse复形的边界作为提取其对偶复形边界的约束线,并使"宏鞍线"按相应已建复形边界线寻径,不仅消除了传统算法出现的"交叉"现象,而且能够识别"宏"鞍点,实现了整个地形特征线的完整构建。 相似文献
9.
10.
一种基于三角网约束的立体影像线特征多级匹配方法 总被引:1,自引:0,他引:1
针对直线匹配可靠性问题,提出了一种基于三角网约束的立体影像线特征多级匹配方法。首先采用SURF算法匹配一部分可靠的种子点,利用这些种子点约束其邻域内的直线匹配;然后,将这些种子点构建三角网,利用三角网约束直线匹配的搜索范围,进行三角网约束下的线-线匹配;再次,在三角网的约束下,进行线-面匹配。为了提高直线匹配相似性测度的可区分性,提出了基于移动窗口的自适应直线相关方法,不仅在表面非连续区域能取得可靠匹配,在纹理缺乏区域也能取得可靠匹配结果。利用具有典型纹理特征的近景影像和航空影像进行了试验分析,结果表明,本方法能获取可靠的直线匹配结果。 相似文献
11.
WANG Yanbing WU Lixin SHI Wenzhong 《地球空间信息科学学报》2007,10(3):208-212
Constrained Delaunay triangulated irregular network is one kind of dynamic data structures used in geosciences. The research on point and edges insertion in CD-TIN is the basis of its application. Comparing with the algorithms of points and constrained edge insertion, there are very a few researches on constrained edge deletion in CD-TIN. Based on the analysis of the polymorphism of constrained edge, virtual points are used to describe the intersection of constrained edges. A new algorithm is presented, called as influence domain retriangulating for virtual point (IDRVP), to delete constrained edges with virtual points. The algorithm is complete in topology. Finally, the algorithm is tested by some applications cases. 相似文献
12.
Constrained Delaunay triangulated irregular network is one kind of dynamic data structures used in geosciences. The research on point and edges insertion in CD-TIN is the basis of its application. Comparing with the algorithms of points and constrained edge insertion, there are very a few researches on constrained edge deletion in CD-TIN. Based on the analysis of the polymorphism of constrained edge, virtual points are used to describe the intersection of constrained edges. A new algorithm is presented, called as influence domain retriangulating for virtual point (IDRVP), to delete constrained edges with virtual points. The algorithm is complete in topology. Finally, the algorithm is tested by some applications cases. 相似文献
13.
14.
The problem of taking an unorganized point cloud in 3D space and fitting a polyhedral surface to those points is both important and difficult. Aiming at increasing applications of full three dimensional digital terrain surface modeling, a new algorithm for the automatic generation of three dimensional triangulated irregular network from a point cloud is proposed. Based on the local topological consistency test, a combined algorithm of constrained 3D Delaunay triangulation and region-growing is extended to ensure topologically correct reconstruction. This paper also introduced an efficient neighboring triangle location method by making full use of the surface normal information. Experimental results prove that this algorithm can efficiently obtain the most reasonable reconstructed mesh surface with arbitrary topology, wherein the automatically reconstructed surface has only small topological difference from the true surface. This algorithm has potential applications to virtual environments, computer vision, and so on. 相似文献
15.
首先将原始散点与约束点一起进行三角剖分,形成初始Delaunay三角网,然后再将各条约束线段通过局部更新,依次嵌入已存在的三角网中,从而生成带有约束折线的平面散点集的Delaunay三角剖分。该算法思路简捷,易于编程,生成的三角网形态优良。 相似文献
16.
17.
基于Delaunay三角网提取的骨架线是地图综合中广泛应用的一种空间剖分结构。改进了一种基于约束Delaunay三角网的地图目标群间骨架线提取算法,从程序设计的角度详细描述了算法的数据结构和控制流程。按照三角网中三角形包含约束边的数目,将三角形分为0、1、2、3四类,将0类、2类和单连通的1类三角形视为骨架线追踪的起点或终点,将双连通的1类作为中间通道,对整个三角网进行遍历。针对三角网中的环路、3类三角形等特殊情况,在改进的算法中提出了相应的处理方法。该算法成功地用于等高线的内插和街区地图目标群的邻近分析,验证了算法的可行性和健壮性。 相似文献
18.
利用线特征和SIFT点特征进行多源遥感影像配准 总被引:8,自引:3,他引:5
提出了一种基于线特征和SIFT点特征的多源遥感影像配准方法。该方法首先匹配待配准影像和参考影像中的线特征,利用匹配直线构建虚拟角点;其次,针对传统SIFT算法匹配多源遥感影像特征点存在的不足,采用线特征约束点特征的方法进行SIFT同名点对的提取;最后结合虚拟角点对及SIFT同名点对构建三角网进行小面元微分纠正。试验结果表明,本文方法能取得较高的配准精度。 相似文献
19.
A Spatial Anomaly Points and Regions Detection Method Using Multi‐Constrained Graphs and Local Density 下载免费PDF全文
Spatial anomalies may be single points or small regions whose non‐spatial attribute values are significantly inconsistent with those of their spatial neighborhoods. In this article, a S patial A nomaly P oints and R egions D etection method using multi‐constrained graphs and local density ( SAPRD for short) is proposed. The SAPRD algorithm first models spatial proximity relationships between spatial entities by constructing a Delaunay triangulation, the edges of which provide certain statistical characteristics. By considering the difference in non‐spatial attributes of adjacent spatial entities, two levels of non‐spatial attribute distance constraints are imposed to improve the proximity graph. This produces a series of sub‐graphs, and those with very few entities are identified as candidate spatial anomalies. Moreover, the spatial anomaly degree of each entity is calculated based on the local density. A spatial interpolation surface of the spatial anomaly degree is generated using the inverse distance weight, and this is utilized to reveal potential spatial anomalies and reflect their whole areal distribution. Experiments on both simulated and real‐life spatial databases demonstrate the effectiveness and practicability of the SAPRD algorithm. 相似文献
20.
航空影像特征匹配研究 总被引:7,自引:4,他引:7
基于格网和三角网的优点 ,提出了一种基于特征的影像松弛匹配方法。算法利用边缘提取算子提取影像特征信息 ,把提取的边缘特征点分配到预定的规则格网中进行登记 ,同时构建特征三角网 相似文献