基于体绘制技术的层状地层三维建模平台的设计和实现

随着地学研究的不断深入,层状地层三维建模已成为研究的重点。基于格式化存储的多层DEM数据文件,将直接体绘制的思想融入到基于图像空间体绘制的经典算法—光线投射算法之中,提出基于多层DEM数据的光线投射算法。基于IDL和.NET的混合环境设计并实现了层状地层的三维可视化的平台。在该平台上,使用改进后的光线投射算法实现了层状地层的三维建模,以及对三维层状地质体的基本操作和基本地质信息的提取。     

一种加速的规则体数据场光线投射体绘制算法

本文讨论了规则体数据场的体绘制算法,将光线投射体绘制算法看作是对体数据立方体投影多边形的填充,减少了投射光线的数目。将Bresenham画线算法推广到三维空间,减少了光线投射算法的计算时间。本算法已应用于我所开发的三维核磁共振图像分析系统中,效果较好。     

基于OpenGL的光线投射算法的研究

利用VC＋＋6．0以及OpenGL实现光线投射算（payCasting）法。介绍了光线投射算法以及OpenGL的知识。主要实验方法为：第一、对原始CT图像进行数据预处理、数据分类,得到满足绘制要求的规则体数据,并且对各个数据点赋予颜色值和不透明度;第二、利用体绘制算法绘制出人头（主要是人脑）图像,并且能够实现空间上三个方向的浏览与绘制功能,但是绘制速度比较慢。实验结果表明：采用光线投射算法能够实现人脑的三维可视化,并且能够绘制出清晰图像,图像效果令人满意。     

基于OpenGL的光线投射算法的研究

利用VC＋＋6．0以及OpenGL实现光线投射算（payCasting）法。介绍了光线投射算法以及OpenGL的知识。主要实验方法为：第一、对原始CT图像进行数据预处理、数据分类,得到满足绘制要求的规则体数据,并且对各个数据点赋予颜色值和不透明度;第二、利用体绘制算法绘制出人头（主要是人脑）图像,并且能够实现空间上三个方向的浏览与绘制功能,但是绘制速度比较慢。实验结果表明：采用光线投射算法能够实现人脑的三维可视化,并且能够绘制出清晰图像,图像效果令人满意。     

基于光线投射法的目标三维重构技术

针对距离选通激光成像系统获得的图像源,为了减小断层图像间的距离远大于断层图像内像素间的距离这一因素对三维可视化的影响,增强三维显示效果,提高运算速度,在研究了光线投射三维重构算法的基础上,提出了距离分辨率远小于成像分辨率的插空帧光线投射法和通过旋转体数据实现从不同的视线角度进行观察的三维重构方法.仿真结果表明:提出的方法可行、有效,提高了目标的探测和识别概率.     

基于GPU的医学图像多功能可视化的实现

三维可视化在医学诊断过程中发挥着越来越重要的作用,随着GPU的高速发展,成像质量高的光线投射算法克服了其耗时的难题,越来越多地被使用到实际运用中。为了更好地提供用户体验,为医生诊断提供更多的服务,提出一种交互性多功能的医学图像三维可视化。以Visual Studio 2008为平台,DCMTK读取DICOM图像,CUDA(Compute Unified Device Architecture)进行光线投射算法的加速,实现了三维图像中定位,任意断面显示,区域的切割与特殊显示功能。实验结果显示该系统在普通台式电脑上具有较好的实时性和交互性,可以为医生提供更好的服务,拥有巨大应用价值。     

基于光线投射采样和四元数正交矩的高效三维医学影像鲁棒零水印算法

针对三维医学影像的版权保护问题，以及随着待保护图像数量增加而导致的水印存储容量同步增加的问题，提出了一种基于光线投射采样和极复指数矩的三维医学影像鲁棒性零水印算法。首先，提出了一种基于光线投射的采样算法，对多张二维医学图像序列构成的三维医学影像进行特征采样并在二维图像空间中进行描述；其次，提出了一种针对三维医学影像的鲁棒性零水印算法，所提算法通过光线投射采样获取三维医学影像的冠状面、矢状面和横切面的3个二维特征图像，将3个二维特征图像进行极复指数变换获得四元数正交矩；最后，使用四元数正交矩和Logistic混沌加密构建零水印信息。仿真实验结果表明，在各种常见的图像处理攻击和几何攻击下所提算法能够保持零水印提取的比特正确率在0.920 0以上，水印存储容量随着三维医学影像的数据增多而提升，与其他优秀的二维医学图像零水印算法相比，所提算法的存储容量至少提升了93.75%。     

基于SIFT的岩石薄片图像拼接

为了解决传统的基于尺度不变特征变换(SIFT)算法的图像拼接方法无法使用SIFT特征匹配算法对岩石薄片图像中的空白区域图像进行特征提取,进而影响整个岩石薄片图像拼接的问题,在尺度不变特征变换匹配算法的基础上,提出了一种将岩石薄片图像的行列中心位置作为拼接基准点的图像拼接方法。该方法改进了特征点的提取方式、变换矩阵的计算顺序以及矩阵优化的顺序,并利用相邻图像之间的位置关系估计出空白区域图像的变换矩阵,实现了整个岩石薄片图像的拼接。实验结果表明,该方法可以较好地完成岩石薄片图像中空白图像的拼接,能够较为完整地保留整个岩石薄片的纹理信息,具有一定的实际应用价值。     

基于GPU的三维地震数据场体绘制方法

体绘制技术是计算可视化研究和应用热点之一。在对三维数据体进行形式化定义基础上,讨论光线投射算法中数据体划分,重采样计算以及图像合成的原理和方法。利用着色器进行重采样和图像合成运算,实现体绘制的GPU加速。将GPU加速的光线投射体绘制方法应用于地震数据解释,分别实现地震数据的灰度和伪彩色样式可视化,并通过转换函数,凸显出地震数据场的层位特征,克服了地震数据剖面、切片以及三维面绘制图像的局限性。     

空间跳跃加速的GPU光线投射算法

光线投射算法是一种应用广泛的体绘制基本算法,能产生高质量的图像,但是时间复杂度较高。实现了一种基于图形处理器的单步光线投射算法,并在此基础上提出了一种基于空间跳跃技术的光线投射算法,以实现加速。采用八叉树组织体数据,利用空间跳跃有效地剔除体数据中对重建图像无贡献的部分,降低了硬件的负载。一个片段程序即可完成光线方向的生成、光线投射、空体素跳跃和光线终止等。实验结果表明,该算法对于内部包含大量空体素的体数据重建能起到明显的加速作用。     

Ray-cast volume rendering accelerated by incremental trilinear interpolation and cell templates

Two related ideas for improving the speed of ray-cast volume rendering are studied in this paper. The first is an incremental algorithm for trilinear interpolation, a method commonly used in ray-cast volume rendering to calculate sample values. The incremental algorithm can expedite trilinear interpolation when many samples along a ray are located in one cell. The second is an efficient hybrid volume rendering restricted to parallel projection. In the preprocessing stage, acell template is created to store the information used by the incremental trilinear interpolation. When a cell is parallel projected, the information is retrieved from the template to compute the cell contribution. Because the algorithm with only one template may cause aliasing, an antialiasing technique exploiting multiple cell templates is proposed. With our method, ray-cast volume rendering can be accelerated considerably.     

IMAGE RENDERING FOR BUILDING CAD

ＩＭＡＧＥＲＥＮＤＥＲＩＮＧＦＯＲＢＵＩＬＤＩＮＧＣＡＤＺｈａｎｇＮａｎ；ＱｉｎＫａｉｈｕａｉＡｂｓｔｒａｃｔ：Ｔｈｉｓｐａｐｅｒｐｒｅｓｅｎｔｓａｒｅａｌｉｓｔｉｃｉｍａｇｅｓｙｎｔｈｅｓｉｓｓｙｓｔｅｍｓｕｉｔａｂｌｅｔｏｂｕｉｌｄｉｎｇｓ．Ｉｔ...     

基于锥形射线族投射的非直接光照算法

在可交互应用中,基于射线投射的非直接光照采样数目常常受限。为此,考虑到空间关联,提出使用锥形射线族进行投射求交的算法,利用锥形边界预排除场景元素,并使用无堆栈算法在GPU中完成非直接光照计算,同时对算法使用的数据存储区域进行优化以达到更好的访问带宽,通过OpenCL和OpenGL实现该算法,结果证明该算法可以有效地计算非直接光照,相对于射线投射算法平均有2倍左右的性能提升。     

不规则地质体的分割与体绘制方法研究

提出一种基于局部信息的区域增长方法(LI—RGA),该方法克服了最小偏差区域增长算法(R—RGA)中一致性准则函数定义的模糊性问题．实验结果证明,算法的分割准确性有所下降,但基本上不影响对不规则地质体的解释和分析工作．针对地震数据的特点,对传统光线投射算法进行了简化,并将分割出的不规则地质体定义成区域模板,再与改进的光线投射体绘制算法结合起来．实验证明,此方法能够清晰地再现数据体中的不规则地质体,并能同时显示重要的地质特征体．     

A fast registration algorithm of rock point cloud based on spherical projection and feature extraction

Point cloud registration is an essential step in the process of 3D reconstruction. In this paper, a fast registration algorithm of rock mass point cloud is proposed based on the improved iterative closest point (ICP) algorithm. In our proposed algorithm, the point cloud data of single station scanner is transformed into digital images by spherical polar coordinates, then image features are extracted and edge points are removed, the features used in this algorithm is scale-invariant feature transform (SIFT). By analyzing the corresponding relationship between digital images and 3D points, the 3D feature points are extracted, from which we can search for the two-way correspondence as candidates. After the false matches are eliminated by the exhaustive search method based on random sampling, the transformation is computed via the Levenberg-Marquardt-Iterative Closest Point (LM-ICP) algorithm. Experiments on real data of rock mass show that the proposed algorithm has the similar accuracy and better registration efficiency compared with the ICP algorithm and other algorithms.     

Visualization of AMR data with multi-level dual-mesh interpolation

We present a new technique for providing interpolation within cell-centered Adaptive Mesh Refinement (AMR) data that achieves C(0) continuity throughout the 3D domain. Our technique improves on earlier work in that it does not require that adjacent patches differ by at most one refinement level. Our approach takes the dual of each mesh patch and generates "stitching cells" on the fly to fill the gaps between dual meshes. We demonstrate applications of our technique with data from Enzo, an AMR cosmological structure formation simulation code. We show ray-cast visualizations that include contributions from particle data (dark matter and stars, also output by Enzo) and gridded hydrodynamic data. We also show results from isosurface studies, including surfaces in regions where adjacent patches differ by more than one refinement level.     

Identification and sizing of the entirely visible rocks from a 3D surface data segmentation of laboratory rock piles

Once segmentation of 3D surface data of a rock pile has been performed, the next task is to determine the visibility of the surface rocks. A region boundary-following algorithm that accommodates irregularly spaced 3D coordinate data is presented for determining this visibility. We examine 3D surface segmentations of laboratory rock piles and determine which regions in the segmentation correspond to entirely visible rocks, and which correspond to overlapped or partially visible rocks. This is a significant distinction as it allows accurate size determination of entirely visible rocks, separate handling of partially visible rocks, and prevents erroneous bias resulting from mishandling partially visible rocks as smaller entirely visible rocks. Literature review indicates that other rock pile sizing techniques fail to make this distinction. The rock visibility results are quantified by comparison to manual surface classifications of the laboratory piles and the size results are quantified by comparison to the sieve size.     

An efficient algorithm for ray casting of CSG animation frames

This paper presents a new algorithm to generate ray-cast CSG animation frames. We consider sequences of frames where only the objects can move; in this way, we take advantage of the high screen area coherence of this kind of animation. A new definition of bounding box allows us to reduce the number of pixels to be computed for the frames after the first. We associate a CSG subtree and two new flags, denoting if the box has changed in the current frame and if it will change in the next frame, with each box. We show with three examples the advantages of our technique when compared with an algorithm which entirely renders each frame of an animation. Intersections with CSG objects may be reduced to about one-fifth, while the rendering may be computed up to four times faster for the test sequences. © 1998 John Wiley & Sons, Ltd.     

Estimation of planes of a rock mass in a gallery wall from point cloud data based on MD PSO

LiDAR (laser imaging detection and ranging) has been developed to measure the distance of the mesh of points on an object with a high level of accuracy. It provides high-resolution point cloud data as a result of distance measurement. Detailed 3D shapes of objects can be estimated from point cloud data. LiDAR has been used to identify discontinuities in a rock mass of a tunnel gallery wall. To identify discontinuities, it is necessary to approximate the rock mass surface with small planes. Normal vectors of the planes are important to identify discontinuities. We developed an algorithm for estimation of planes based on multi-dimensional particle swarm optimization (MD PSO) from point cloud data. Point cloud data were segmented into bounding boxes and grouped into clusters by MD PSO. Planes were estimated using the least squares method for point cloud data in the respective clusters. The newly developed algorithm based on MD PSO was evaluated using point cloud data obtained from a gallery wall. Evaluation was carried out in comparison with the previous developed variable-box segmentation (VBS) algorithm. The MD PSO-based algorithm showed a 7% higher accuracy than that of the VBS algorithm.     

基于特征断面的复杂巷道段三维建模

为解决巷道断面随工程需要及岩层变化不断改变,导致巷道三维建模程序复杂的问题,提出基于特征断面的巷道三维建模思想,通过建立巷道特征断面模型库,实现变化巷道段的三维建模,以期提高复杂巷道段的建模效率。首先阐述建模数据的采集方法,并对巷道断面进行了细化坐标分析;同时提出拐角处断面变化巷道段的平滑处理算法（通过圆弧来圆滑拐角处巷道中心线）,对普通巷道段采用三角剖分形成三角网完成巷道段的建模;而巷道断面发生变化的复杂巷道段存在简单曲面四边形,采用Bézier曲面及曲面的拼接完成巷道段的建模,并在实验中进行了验证