Parallel algorithm for viewshed analysis on a modern GPU

Spatial analysis, including viewshed analysis, is an important aspect of the Digital Earth system. Viewshed analysis is usually performed on a large scale, so efficiency is important in any Digital Earth application making these calculations. In this paper, a real-time algorithm for viewshed analysis in 3D scenes is presented by using the parallel computing capabilities of a graphics processing unit (GPU). In contrast to traditional algorithms based on line-of-sight, this algorithm runs completely within the programmable 3D visualization pipeline to render 3D terrains with viewshed analysis. The most important difference is its integration of the viewshed calculation with the rendering module. Invisible areas are rendered as shadows in the 3D scene. The algorithm process is paralleled by rasterizer units in the graphics card and by vertex and pixel shaders executed on the GPU. We have implemented this method in our 3D Digital Earth system with the DirectX 9.0c API and tested on some consumer-level PC platforms with interactive frame-rates and high image quality. Our algorithm has been widely used in related systems based on Digital Earth.     

盐下构造速度建模与逆时偏移成像研究及应用

盐丘速度建模及成像是盐下油气藏勘探有关技术瓶颈问题.盐下构造由于盐丘速度与围岩地层差异大,且厚度横向变化大,造成地震波场复杂及时间域构造畸变.针对H区复杂盐丘的地质特征,通过技术创新重新认识盐下油气藏.针对盐丘速度建模的难点,提出了"多信息约束层控实体建模技术",采用序贯高斯模拟及克里金趋势约束速度反演方法,较好解决了盐下速度异常问题,大大提高了速度建模的精度;针对盐下复杂构造成像, 基于有限差分方法研究了精确且高效的差分格式逆时波场外推算法.基于GPU/CPU协同平台,将波场延拓通过GPU实现.采用逆时偏移深度域成像技术,使高角度反射界面、甚至超过90°盐丘侧翼界面的反射波精确成像.通过盐丘理论模型试算验证算法及方法的正确性.上述方法解决了盐丘速度建模精度问题、盐丘侧翼的回转构造成像问题,实现了对盐丘边界及盐丘侧翼的准确归位.消除了速度异常造成的时间域构造畸变,使盐下地层在深度域能够准确成像.     

一种基于GPU的实时水波模拟方法

大范围动态水面场景的实时三维仿真是虚拟海洋环境以及三维游戏中研究的难点和热点。由于水的动态性以及各种复杂的光照等效果,传统基于CPU的模拟很难达到实时交互的能力。近年来图形处理器(GPU)性能得到大幅度提高,尤其引人注意的是出现可编程特性,这使得人们可以充分利用GPU上提供的运算器来设计算法完成一定的任务。基于此,针对目前实时水波模拟的瓶颈及提倡的"解放CPU"(Offload CPU)的思想,本文对水波模拟的模型进行了研究,提出了一种基于GPU的水波模拟方法,充分利用GPU的并行运算及浮点运算能力.加快水面模拟的速度。文章给出了一定网格大小下,数量不同的点波源模拟水面的效果,并给出了单纯利用CPU和基于GPU两种方法的对比情况。     

Parallel constrained Delaunay triangulation on the GPU

In this paper, we propose a new graphics processing unit (GPU) method able to compute the 2D constrained Delaunay triangulation (CDT) of a planar straight-line graph consisting of points and segments. All existing methods compute the Delaunay triangulation of the given point set, insert all the segments, and then finally transform the resulting triangulation into the CDT. To the contrary, our novel approach simultaneously inserts points and segments into the triangulation, taking special care to avoid conflicts during retriangulations due to concurrent insertion of points or concurrent edge flips. Our implementation using the Compute Unified Device Architecture programming model on NVIDIA GPUs improves, in terms of running time, the best known GPU-based approach to the CDT problem.     

A hybrid parallel cellular automata model for urban growth simulation over GPU/CPU heterogeneous architectures

As an important spatiotemporal simulation approach and an effective tool for developing and examining spatial optimization strategies (e.g., land allocation and planning), geospatial cellular automata (CA) models often require multiple data layers and consist of complicated algorithms in order to deal with the complex dynamic processes of interest and the intricate relationships and interactions between the processes and their driving factors. Also, massive amount of data may be used in CA simulations as high-resolution geospatial and non-spatial data are widely available. Thus, geospatial CA models can be both computationally intensive and data intensive, demanding extensive length of computing time and vast memory space. Based on a hybrid parallelism that combines processes with discrete memory and threads with global memory, we developed a parallel geospatial CA model for urban growth simulation over the heterogeneous computer architecture composed of multiple central processing units (CPUs) and graphics processing units (GPUs). Experiments with the datasets of California showed that the overall computing time for a 50-year simulation dropped from 13,647 seconds on a single CPU to 32 seconds using 64 GPU/CPU nodes. We conclude that the hybrid parallelism of geospatial CA over the emerging heterogeneous computer architectures provides scalable solutions to enabling complex simulations and optimizations with massive amount of data that were previously infeasible, sometimes impossible, using individual computing approaches.     

一种基于SiftGPU的遥感影像匹配方法

针对已有的遥感影像匹配方法难以同时满足高精度、可靠性和高效率要求的问题,该文提出一种基于分块策略的尺度不变特征变换快速匹配方法。首先对两幅待匹配影像进行分块,根据影像的坐标信息建立参考影像与搜索影像上每个分块的对应关系,并进行量化级数转换;然后对每一对分块影像采用尺度不变特征变换算子进行匹配,同时采用GPU进行加速;最后对得到的所有匹配点进行误匹配点剔除。为验证该方法的有效性,采用经过正射纠正的ALOS影像和经过传感器校正的资源三号正视影像进行匹配实验。实验结果表明,该方法能够得到较多高精度的同名点,并且能在短时间内完成大数据量的处理。     

基于GPU并行计算的巨幅遥感影像坐标转换研究与实现

随着航空航天遥感技术的不断发展,以遥感影像为代表的栅格数据分辨率越来越高,遥感影像处理呈现出数据量大、复杂度高的特点。近年来,通用GPU的运算性能不断提高为加速密集运算提供了新的途径,目前,采用GPU并行技术进行遥感影像处理成为新的研究热点。本文提出了基于GPU并行计算的巨幅遥感影像坐标转换方法,实践证明,相比于传统的转换方法基于GPU的算法有较为明显的提速。     

CUDA和OpenCV图像并行处理方法研究

CUDA架构与传统GPU通用计算相比,编程更简单、应用领域更广泛,将CUDA架构引入到图像处理中可以提高图像的处理效率。本文提出了一种基于CUDA和OpenCV的图像并行处理方法,实现了图像二值化以及融合,经实验结果表明基于该方法可以提高图像处理效率;将该方法集成到MFC框架,能够应用到实际工程开发领域。     

一个基于GPU并行加速的海啸数值模型

地震海啸通常发生在大洋板块向陆地板块俯冲的区域,距离震源最近的国家和地区往往在震后5～20 min之内就会遭受到海啸袭击。因此,及时的海啸预警和准确的海啸预报结果对于民众和决策者都至关重要。为了提升海啸预警效率,缩短海啸预报时间,本研究对COMCOT海啸数值模型进行了基于图形计算单元GPU的二次并行开发。将原模型中海啸传播计算模块通过CUDA＿C语言编写内核函数整体移植到GPU上并行加速,CPU负责模型其他代码的执行。为了减少CPU和GPU之间的数据通信,将吸收边界和变量更新函数一并改写。仅在需要输出的时间节点,GPU向CPU传递结果,其他时间步长,CPU和GPU之间只有指令和少量参数传输,基本可视为零耗时。基于GPU并行加速的COMCOT较串行版本效率提升超过67倍,加速性能显著优于基于CPU共享内存的OpenMP并行版本。交叉使用常水深和真实地形,采用均匀滑移海啸源和有限元海啸源对模型的计算结果进行了较为全面的分析检验,相对误差最大不超过1%,为大范围的越洋海啸实时计算提供了有力工具。