地铁隧道三维激光扫描数据配准方法

针对传统的迭代最近点算法(ICP)用于多测站点云数据配准时计算效率低的问题,该文提出了一种基于特征点的ICP改进算法,该方法利用相邻两测站数据进行配准的实现。首先采用体素化格网方法对两点云数据集进行精简处理,并计算精简处理后每一点的法向量;然后利用kd-tree最近邻查询搜索特征点之间的对应关系;并通过估计出的最优变换矩阵更新至全局变换,以提高配准精度。实验结果表明,改进的ICP算法在地铁隧道点云数据配准中的效率高于其他的配准方法,为隧道变形监测工作的进行提供保证。     

实现栅格图形和图像数据矢量化提取的游程轮廓追踪法

提出一种直接利用栅格图形游程编码进行图斑边界多边形矢量化提取的有效方法。对遥感图像专题信息和栅格型地理空间分析结果的矢量化提取是GIS的重要手段 ,栅格数据结构可简化解决叠置分析等一类空间分析问题 ,其中需要高效矢量化技术的支撑。本方法充分利用栅格游程编码所具有的可操作性强、检索和转换便捷、隐含横向差异信息、可处理高精度和大规格图形和图像等特征 ,定义了“上邻游程”和“下邻游程” ,并采用相应有效查找算法和基于游程轮廓追踪的矢量化技术 ,使得计算机处理栅格数据矢量化的规模、精度和效率明显提高 ,可广泛应用于栅格型地理空间分析和遥感图像处理等方面。     

Karst database implementation in Minnesota: analysis of sinkhole distribution

This paper presents the overall sinkhole distributions and conducts hypothesis tests of sinkhole distributions and sinkhole formation using data stored in the Karst Feature Database (KFD) of Minnesota. Nearest neighbor analysis (NNA) was extended to include different orders of NNA, different scales of concentrated zones of sinkholes, and directions to the nearest sinkholes. The statistical results, along with the sinkhole density distribution, indicate that sinkholes tend to form in highly concentrated zones instead of scattered individuals. The pattern changes from clustered to random to regular as the scale of the analysis decreases from 10–100 km² to 5–30 km² to 2–10 km². Hypotheses that may explain this phenomenon are: (1) areas in the highly concentrated zones of sinkholes have similar geologic and topographical settings that favor sinkhole formation; (2) existing sinkholes change the hydraulic gradient in the surrounding area and increase the solution and erosional processes that eventually form more new sinkholes.     

Spatial statistical techniques for aggregating point objects extracted from high spatial resolution remotely sensed imagery

 Using a local maximum filter, individual trees were extracted from a 1 m spatial resolution IKONOS image and represented as points. The spatial pattern of individual trees was determined to represent forest age (a surrogate for forest structure). Point attributes, based on the spatial pattern of trees, were generated via nearest neighbour statistics and used as the basis for aggregating points into forest structure units. The forest structure units allowed for the mapping of a forested area into one of three age categories: young (1–20 years), intermediate (21–120 years), and mature (>120 years). This research indicates a new approach to image processing, where objects generated from the processing of image data (rather than pixels or spectral values) are subjected to spatial statistical analysis to estimate an attribute relating an aspect of forest structure. Received: 22 April 2002 / Accepted: 23 November 2002     

基于DEM数据的古沉积面的重建方法 ——以青藏高原东北缘青海贵德盆地为例

广泛使用的数字高程模型（DEM）数据使得古沉积面的恢复成为可能。以青藏高原东北缘的青海贵德盆地为例,分析对比了前人获取代表古沉积面地表露头样本数据的几种方法．提出了插值样本应选择露头中代表原始沉积地层的顶面点的优选方法,并提取了更新统地表露头顶面点的样本数据。通过分析样本的特征、比较插值的结果,选择了自然邻点法进行插值预测,重建了贵德盆地更新统的古沉积面。正确样本,最的提取加上合适插值算法的选择．优化了重建的古沉积面。     

Parallel computing solutions for Markov chain spatial sequential simulation of categorical fields

The Markov chain random field (MCRF) model is a spatial statistical approach for modeling categorical spatial variables in multiple dimensions. However, this approach tends to be computationally costly when dealing with large data sets because of its sequential simulation processes. Therefore, improving its computational efficiency is necessary in order to run this model on larger sizes of spatial data. In this study, we suggested four parallel computing solutions by using both central processing unit (CPU) and graphics processing unit (GPU) for executing the sequential simulation algorithm of the MCRF model, and compared them with the nonparallel computing solution on computation time spent for a land cover post-classification. The four parallel computing solutions are: (1) multicore processor parallel computing (MP), (2) parallel computing by GPU-accelerated nearest neighbor searching (GNNS), (3) MP with GPU-accelerated nearest neighbor searching (MP-GNNS), and (4) parallel computing by GPU-accelerated approximation and GPU-accelerated nearest neighbor searching (GA-GNNS). Experimental results indicated that all of the four parallel computing solutions are at least 1.8× faster than the nonparallel solution. Particularly, the GA-GNNS solution with 512 threads per block is around 83× faster than the nonparallel solution when conducting a land cover post-classification with a remotely sensed image of 1000?×?1000 pixels.     

Quantifying the vertical distribution pattern of land-use conversion in the loess hilly region of northern Shaanxi Province 1995–2015

Journal of Geographical Sciences - The mountainous and hilly region plays an important role in ecological safety and production in China. However, recent studies have poorly characterized the...     

集成GIS的元胞自动机在城市扩展模拟中的应用

元胞自动机CA(Cellular Automata)是一种"自下而上"的动态模拟模型,具有模拟城市复杂系统时空演化过程的能力。CA和GIS的集成使二者在时空建模方面相互补充,能使CA模拟结果可视化显示。这里以郑州市为例,设计了城市CA模型,借助VB 6.0和MapX 5.0建立了一个与GIS无缝集成的2维CA模拟系统,并结合郑州市2005~2007年遥感影像图和土地利用图,对郑东新区进行了模拟,取得较好的效果。     

空间最近目标查找算法分析及其高性能Web实现

讨论了空间最近目标查找的基本算法和相关的空间索引机制,简单地比较了几种算法和索引机制的优缺点.详细地介绍了在Windows IIS和.Net下,建立多级空间格网索引,实现空间最近目标查找的实现方法.     

径向基函数神经网络需水预测研究

在分析山西省历年用水量和人均用水量的基础上，建立径向基函数神经网络需水预测模型，采用最近邻聚类学习算法确定径向基函数的宽度、选取聚类中心和权值。采用丰富的需水预测因子作为模型的输入，网络输出需水预测值。预测结果表明，径向基函数神经网络需水预测模型运算速度快，有较高的预测精度。需水预测可为水资源规划和配置提供依据。