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

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

高效光线投射体绘制算法研究

重点研究了体绘制算法具体实现过程。为提高图像质量,采用相邻梯度、高阶内插、简单过采样等方法,并提出数据分块、代码优化、跳采样等具体途径。上述方法的组合使用,取得了满意的效果。     

Compressive Volume Rendering

Compressive rendering refers to the process of reconstructing a full image from a small subset of the rendered pixels, thereby expediting the rendering task. In this paper, we empirically investigate three image order techniques for compressive rendering that are suitable for direct volume rendering. The first technique is based on the theory of compressed sensing and leverages the sparsity of the image gradient in the Fourier domain. The latter techniques exploit smoothness properties of the rendered image; the second technique recovers the missing pixels via a total variation minimization procedure while the third technique incorporates a smoothness prior in a variational reconstruction framework employing interpolating cubic B‐splines. We compare and contrast the three techniques in terms of quality, efficiency and sensitivity to the distribution of pixels. Our results show that smoothness‐based techniques significantly outperform techniques that are based on compressed sensing and are also robust in the presence of highly incomplete information. We achieve high quality recovery with as little as 20% of the pixels distributed uniformly in screen space.     

加速体绘制技术

根据体绘制成像的各个操作环节,对体绘制的加速技术进行了较全面且系统的介绍,包括色彩合成、光线与数据的求交、插值计算、排序及视见变换、对体绘制的基于硬件及系统方面的加速技术（如并行体绘制和漫游体绘制）也进行了一些讨论,在实际应用中,只有将各种加速技术进行有机地结合才能充分发挥体绘制的可视化作用。     

Visibility-Aware Direct Volume Rendering

Direct volume rendering (DVR) is a powerful visualization technique which allows users to effectively explore and study volumetric datasets.Different transparency settings can be flexibly assigned to different structures such that some valuable information can be revealed in direct volume rendered images (DVRIs).However,end-users often feel that some risks are always associated with DVR because they do not know whether any important information is missing from the transparent regions of DVRIs.In this paper,we investigate how to semi-automatically generate a set of DVRIs and also an animation which can reveal information missed in the original DVRIs and meanwhile satisfy some image quality criteria such as coherence.A complete framework is developed to tackle various problems related to the generation and quality evaluation of visibility-aware DVRIs and animations.Our technique can reduce the risk of using direct volume rendering and thus boost the confidence of users in volume rendering systems.     

一种非规则数据场的体绘制算法

非规则数据场的体绘制是可视化的一个热点和难点。常用直接体绘制算法有光线投射法、单元投影法、快速体绘制算法。本文吸取了上述三种算法的优点,采用体元面投影的方法来确定光线路径;同时考虑到非规则数据场的一些特性,采取三个有效的措施大大加快了投影和求交速度;在采样中用分段积分法代替等距采样,从而进一步提高了图象质量。     

Efficient Compositing Methods for the Sort-Last-Sparse Parallel Volume Rendering System on Distributed Memory Multicomputers

In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, one can achieve a very good performance improvement in the rendering phase by increasing the number of processors. This is because each processor can render images locally without communicating with other processors. However, in the compositing phase, a processor has to exchange local images with other processors. When the number of processors exceeds a threshold, the image compositing time becomes a bottleneck. In this paper, we propose three compositing methods to efficiently reduce the compositing time in parallel volume rendering. They are the binary-swap with bounding rectangle (BSBR) method, the binary-swap with run-length encoding and static load-balancing (BSLC) method, and the binary-swap with bounding rectangle and run-length encoding (BSBRC) method. The proposed methods were implemented on an SP2 parallel machine along with the binary-swap compositing method. The experimental results show that the BSBRC method has the best performance among these four methods.     

Matching Convex Shapes with Respect to the Symmetric Difference

This paper deals with questions from convex geometry related to shape matching. In particular, we consider the problem of moving one convex figure over another, minimizing the area of their symmetric difference. We show that if we just let the two centers of gravity coincide, the resulting symmetric difference is within a factor of 11/3 of the optimum. This leads to efficient approximate matching algorithms for convex figures. Received November 1996; revised March 1997.     

体绘制的任意曲面切割方法

为了在体绘制的过程中,响应用户的实时交互以及对体数据进行切割。论文提出了一种预计算外部轮廓,基于ConstructiveSolidGeometry(CSG)的方法来进行切割的方法。预先计算的外部轮廓在整个体绘制过程中完成界定体元绘制的边界和进行切割交互的功能,因此提高了体元绘制和切割的效率。引入外部轮廓几何体之后,采用基于CSG的方法来进行交互式切割,保证了原有外部轮廓和切割体各自内部的拓扑关系。最后,通过对纹理坐标的实时计算,实现3D纹理的映射。论文借助于现有可编程图形流水线的功能实现该方法,完成了高效率的实时交互和绘制。     

八叉树编码体数据的快速体绘制算法

提出一种基于并行投影Shear-Warp分解的射线模板快速RayCasting体绘制算法．体数据采用有效的八叉树存储和表达方案．八叉树的适应性均一化分级策略使得算法在简化了不必要的处理过程的同时,为构建用于RayCasting算法的射线模板和后续的交叉计算提供了有力的应用基础．针对体绘制中八叉树编码体数据构造基本的交叉运算如节点单元定位、区域定能和邻接节点单元搜索的需要,相应地提出了,简单而且有效的方法．这些方法是非递归的,在减少比较运算的同时不需要构建中间结果列表,进而减少了对内存的占用和避免了繁重的交叉计算．所提出的体绘制算法能在标准PC平台下快速实现超大型数据集的处理和高质量的人体内部结构图像的绘制．     

面向体绘制图像的直接体对象抠取

针对三维体对象抠取的相关工作中存在的尚多不足,提出一种体对象抠取算法.首先计算出与用户勾画结果相关的三维数据点,然后基于K-means聚类方法标记出高置信度的属于目标对象和无关对象的三维数据点,并以此作为种子点,借助基于能量优化的图割算法最终得到正确的体对象抠取结果.用户只需直接在体绘制的二维颜色叠加结果上通过简单的勾画指定目标对象和无关对象,即可抠取出感兴趣的体结构.最后通过实验说明了该算法的有效性.     

PACS下基于小波多分辨率的体绘制技术

结合小波变换和Mallat算法,提出了一种渐进式体绘制方法。在服务器端利用小波多分辨率将体数据分解为不同分辨率的离散逼近信号和细节信号;客户端重构时,先传输离散逼近信号再传输细节信号逐步细化图像。实验表明该方法只需12.5%或更少的体数据就能绘制出品质较好的图像,适用于数据量大、交互频繁的PACS系统。     

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

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

具有剪切的矢量压缩立体绘制算法

利用矢量压缩的方法进行立体绘制,一个不足是根据码本生成的Pixmap图无法应用于立体投影中的每一点,为了克服这些缺点,提出了具有Shear Warp的矢量化算法,它充分发挥了矢量量化的压缩比,以及不需要解压即可直接进行体绘制的优点,有效地利用了具有Shear Warp的体绘制方法的快速和适合立体投影的优点,克服了基于矢量量化的绘制方法的不足,几乎能够达到实时的交互绘制,是一种基于网络的绘制模式。     

四种体绘制算法的分析与评价

体绘制技术是科学计算可视化的重要组成部分,具有较大的研究价值和广阔的应用前景。体绘制有两种方法即间接体绘制和直接体绘制,直接体绘制(简称体绘制)以其在体数据处理及特征信息表现方面的优势,已经得到了研究者越来越多的重视。文章对四种典型的体绘制算法进行了描述,并概述了它们的改进之处,同时对它们各自的性能进行了分析和评价。     

直接体绘制技术研究

直接体绘制技术是可视化研究领域的一个重要分支,是目前最活跃的可视化技术之一。该文首先介绍了体绘制技术的原理,分析其实现的关键技术及算法。然后介绍了可视化工具VTK,及其对光线投射算法的实现过程。     

Adaptable Splatting for Irregular Volume Rendering

By employment of a footprint table in conducting intensity integration, splatting method has been very successful in rendering regular data volumes. Recently, the method has also been extended to render irregular data volumes. However, since samples in irregular volumes vary greatly in size and shape, the footprint table is unable to be employed in an efficient manner. This hinders the application of splatting approach from being used in the irregular volume case. In this paper, an adaptable splatting method is proposed, which provides an efficient way to integrate color intensity in terms of footprint table for the samples in various sizes. Experiments show that the new method may be used to produce better images without extra expense.     

直接体绘制技术研究

直接体绘制技术是可视化研究领域的一个重要分支,是目前最活跃的可视化技术之一。该文首先介绍了体绘制技术的原理,分析其实现的关键技术及算法。然后介绍了可视化工具VTK,及其对光线投射算法的实现过程。     

Efficient Caustic Rendering with Lightweight Photon Mapping

Robust and efficient rendering of complex lighting effects, such as caustics, remains a challenging task. While algorithms like vertex connection and merging can render such effects robustly, their significant overhead over a simple path tracer is not always justified and – as we show in this paper ‐ also not necessary. In current rendering solutions, caustics often require the user to enable a specialized algorithm, usually a photon mapper, and hand‐tune its parameters. But even with carefully chosen parameters, photon mapping may still trace many photons that the path tracer could sample well enough, or, even worse, that are not visible at all. Our goal is robust, yet lightweight, caustics rendering. To that end, we propose a technique to identify and focus computation on the photon paths that offer significant variance reduction over samples from a path tracer. We apply this technique in a rendering solution combining path tracing and photon mapping. The photon emission is automatically guided towards regions where the photons are useful, i.e., provide substantial variance reduction for the currently rendered image. Our method achieves better photon densities with fewer light paths (and thus photons) than emission guiding approaches based on visual importance. In addition, we automatically determine an appropriate number of photons for a given scene, and the algorithm gracefully degenerates to pure path tracing for scenes that do not benefit from photon mapping.