基于人脑部体数据的任意切面研究

本文结合表面绘制方法和体绘制方法,采用以三维矩阵数值运算与逻辑运算为基础的体数据面绘制算法,实现了医学断层图像序列的三维重建及任意切面显示.通过对子矩阵分解的分析,解决实时性要求与存储空间和运行时间的矛盾.实验结果表明,该算法既克服了表明绘制不能体现内部数据的缺点,又从一定程度上解决了体绘制的速度问题,可以从任意角度和位置来观察剖面的形状、大小、灰度分布等各种病理特征.     

基于VTK的医学序列图像可视化

数字人体是目前的一个研究热点，而医学图像三维建模及可视化研究是其中的一项重要内容，医学序列图像的可视化技术包括体绘制和表面绘制两大类。他们各有其特点和适用领域。使用VTK可以很大程度的简化医学序列图像重建的问题。本文讨论了两种方法的原理、特点以及VTK实现三维重建及可视化的算法过程，并给出了一个实例。     

协同分布式图形硬件的混合并行体绘制

由于一般的共享存储并行机缺乏图形硬件,其上产生的3维科学计算数据,无法采用硬件加速的并行体绘制来就地进行数据可视化。为此基于本地并行机和分布式图形工作站,给出了一种混合并行绘制模型。该模型的工作原理是先将源数据存留在并行机,然后通过并行机的多处理器发布远程绘制命令流,进而通过操控工作站的图形硬件完成绘制;后期图像合成在并行机上执行,以发挥共享存储通信优势。通过负载平衡优化,并行绘制流水线有效实现了绘制、合成与显示的重叠。实验结果显示,该方法能以1024×1024图像分辨率,交互绘制并行机上的大规模数据场。     

三维医学图像的体绘制技术综述

在分析三维医学图形体绘制技术的基础上,描述了射线投射法、足迹法、剪切-曲变法、基于硬件的3D纹理映射、频域体绘制法和基于小波的体绘制等典型算法,给出了各类算法的性能评价,展望了体绘制技术研究的发展前景。     

基于GPU的三维医学图像混合可视化系统

研究并实现了一个基于GPU的医学图像混合可视化系统，该系统采用三维纹理映射的方法实现直接体绘制，利用GPU的可编程特性完成体绘制方法中的插值后分类算法和传输函数的传递及实时修改，采用OpenGL技术实现表面的绘制，并基于场景图结构实现时表面数据的管理。面绘制和体绘制部分都采用OpenGL实现，运用OpenGL的融合机制，系统实现了面绘制和体绘制的混合显示。本系统大大提高了体绘制的速度，有效地保留了面绘制和体绘制的优势，在保证绘制速度的基础上丰富了图像信息。     

三维数据场体绘制中的预积分分类技术

随着三维数据场可视化精度要求的不断提高,直接体绘制方法已经成为该领域的研究热点。然而,提高数据场采样率以获得高质量的图像与绘制速度的降低这一矛盾,很大程度上限制了体绘制方法的研究进展。论文阐述了体绘制方法的关键技术——分类和体绘制积分,并在此基础上介绍了预积分分类技术。该方法能够同时提高体绘制方法的执行效率与图像质量,并给出了实例说明。最后,提出了预积分分类技术中存在的一些问题。     

离散场的一种快速体绘制方法

针对大规模离散数据场的特点,首先给出了三维直线的两种体素化表示方法,然后建立了三维离散直线的基路径,并提出了基于基路径的直接体绘制方法。该方法由于充分利用了射线之间的相关性,所以可明显加速体绘制过程,且对高分辨率离散数据场有普遍的应用价值。     

带材质的GPU加速体绘制算法

在体绘制过程中,为了给物质表面加入材质(光照和纹理)来提高结果的可读性,提出一种带材质的体绘制算法.通过引入2D球面光照贴图,用纹理映射替代了GPU中复杂的光照模型计算;利用物质表面单位法向量索引球面光照贴图中对应点的颜色信息,从而给物体表面赋予各种材质属性;并结合基于3D纹理的GPU光线投射算法完成绘制.实验结果表明,该算法简单易行,在增强可视化效果的同时使得绘制的效率也得到提升.     

基于高度梯度图的微结构表面阴影绘制方法

针对带有微结构表面的几何模型建模困难、模型复杂度高,导致现有阴影绘制算法效率差的问题,提出一种基于高度梯度图的阴影实时绘制方法.为实现实时渲染,首先给出一种微结构描述模型,通过将微结构高度场映射到低精度模型表面来描述复杂微结构模型;然后定义微结构高度梯度图,并据此构建可见点的局部最高点集合.在阴影绘制阶段,通过实时计算梯度空间局部最高点集合遮挡来生成细节阴影.整个阴影绘制算法在图像空间完成,较好地利用了延迟着色的思想和GPU并行计算的特点,可呈现可变形物体在动态场景中的自阴影效果.     

针对全空子数据体的GPU体绘制

目的 体绘制是3维数据可视化的主要方法之一。用于体绘制的数据体中包含有大量的空体素,导致光线投射算法进行没有意义的重采样计算,必然降低绘制算法效率。针对全空子数据体体绘制低效问题,提出基于GPU体高效绘制方法。方法 利用八叉树数据结构组织数据,有效管理包含许多空体素的子数据体。通过绘制八叉树非全空叶子节点子数据体表面,使光线投射算法中起始和终止重采样位置更接近数据体中的可视部分,同时根据八叉树全空节点子数据体判定纹理查询结果,计算合适的跳跃步长,快速跳过八叉树中全空节点子数据体。结果 当数据体中空体素较多时,确定合适的八叉树深度,有效地跳过数据体中的空体素,减少体绘制运算量,实现对原基于体包围盒表面绘制的GPU光线投射算法的加速。结论 设计不透明度函数,凸显数据体中层位面,并将算法成功应用于地震数据可视化,取得很好应用效果。     

Efficient and Handy Texture Mapping on 3D Surfaces

There has been a rapid technical progress in three-dimensional (3D) computer graphics. But gathering surface and texture data is yet a laborious task. This paper addresses the problem of mapping photographic images on the surface of a 3D object whose geometric data are already known. We propose an efficient and handy method for acquiring textures and mapping them precisely on the surface, employing a digital camera alone. We describe an algorithm for selecting a minimal number of camera positions that can cover the entire surface of a given object and also an algorithm to determine camera's position and direction for each photograph taken so as to paste it to the corresponding surfaces precisely. We obtained a matching accuracy within a pixel on a surface through three experimental examples, by which the practicability of our method is demonstrated.     

基于输运方程的混合式体绘制模型

作者从物理光学中输运理论的输运方程出发，在散射项的计算上，提出了体散射强度和面散射强度的计算，以及用边界因子组合该两项射强度作为质点粒子在该点的总的散射光照强度的体绘制光照模型。     

基于图像的实时漫游

提出了一个点和多边形模型混合的场景表达方式,从而实现了对复杂场景的视点不受限制的实时漫游.它从多幅带深度的参考图像出发,在预处理阶段区别对待场景中平面物体和曲面物体在参考图像中的对应像素.对于在参考图像所占区域较大的空间平面,用传统的多边形模型方式对其进行表达,试图恢复出其平面方程,然后通过采样密度比较和重采样过程,将该空间平面在所有参考图像中的出现合并成一个均匀采样的纹理图像;而对于空间曲面或在参考图像中所占面积较小的平面,使用点的形式对其进行表达,通过采样密度的比较去掉冗余的点,将保留下来的点按其空间位置进行聚类.同时,对于场景中那些不被所有参考图像所拍摄到而在漫游过程中可能形成空洞的部分,提出一个空洞预填补技术,在预处理阶段即对这类空洞进行填补,从而大大减少了漫游阶段出现空洞的几率.在漫游阶段则使用纹理映射和点Warping的方式进行绘制,以充分利用图形硬件的加速功能.     

基于MC算法的CT序列图像快速成型文件生成方法

快速成型技术在医学领域有着广泛而重要的应用,为了从医学图像中得到快速成型文件,详细论述了MC(marchingcubes)算法生成STL文件的步骤及需要注意的问题,并将其与轮廓连接生成STL文件的方法进行比较,说明了所提方法优势及可行性。方法先对CT序列图像进行阈值分割、区域增长等图像预处理,然后用MC算法得到用三角片组成的几何模型,最后根据文件格式标准,生成STL文件,其中着重讨论了STL文件中三角面片顶点顺序如何确定这一问题。     

从多幅参考图像合成目标图像的逆映射算法

提出了一种从多幅参考图像来合成新视点目标图像的逆映射算法.这种方法不但成功地填补了由于投影区域扩张而产生的第1类空洞,而且还成功地填补了由于空间非深度连续物体相互遮挡而产生的第2类空洞,从而方便地实现了虚拟环境中的漫游.基于物体表面深度的连续性,提出了一种位移预测方法.该方法可以从单幅参考图像获得逆映射过程中所需要的目标图像的位移信息,从而大大提高了算法的效率.与通常的正向映射算法相比,该算法克服了多幅参考图像所带来的计算量成倍增长等问题,而且误差较小.     

Point-Based Rendering of Non-Manifold Surfaces

We are concerned with producing high‐quality images of parametric and implicit surfaces, in particular those with non‐manifold features. We present a point‐based technique for rendering implicit surfaces that uses octree spatial subdivision with a natural interval exclusion test that guarantees that no parts of the surface are missed. This allows us to render non‐manifold implicit surfaces at speeds comparable to parametric surfaces. We also derive criteria that guarantee complete pixel coverage of the surface. The point‐based method allows for hidden surface elimination using a z‐buffer, and shadow casting using a shadow buffer. We illustrate the technique with a number of surfaces, and discuss its advantages and disadvantages.     

Region-based bas-relief generation from a single image

Bas-relief is an art form part way between sculpture and drawing. In this paper, we present an algorithm for generating a bas-relief from a single image, inspired by the process that artists use to create reliefs. We do not aim to recover exact depth values for objects in the image, which is a tricky computer vision problem, requiring assumptions that are rarely satisfied. Instead, we determine layers based on relative depth ordering of objects (and their parts) in the image, and use this information to construct surfaces in the 3D relief model. Feature lines are extracted and used to build a new region-based representation of the input image. During surface construction, a base surface is first generated; it is then augmented using both intensity and gradient information from the original image. To prevent depth errors arising due to augmentation, a feedback process is used to refine the output. Our experimental results show the generated bas-reliefs have smooth boundaries with appropriate height relationships, a key property of bas-reliefs created by artists. We demonstrate that our algorithm works well for a range of input images, including human faces, flowers and animals.     

Particle-based non-photorealistic volume visualization

Non-photorealistic techniques are usually applied to produce stylistic renderings. In visualization, these techniques are often able to simplify data, producing clearer images than traditional visualization methods. We investigate the use of particle systems for visualizing volume datasets using non-photorealistic techniques. In our VolumeFlies framework, user-selectable rules affect particles to produce a variety of illustrative styles in a unified way. The techniques presented do not require the generation of explicit intermediary surfaces.     

Adaptive marching cubes

The marching cubes algorithm (MC) is a powerful technique for surface rendering that can produce very high-quality images. However, it is not suitable for interactive manipulation of the 3D surfaces constructed from high-resolution volume datasets in terms of both space and time. In this paper, we present an adaptive version of MC called adaptive marching cubes (AMC). It significantly reduces the number of triangles representing the surface by adapting the size of the triangles to the shape of the surface. This improves the performance of the manipulation of the 3D surfaces. A typical example with the volume dataset of size 256×256×113 shows that the number of triangles is reduced by 55%. The quality of images produced by AMC is similar to that of MC. One of the fundamental problems encountered with adaptive algorithms is thecrack problem. Cracks may be created between two neighboring cubes processed with different levels of subdivision. We solve the crack problem by patching the cracks using polygons of the smae shape as those of the cracks. We propose a simple, but complete, method by first abstracting 22 basic configurations of arbitrarily sized cracks and then reducing the handling of these configurations to a simple rule. It requires onlyO(n ²) working memory for an×n×n volume data set.     

A scanline algorithm for displaying trimmed surfaces by using Bézier clipping

Displaying objects with high accuracy is necessary for CAGD (computer-aided geometric design) and for the synthesis of photo-realistic images. Traditionally, polygonal approximation methods have been employed to display free-form surfaces. They bring on low accuracy of display not only in shape, but also in intensity of objects. In this paper, a scanline algorithm to directly display parametric surface patches, expressed by trimmed Bézier surfaces, without polygonal approximation is proposed. In the method proposed here, curved surfaces are subdivided into subpatches with curved edges intersecting with a scanline, and the intersections of every subpatch and the scanline are calculated. This method is extremely robust for calculating the intersections, which can be obtained with only a few iterations; the Bézier clipping method is used for the iteration. Anti-aliased images with shadows and texture mapping are given to show the effectiveness of the method proposed.