自适应最小梯度夹角预积分光照算法

为了增强体绘制的纹理细节与光照效果,提出了一种自适应最小梯度夹角预积分算法.通过采样点的方向导数及空间位置等信息来确定采样光线上的极值点,利用自适应划分算法加强极值点区域的绘制;为了突出物体的真实感、增强纹理细节,引入预积分光照算法,根据最小梯度夹角算法计算预积分采样段的光照颜色值,最后对预积分采样段进行体绘制积分.实验结果表明,相比传统的预积分算法,文中算法针对标量变化较大的区域能够得到较好的绘制效果,并且能够增加局部细节的光照效果.     

特征抽象的直接体绘制方法

直接体绘制需要借助于传输函数,而设计一个有效的传输函数非常耗时且需要具备丰富的经验.为此提出一种不透明度自动调节的可视化方法.通过分析采样光线提取出数据的特征,并将这些特征抽象为不同层次的采样点,抽象采样点的不透明度根据采样光线上特征数的变化而改变;在保证最远抽象采样点可见度最大的前提下,推导并修改传统体绘制积分方程,得到基于抽象采样点的体绘制积分方程.实验结果表明,该方法不依赖于传输函数,能有效地展示体数据中的特征信息.     

局部特征加强的体绘制算法

最大强度差值累积结合了直接体绘制和最大强度值投影的优势,但其在累积过程中会遗漏一些局部特征.为了绘制体数据中局部特征信息,提出一种局部特征加强的直接体绘制方法.通过查找采样光线上特征边界点来确定局部最大强度的区域,利用局部差值累积的方法加强特征区域的绘制;为了提高特征分界点的查找精度,引入移动最小二乘法来平滑采样光线上的标量值,并利用用户自定义的阈值函数来控制特征的绘制;在绘制过程中,采用特征分析的表面光照模型增强绘制特征的三维立体感,引入深度信息对局部特征累积算法进行优化,并引入了Tone衰减方法使累积颜色值处于正常显示范围.实验结果表明,文中方法可在不需要传输函数的前提下绘制体数据中的特征信息.     

一种高效的光线投射体绘制算法

作为体绘制中的一个经典绘制算法,光线投射算法理论简单同时能产生高质量的图像,被广泛应用于医学图像可视化领域。但在绘制过程中有大量的投射光线和体素的重采样,导致绘制速度较为缓慢。为提高绘制的速度,文中提出一种高效的光线投射体绘制算法,通过引入碰撞检测技术减少投射光线的数目,避免冗余光线的采样计算,同时采用光线跳跃方法在碰撞检测包围盒内跳过对空体素的重采样,加快了光线合成的过程。实验结果表明,改进后的算法不仅能保证所需要的图像质量,还能大幅度地减少采样计算的时间,高效地提高绘制速度。     

一种改进求交的自适应光线投射体绘制算法

光线投射算法是体绘制技术中的一种重要算法,但其自身存在采样效率低和绘制速度慢等问题。为了提高光线投射算法的绘制速度,本文提出了一种改进求交的自适应光线投射体绘制算法,算法采用一种快速求交方法和自适应采样来提高体绘制速度,试验结果表明该算法能在基本不影响图像质量的同时提高算法的速度。     

基于GPU的实时光线投射算法

介绍了一种基于GPU（可编程图形处理单元）的快速实时光线投射算法。为满足大规模体数据集的绘制要求,利用当前GPU的新特性,直接将体数据作为纹理载入显存,采用预积分分类方法在GPU中对体数据进行重采样和分类,避免了计算机主内存与GPU纹理内存之间数据交换的瓶颈问题;利用硬件支持的三维纹理和片元着色器,实时计算每个体素的梯度,实现高质量的光照,保证高质量的图像绘制效果。实验结果表明该方法在医学三维数据场可视化中,能够实时、高效地生成高质量的交互式体可视化图像。     

基于GDI+的心电波形处理

首先介绍了利用GDI+绘图的一般过程和方法。然后结合在远程心电监护项目开发中的应用,针对在绘制较大图形时,出现的图形闪烁问题以及采用在paint事件中绘制图形的方法,导致系统频繁重画,性能下降的问题,进行了分析和探讨。提出采用双缓冲技术解决图形绘制过程中的闪烁问题;采用避免在paint事件中绘制大图形的方法来解决系统性能下降的问题,最终取得了满意的图形显示效果。     

基于微机环境的三维规则数据场可视化算法

本文提出了一种新的三维数据场可视化算法。新算法采用边界体素表示法，来简化数据场；采用新的积分过程，来简化累计光亮度和不透明度的计算；在深度积分过程中，引入混合绘制，对可见面进行光照计算，强化边界显示。这种算法比传统的方法在显示效率、图像质量上都有很大的改进，适合在微机上实现     

3维图像数据场的快速重建

3维图像重建中最典型的一类算法是体绘制方法,然而由于体绘制中的重采样和插值这两类基本运算,其计算量却是很大的,这往往影响重建的速度,为此,提出了在重建过程中采用减少插值、快速插值以及快速重采样等多项措施和方法,以加速3维图像的重建.实验表明,采用该方法重建时间约缩短了1/3,可见,这些措施和方法是切实可行有效的.     

基于体平滑的体绘制纹理伪边界消除算法

直接体绘制能够清楚的显示三维数据场的内部信息,是科学可视化中非常重要的一类方法。其中,基于二维纹理映射的三维数据直接体绘制方法具有绘制速度快、可交互性强的优点。其基本思路是将三维数据体在时间或深度方向形成一组水平纹理切片,通过这些切片的纹理贴图,实现三维数据体的体绘制,在交互性和资源消耗之间取得了较好的平衡。本文针对基于二维纹理映射的直接体绘制方法中在透明与不透明边界产生阶梯状条纹的伪边界问题,提出了一种基于体平滑的算法。该算法通过在透明数据与不透明数据的边界进行体平滑,使采样过程中缺失的数据表现到抽样的切片上,从而在最终图像生成阶段淡化甚至消除阶梯状条纹伪边界。实验结果表明,相对于传统二维纹理映射方法,本算法实现体绘制效果平滑,提高了绘制效果。     

基于Web的时变体数据的体绘制方法

传统Web体绘制方法主要集中在利用服务器端进行预处理和绘制任务,浏览器端仅用于呈现绘制结果,这样会造成服务器负载过高,同时,当绘制参数发生更改时,必须向服务器请求新的绘制结果,这样也易受网络延迟的影响。为了解决以上问题,实现在浏览器本地进行体绘制和交互,本文提出一种基于WebGL的体绘制方法,以时变体数据为例,在浏览器端实现光线投射体绘制算法。同时,为了提升绘制效率和减少内存占用,本文基于维度压缩方法,优化时变体数据的预处理过程。最后,本文设计了Web体绘制系统,引入暴风时变数据集以验证方法的有效性,结果表明,本文方法能够在浏览器本地对时变体数据进行体绘制,绘制时间在50ms以下,帧速率可达到50 FPS以上,同时支持实时交互,并且当绘制参数发生更改时,系统能够直接在浏览器端进行重新绘制。     

Stochastic Volume Rendering of Multi‐Phase SPH Data

In this paper, we present a novel method for the direct volume rendering of large smoothed‐particle hydrodynamics (SPH) simulation data without transforming the unstructured data to an intermediate representation. By directly visualizing the unstructured particle data, we avoid long preprocessing times and large storage requirements. This enables the visualization of large, time‐dependent, and multivariate data both as a post‐process and in situ. To address the computational complexity, we introduce stochastic volume rendering that considers only a subset of particles at each step during ray marching. The sample probabilities for selecting this subset at each step are thereby determined both in a view‐dependent manner and based on the spatial complexity of the data. Our stochastic volume rendering enables us to scale continuously from a fast, interactive preview to a more accurate volume rendering at higher cost. Lastly, we discuss the visualization of free‐surface and multi‐phase flows by including a multi‐material model with volumetric and surface shading into the stochastic volume rendering.     

A Rendering Algorithm for Discrete Volume Density Objects

We present a new algorithm for simulating the effect of light travelling through volume objects. Such objects (haze, fog, clouds…) are usually modelized by voxel grids which define their density distribution in a discrete tridimensional space. The method we propose is a two-pass Monte-Carlo ray-tracing algorithm that does not make any restrictive assumptions neither about the characteristics of the objects (both arbitrary density distributions and phase functions are allowed) nor about the physical phenomena included in the rendering process (multiple scattering is accounted for). The driving idea of the algorithm is to use the phase function for Monte-Carlo sampling, in order to modify the direction of the ray during scattering.     

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.     

A fast rendering method for clouds illuminated by lightning taking into account multiple scattering

Methods for rendering natural scenes are used in many applications such as virtual reality, computer games, and flight simulators. In this paper, we focus on the rendering of outdoor scenes that include clouds and lightning. In such scenes, the intensity at a point in the clouds has to be calculated by taking into account the illumination due to lightning. The multiple scattering of light inside clouds is an important factor when creating realistic images. However, the computation of multiple scattering is very time-consuming. To address this problem, this paper proposes a fast method for rendering clouds that are illuminated by lightning. The proposed method consists of two processes. First, basis intensities are prepared in a preprocess step. The basis intensities are the intensities at points in the clouds that are illuminated by a set of point light sources. In this precomputation, both the direct light and also indirect light (i.e., multiple scattering) are taken into account. In the rendering process, the intensities of clouds are calculated in real-time by using the weighted sum of the basis intensities. A further increase in speed is achieved by using a wavelet transformation. Our method achieves the real-time rendering of realistic clouds illuminated by lightning.     

Decoupled Shading for Real‐time Heterogeneous Volume Illumination

Existing real‐time volume rendering techniques which support global illumination are limited in modeling distinct realistic appearances for classified volume data, which is a desired capability in many fields of study for illustration and education. Directly extending the emission‐absorption volume integral with heterogeneous material shading becomes unaffordable for real‐time applications because the high‐frequency view‐dependent global lighting needs to be evaluated per sample along the volume integral. In this paper, we present a decoupled shading algorithm for multi‐material volume rendering that separates global incident lighting evaluation from per‐sample material shading under multiple light sources. We show how the incident lighting calculation can be optimized through a sparse volume integration method. The quality, performance and usefulness of our new multi‐material volume rendering method is demonstrated through several examples.     

A framework for fusion methods and rendering techniques of multimodal volume data

Many different direct volume rendering methods have been developed to visualize 3D scalar fields on uniform rectilinear grids. However, little work has been done on rendering simultaneously various properties of the same 3D region measured with different registration devices or at different instants of time. The demand for this type of visualization is rapidly increasing in scientific applications such as medicine in which the visual integration of multiple modalities allows a better comprehension of the anatomy and a perception of its relationships with activity. This paper presents different strategies of direct multimodal volume rendering (DMVR). It is restricted to voxel models with a known 3D rigid alignment transformation. The paper evaluates at which steps of the rendering pipeline the data fusion must be realized in order to accomplish the desired visual integration and to provide fast re‐renders when some fusion parameters are modified. In addition, it analyses how existing monomodal visualization algorithms can be extended to multiple datasets and it compares their efficiency and their computational cost. Copyright © 2004 John Wiley & Sons, Ltd.     

Two-level volume rendering

Presents a two-level approach for volume rendering, which allows for selectively using different rendering techniques for different subsets of a 3D data set. Different structures within the data set are rendered locally on an object-by-object basis by either direct volume rendering (DVR), maximum-intensity projection (MIP), surface rendering, value integration (X-ray-like images) or non-photorealistic rendering (NPR). All the results of subsequent object renderings are combined globally in a merging step (usually compositing in our case). This allows us to selectively choose the most suitable technique for depicting each object within the data while keeping the amount of information contained in the image at a reasonable level. This is especially useful when inner structures should be visualized together with semi-transparent outer parts, similar to the focus+context approach known from information visualization. We also present an implementation of our approach which allows us to explore volumetric data using two-level rendering at interactive frame rates     

Strategies for direct volume rendering of diffusion tensor fields

Diffusion-weighted magnetic resonance imaging is a relatively new modality capable of elucidating the fibrous structure of certain types of tissue, such as the white matter within the brain. One tool for interpreting this data is volume rendering because it permits the visualization of three dimensional structure without a prior segmentation process. In order to use volume rendering, however, we must develop methods for assigning opacity and color to the data, and create a method to shade the data to improve the legibility of the rendering. Previous work introduced three such methods: barycentric opacity maps, hue-balls (for color), and lit-tensors (for shading). The paper expands on and generalizes these methods, describing and demonstrating further means of generating opacity, color, and shading from the tensor information. We also propose anisotropic reaction-diffusion volume textures as an additional tool for visualizing the structure of diffusion data. The patterns generated by this process can be visualized on their own or they can be used to supplement the volume rendering strategies described in the rest of the paper. Finally, because interpolation between data points is a fundamental issue in volume rendering, we conclude with a discussion and evaluation of three distinct interpolation methods suitable for diffusion tensor MRI data