机载LiDAR和高光谱数据融合提取冰川雪线

以西藏那曲县境内的“中习一号”冰川为研究区,对2011年8月获取的机载激光雷达点云进行预处理和滤波分类,提取研究区数字高程模型(digital elevation model,DEM);将DEM数据分别与同期获取的机载高光谱栅格数据和提取出的冰川矢量数据进行三维地形模拟,利用DEM数据对高光谱最大似然法分类结果进行正射纠正,从而获取研究区的数字正射影像(digital orthophoto map,DOM);最后结合研究区DOM和机载点云数据提取“中习一号”冰川的雪线.结果表明:融合机载高光谱和机载激光雷达2种数据的优势,能更方便地提取出冰川雪线,而且能很好地显示雪线的高度.     

青藏高原近30年现代雪线遥感调查

通过对青藏高原现代冰川分布区ETM遥感图像的分析研究,提出了利用遥感图像确定现代雪线高度的方法;基本查明了青藏高原各山系的现代雪线高度,以及近30 a来现代雪线高度的变化状况。调查结果显示:青藏高原现代雪线高度在4000~6000 m,并呈现自东向西逐渐升高的分布规律;青藏高原现代雪线有上升、下降和基本不变3种变化方式,以上升为主,且与现代冰川的演变关系密切。     

基于特征的影象匹配：第二讲数字图象边缘提取

上一讲我们介绍了从数字图象提取点特征的算法。指出当摄影机方位未知时,需要采用在二维区域上沿x,y两个方向搜索同名象点的二维匹配方式对两张共轭图象进行匹配,或者仅匹配为数不多但呈一定分布的特征点,求得其上下视差,然后按照摄影测量之相对定向理论解得摄影机之相对方位,从而可将不同形式的几何约束引进匹配之     

雪线时空分布及与地形因子相关性分析

采用青海玉珠峰1998、2010、2013、2015年7月份四期SPOT5及QuickBird遥感影像(1998年为航片),解译冰雪范围线,对冰雪覆盖区域的时空变化特征进行分析。获取2013年雪线高程,利用30 m分辨率的SRTM-DEM提取坡度、地形曲率、地形起伏度等地形因子。在气温、降水条件基本相同的情况下,对不同的海拔范围采用回归分析推算雪线高程与地形因子的相关关系。结果表明,随着海拔的升高,雪线高程与地形因子的相关性有逐步增强的趋势。当海拔达到约5 500 m时,雪线高程与坡度、地形起伏度、剖面曲率、平面曲率的相关系数分别为0.509、0.517、0.141、0.221,地形起伏度与坡度是对雪线分布影响相对较大的地形因子。     

基于DEM的水系自动提取算法研究

基于数字高程模型（DEM）的水文信息自动提取,是进行水文模型研究的重要组成部分,利用 DEM数据进行快速而正确的提取信息将大大提高水文模型的应用效率,为更好地完成水文、地质分析提供保证。对利用DEM获取水文信息的洼地填充算法、水流方向计算算法进行分析研究,并通过编程加以实现,最后将水系提取进行了测试,与ARCGIS中的实现结果对比,结果较一致、实现效率较高。     

数字表面模型的建筑物容积率提取

针对阴影长度和阴影面积法计算建筑物容积率误差较大的情况,该文利用航空影像密集匹配生成的点云数据逐点内插生成数字表面模型,提取建筑物三维信息,同时对于复杂建筑物屋顶,利用坡度滤波将其分割成为高度不同的面片,计算每一块屋顶的层数,从而得到较为准确的建筑总面积。实验证明,利用本文方法得到的建筑物容积率准确率高,且具有较高鲁棒性和使用价值。     

基于FME的DSM变化检测提取方法研究

本文基于FME平台,采用目标级变化检测方法,基于同一区域不同时相影像,设计了一个DSM变化检测范围提取的模板。对同一位置不同时相的DSM进行叠置,计算高程差值,得到变化的点,并通过高程差值阈值和面积阈值过滤后,进一步处理提取变化区域。该方法为大面积的DSM变化检测和地理国情监测提供了新的技术方法。     

输电线路的数字微地形自动提取方法

微地形是输电线路工程安全运行、电线积冰风险区划和线路建设期能耗计算等工作的重要基础,实现输电线路微地形的合理提取是复杂地形条件下电网工程建设的前提与保证。针对传统输电线路微地形提取存在决策知识模糊、主观因素影响大和缺少定量提取指标等问题,依据规程中微地形分类体系,提出了以地形位置指数、坡度、相对高程和水体距离为特征因子的组合表达输电线路微地形提取决策方案,利用数字地形分析技术建立了输电线路微地形自动提取方法。以2012—2018年某电网公司9条输电线路域栅格数字高程模型数据进行提取实验,实验结果与分析表明,所提方法能够有效提取垭口地形、高山地形、抬升地形、峡谷地形和水汽地形5类典型输电线路微地形,且揭示了微地形分布与线路灾害发生的相关性,可为电网建设可行性论证、线路精细化设计等提供技术支持。     

基于DEM提取水系的洼地处理新算法

对洼地积水问题进行了深入研究,从洼地处理和平地处理着手提出了新的解决思路,并在Visual Studio2005平台下,采用ArcGIS Engine组件开发了试验模块,并通过试验数据进行水系的提取。对比发现,算法提取的水系比ArcGIS填平预处理后提取的水系更加连续,且与原始DEM地形在三维显示状态下可以很好地拟合。     

基于模糊理论的智能最优路径算法

在经典Dijkstra算法原理的基础上,提出基于模糊理论的智能最优路径算法.该算法综合考虑静态交通信息、动态交通信息和人的主观因素等路径选择的影响因素,建立路径选取度模型,确定影响因素的隶属度函数.该方法能够根据用户出行的不同目的和需求,自动调整各影响因素之间的权重,从而使路径选择既能满足用户的主观要求,又能真实反映复...     

基于电子地图和Dijkstra算法路径规划的实现

随着城市化水平的提高,人们在道路选择问题上可能需要考虑的并非仅仅是"空间距离"的最短,还有"时间最短",本文应用Dijkstra算法解决城市中出行交通道路选择的问题,对距离最短和时间最短路径分别进行讨论,用VB语言实现算法,并且在电子地图上绘制出所求出的路径,以便人们更直接地观看到结果,基本上解决了道路选择问题。     

基于非线性判别分析的高光谱影像特征提取

高光谱遥感影像丰富的光谱信息有利于深入挖掘目标的理化特性,精细识别不同目标间的细微差异。为了提高影像分类识别的精度与速度需要对光谱信息进行特征提取。基于核函数的判别分析能够在数据中提取非线性特征,本文将其应用到高光谱影像分类的特征提取中,并进行了最小距离分类实验取得理想结果。     

Building extraction from LIDAR based semantic analysis

Extraction of buildings from LIDAR data has been an active research field in recent years. A scheme for building detection and reconstruction from LIDAR data is presented with an object-oriented method which is based on the buildings' semantic rules. Two key steps are discussed: how to group the discrete LIDAR points into single objects and how to establish the buildings' semantic rules. In the end, the buildings are reconstructed in 3D form and three common parametric building models (flat, gabled, hipped) are implemented.     

最优路径的无人机影像拼接

SIFT算法是基于尺度空间的特征匹配方法,该算法为每个关键点指定了方向参数,具备旋转不变性,对图像倾斜的适应性很强.本文采用SIFT算法对无人机图像提取特征点,利用欧氏距离粗匹配,通过距离中误差精匹配.在对拼接误差原因分析的基础上,提出了采用最优路径的拼接方法来降低误差.     

基于ArcGIS Server的最优路径分析方法研究

网络分析是GIS空间分析技术的重要组成部分,与其他空间分析技术相比,网络分析无论是在对数据质量的要求,还是在算法的具体实现上,都具有一定的技术难度。本文首先对网络分析技术作了简要的介绍,然后对在ArcGIS平台下网络分析技术的实现方式作了剖析,最后给出了2种在ArcGIS Server环境下实现最优路径分析的关键技术方案,并对2种技术进行了对比和总结。     

Building Extraction from LIDAR Based Semantic Analysis

IntroductionThanks to a large number of applications ,suchas map updating, urban planning or land useanalysis ,extraction of artificial objects ,such asbuildings ,roads fromthei mages has been an ac-tive research field for many years . Since build-ings ar…     

A fewest-turn-and-shortest path algorithm based on breadth-first search

Many cognitive studies have indicated that the path simplicity may be as important as its distance travelled. However, the optimality of paths for current navigation system is often judged purely on the distance travelled or time cost, and not the path simplicity. To balance these factors, this paper presented an algorithm to compute a path that not only possesses fewest turns but also is as short as possible by utilizing the breadth-first-search strategy. The proposed algorithm started searching from a starting point, and expanded layer by layer through searching zero-level reachable points until the endpoint is found, and then deleted unnecessary points in the reverse direction. The forward searching and backward cleaning strategies were presented to build a hierarchical graph of zero-level reachable points, and form a fewest-turn-path graph (G*). After that, a classic Dijkstra shortest path algorithm was executed on the G* to obtain a fewest-turn-and-shortest path. Comparing with the shortest path in Baidu map, the algorithm in this work has less than half of the turns but the nearly same length. The proposed fewest-turn-and-shortest path algorithm is proved to be more suitable for human beings according to human cognition research.     

基于典型事例推理的路径规划方法研究

Case-based reasoning is an AI technique in which the previous solutions are stored for future use. People are used to guiding themselves according to those routes that are stored in their memories and have been used by them before. It is just based on people’s preference to familiar routes, which are gained through the study of the cognitive activities. We propose to apply the intelligent method based on the case reasoning to path planning. It is impossible for a case base to store all the solutions to all the shortest paths; therefore, part of them should be stored. However, which routes should be stored and which should not be? How do we adapt the cases that have already been stored and how do we acquire the shortest route based on them? All these issues need to be explained by integrating knowledge of the network on account of case-based reasoning techniques. This paper suggests the case-based reasoning in another point. This means finding some irreplaceable links on the basis of the complete analysis of the problems space, which are called the must_be_passed link between the source and destination. Merely compute the shortest path case from those best exit/entry nodes of the grids to the irreplaceable links, and then add them into the case base storing for future use. This method is based on case-based reasoning technique and completely considers the properties of the problem space. In addition to the use of knowledge of the natural grid in the route network, this method is more efficient than existing algorithms on computing efficiency.