Geostatistical simulation of random fields with bivariate isofactorial distributions by adding mosaic models

This work deals with the geostatistical simulation of a family of stationary random field models with bivariate isofactorial distributions. Such models are defined as the sum of independent random fields with mosaic-type bivariate distributions and infinitely divisible univariate distributions. For practical applications, dead leaf tessellations are used since they provide a wide range of models and allow conditioning the realizations to a set of data via an iterative procedure (simulated annealing). The model parameters can be determined by comparing the data variogram and madogram, and enable to control the spatial connectivity of the extreme values in the realizations. An illustration to a forest dataset is presented, for which a negative binomial model is used to characterize the distribution of coniferous trees over a wooded area.     

一种快速二维 Delaunay 三角网点定位算法

在构建二维Delaunay三角网的逐点插入法中,定位待插点所在三角形的快慢是影响整个算法构网速度的关键因素。针对目前已有算法存在的搜索路径长、搜索路径求解计算量大等问题,结合三角形重心的几何性质,对点定位算法进行改进,避免求三角形重心和相交边的过程。实验结果表明,文中算法较目前其他点定位算法能够有效地缩短搜索路径,减少点定位的计算时间,提高Delaunay三角网构网过程中点定位的效率。     

Tessellations in GIS: Part II–making changes

Abstract

We attempt to describe the role of tessellated models of space within the discipline of Geographic Information Systems (GIS) – a speciality coming largely out of Geography and Land Surveying, where there was a strong need to represent information about the land’s surface within a computer system rather than on the original paper maps. We look at some of the basic operations in GIS, including dynamic and kinetic applications. We examine issues of topology and data structures, and produced a tessellation model that may be widely applied both to traditional “object” and “field” data types. The Part I of this study examined object and field spatial models, the Voronoi extension of objects, and the graphs that express the resulting adjacencies. The required data structures were also briefly described, along with 2D and 3D structures and hierarchical indexing. The importance of graph duality was emphasized. Here, this second paper builds on the structures described in the first, and examines how these may be modified: change may often be associated with either viewpoint or time. Incremental algorithms permit additional point insertion, and applications involving the addition of skeleton points, for map scanning, contour enrichment or watershed delineation and simulation. Dynamic algorithms permit skeleton smoothing, and higher order Voronoi diagram applications, including Sibson interpolation. Kinetic algorithms allow collision detection applications, free-Lagrange flow modeling, and pen movement simulation for map drawing. If desired these methods may be extended to 3D. Based on this framework, it can be argued that tessellation models are fundamental to our understanding and processing of geographical space, and provide a coherent framework for understanding the “space” in which we exist.     

结合MST划分和RHMRF-FCM算法的高分辨率遥感图像分割

针对基于像素的HMRF-FCM算法抗噪性差以及对地物复杂边界分割精度低的问题,提出一种结合形状信息的静态MST区域划分和RHMRF-FCM算法的高分辨率遥感图像分割方法。该方法定义一种静态MST同质区域划分准则,借助MST能较好表达边界和形状信息、能较好抑制几何噪声的特点,解决地物复杂边界的表达和降低分割结果中几何噪声问题。首先,利用MST静态划分将图像域划分成若干个均质区域,假设每个均质区域内光谱测度服从独立同一的多元高斯分布。然后,在此基础上构建了区域隐马尔可夫随机场模型,以及建立基于信息熵和KL信息正则化项的模糊聚类目标函数。最后,采用偏微分方法对分割模型参数进行求解,从而得到全局最优分割结果。为验证本文方法,对WorldView-3高分遥感图像进行分割试验。定性、定量分析了尺度参数、光谱相似性参数和区域紧致度参数对最优分割结果的影响,并对比分析本文算法和eCognition软件中的多分辨率分割算法、分水岭算法。     

一种高阶Delaunay三角网生成算法

Delaunay三角剖分是构建数字地形模型的有效方法,但是该方法可能产生人工大坝和局部极小问题,使得地形模型不能很好地反映原始地形的真实面貌。本文在Delaunay三角网的基础上引入了高阶Delaunay三角网,并给出了一种高阶Delaunay三角网生成算法。实验表明,高阶Delaunay三角网能够有效地减少地形的局部极小数量,是建立数字高程模型的一种新方法。因此,采用高阶Delaunay三角网建立的地形模型更接近于实际地形。     

Delaunay三角网内插特征点算法研究

在Delaunay三角剖分网的基础上，对内插特征点算法进行了研究，提出了一种快速内插点算法。根据本算法的特点，提出了一种快速确定点所在的三角形的方法。     

一种改进的Delaunay三角化算法研究

Delaunay三角化在诸多应用领域具有极其广泛用途,也一直是计算机图形图像学和科学计算可视化技术的重要研究内容。针对二维约束Delaunay三角化问题,提出一种快速生成算法。该算法首先建立环形矩形,分环分治平面散乱点;然后依据Delaunay三角形的性质,从外环到内环分治逐步插入新点,一环插入完毕后,整理有效Delaunay三角形;依次循环快速生成二维约束Delaunay三角网格。本算法计算过程简单,计算效率高,程序编写十分容易无需复杂的递归过程,技巧性地解决了二维约束Delaunay三角化问题。实例证明,该算法具有较好的应用效果。     

基于等高线构建TIN模型的平三角形修正算法

设计了一种平三角形修正算法来修正TIN模型中可能出现的平三角形区域。该算法通过对由平三角形组成的区域进行分类,并针对不同的平区域采用交换边、增加点甚至不处理的修正方法,同时对由于等高线数据错误产生的一些特殊情况进行了分析处理。实验结果表明,该算法能够去除约束型狄洛尼三角网中所有应修正的平三角形,并生成对地形描述更为精确的三角网。     

室内楼层平面导航路网模型的自动生成

室内路网模型作为室内导航研究的基础,如何自动生成室内路网模型成为近年的研究热点。对于目前自动路网模型研究中出现的复杂环境适应度不够的问题,本文提出了一种室内楼层平面路网模型的自动提取方法。它将室内空间分为公共空间和专属空间两类,从而形成公共空间路径和专属空间路径,并用转换点将两类路径进行衔接;最终利用提取的公共空间路径、专属空间路径和连接路径构成楼层平面导航路网模型。基于此方法,将某学校教学楼一层建筑平面图生成平面自动路网模型,并从路径完整度、准确度及寻路情况3个方面与手动路网模型进行了对比分析,其表现良好。     

Data selection using support vector regression

Geophysical data sets are growing at an ever-increasing rate, requiring computationally efficient data selection(thinning)methods to preserve essential information. Satellites, such as Wind Sat, provide large data sets for assessing the accuracy and computational efficiency of data selection techniques. A new data thinning technique, based on support vector regression(SVR), is developed and tested. To manage large on-line satellite data streams, observations from Wind Sat are formed into subsets by Voronoi tessellation and then each is thinned by SVR(TSVR). Three experiments are performed. The first confirms the viability of TSVR for a relatively small sample, comparing it to several commonly used data thinning methods(random selection, averaging and Barnes filtering), producing a 10% thinning rate(90% data reduction), low mean absolute errors(MAE) and large correlations with the original data. A second experiment, using a larger dataset, shows TSVR retrievals with MAE < 1 m s-1and correlations 0.98. TSVR was an order of magnitude faster than the commonly used thinning methods. A third experiment applies a two-stage pipeline to TSVR, to accommodate online data. The pipeline subsets reconstruct the wind field with the same accuracy as the second experiment, is an order of magnitude faster than the nonpipeline TSVR. Therefore, pipeline TSVR is two orders of magnitude faster than commonly used thinning methods that ingest the entire data set. This study demonstrates that TSVR pipeline thinning is an accurate and computationally efficient alternative to commonly used data selection techniques.