激光雷达点云电力线自动提取算法

针对当前电力线提取方法自动化程度和精度不高的问题,本文从点云数据的空间分布特征出发,提出了一种高效的电力线自动提取方法.首先基于自然裂点法,将点云数据按高程分类后去除地面点;然后对数据进行空间划分,基于子空间的点密度及空间结构特征的差异化,利用地物分割算法去除电塔点和残留的植被点;最后利用基于欧氏距离分割的电力线自动检...     

PTrees: A point-based approach to forest tree extraction from lidar data

This paper introduces PTrees, a multi-scale dynamic point cloud segmentation dedicated to forest tree extraction from lidar point clouds. The method process the point data using the raw elevation values (Z) and compute height (H = Z − ground elevation) during post-processing using an innovative procedure allowing to preserve the geometry of crown points. Multiple segmentations are done at different scales. Segmentation criteria are then applied to dynamically select the best set of apices from the tree segments extracted at the various scales. The selected set of apices is then used to generate a final segmentation. PTrees has been tested in 3 different forest types, allowing to detect 82% of the trees with under 10% of false detection rate. Future development will integrate crown profile estimation during the segmentation process in order to both maximize the detection of suppressed trees and minimize false detections.     

A multi-index learning approach for classification of high-resolution remotely sensed images over urban areas

In recent years, it has been widely agreed that spatial features derived from textural, structural, and object-based methods are important information sources to complement spectral properties for accurate urban classification of high-resolution imagery. However, the spatial features always refer to a series of parameters, such as scales, directions, and statistical measures, leading to high-dimensional feature space. The high-dimensional space is almost impractical to deal with considering the huge storage and computational cost while processing high-resolution images. To this aim, we propose a novel multi-index learning (MIL) method, where a set of low-dimensional information indices is used to represent the complex geospatial scenes in high-resolution images. Specifically, two categories of indices are proposed in the study: (1) Primitive indices (PI): High-resolution urban scenes are represented using a group of primitives (e.g., building/shadow/vegetation) that are calculated automatically and rapidly; (2) Variation indices (VI): A couple of spectral and spatial variation indices are proposed based on the 3D wavelet transformation in order to describe the local variation in the joint spectral-spatial domains. In this way, urban landscapes can be decomposed into a set of low-dimensional and semantic indices replacing the high-dimensional but low-level features (e.g., textures). The information indices are then learned via the multi-kernel support vector machines. The proposed MIL method is evaluated using various high-resolution images including GeoEye-1, QuickBird, WorldView-2, and ZY-3, as well as an elaborate comparison to the state-of-the-art image classification algorithms such as object-based analysis, and spectral-spatial approaches based on textural and morphological features. It is revealed that the MIL method is able to achieve promising results with a low-dimensional feature space, and, provide a practical strategy for processing large-scale high-resolution images.     

基于CIPS软件探讨高山地DOM数据的生产方式

在DOM数据生产中,山地、高山地数据一直以来都是重点和难点。本文分析了高山地影像数据的特点,提出一种与山地、高山地数据相适应的处理方式。最后基于CIPS软件,按需求设计对应的软件处理流程,并使用满足实验要求的高山地影像数据,对这种方式加以实现和验证。     

车载激光扫描数据分类支持下的路面数据提取

车载激光扫描系统可以快速采集道路及两旁的建筑物、植被、电杆等地物的点云数据,而点云数据的分类提取是车载激光扫描系统应用的关键。本文选用全景激光移动测量系统获取的激光点云数据,分析了路面点云数据的特征,采用渐进格网法进行了路面点云数据的提取研究;通过试验区的实例验证,取得了较好的分类效果。     

运用GVF Snake算法提取水域的不规则边界

GVF Snake是一种改进型主动轮廓提取算法。本文在详细介绍GVF Snake原理的基础上,重点对GVF Snake的内、外部约束力在边界提取中的作用以及初始边界对提取结果的影响进行了实验研究,提出了初始边界和内部约束力权值的合理设置方法,设计并实现了交互式GVF Snake算法,并用于提取遥感影像上水域的不规则边界。该算法采用种子点区域生长法自动给出水域的初始边界,采用人机交互法设置内部约束力权值,然后运用GVF Snake算法搜索水域的实际边界。实验表明：对于形状极不规则的水域,交互式GVF Snake算法也能方便、快速、准确地获取其边界。     

Temporal replication of the national land cover database using active machine learning

Regional and national level land cover datasets, such as the National Land Cover Database (NLCD) in the United States, have become an important resource in physical and social science research. Updates to the NLCD have been conducted every 5 years since 2001; however, the procedure for producing a new release is labor-intensive and time-consuming, taking 3 or 4 years to complete. Furthermore, in most countries very few, if any, such releases exist, and thus there is high demand for efficient production of land cover data at different points in time. In this paper, an active machine learning framework for temporal updating (or backcasting) of land cover data is proposed and tested for three study sites covered by the NLCD. The approach employs a maximum entropy classifier to extract information from one Landsat image using the NLCD, and then replicate the classification on a Landsat image for the same geographic extent from a different point in time to create land cover data of similar quality. Results show that this framework can effectively replicate the land cover database in the temporal domain with similar levels of overall and within class agreement when compared against high resolution reference land cover datasets. These results demonstrate that the land cover information encapsulated in the NLCD can effectively be extracted using solely Landsat imagery for replication purposes. The algorithm is fully automated and scalable for applications at landscape and regional scales for multiple points in time.     

一种新的窗户特征提取方法研究

在建筑物立面重建中,窗户提取、结构识别是学者们研究的热点。针对建筑物特征提取的应用需求,文中提出一种基于局部搜索算法——爬山法的窗户信息提取方法,介绍研究中采用的一些原理、方法,从而可以准确有效地从激光扫描数据中提取出建筑物的窗户信息。利用本方案对地面激光扫描系统获取的建筑物实验数据进行具体的处理,并给出可视化表达结果。     

全局局部细节感知条件随机场的高分辨率遥感影像建筑物提取

条件随机场模型由于其较强的上下文信息建模能力,被广泛应用于建筑物提取任务中。然而,面对高分辨率遥感影像丰富的地物信息,基于条件随机场的提取方法存在建筑物边界模糊的问题。本文提出了一种全局局部细节感知条件随机场框架,该框架提出全局局部一体化D-LinkNet,在有效利用多尺度建筑物信息的同时保留局部结构信息,解决了传统条件随机场一元势能丢失边界信息的问题。同时,该框架融合分割先验以缓解建筑物类内光谱差异较大的影响,利用更大尺度的上下文信息来精确提取建筑物,并引入局部类别标记代价从而保持细节信息以获取清晰的建筑物边界。实验结果表明,该框架在WHU卫星和航空数据集上的精度评价指标均优于其他对比方法,其IoU分别达89.82%和91.72%,对于复杂场景下的建筑物信息能够获得较好的提取效果。     

求解GM(1,1)模型新总体最小二乘算法

在GM(1,1)模型中系数矩阵和观测向量都是由原始序列组成的。系数矩阵中同样是有误差的,与观测向量中的误差一样,亦来源于原始序列,即它们误差同源。不同位置的相同元素应该有相同的改正数,采用传统总体最小二乘求解则不能达到此目的。针对这一缺陷,推导了一种新的总体最小二乘算法;并且通过算例验证了新方法的可行性和有效性。