Illustrative context-preserving exploration of volume data

In volume rendering, it is very difficult to simultaneously visualize interior and exterior structures while preserving clear shape cues. Highly transparent transfer functions produce cluttered images with many overlapping structures, while clipping techniques completely remove possibly important context information. In this paper, we present a new model for volume rendering, inspired by techniques from illustration. It provides a means of interactively inspecting the interior of a volumetric data set in a feature-driven way which retains context information. The context-preserving volume rendering model uses a function of shading intensity, gradient magnitude, distance to the eye point, and previously accumulated opacity to selectively reduce the opacity in less important data regions. It is controlled by two user-specified parameters. This new method represents an alternative to conventional clipping techniques, sharing their easy and intuitive user control, but does not suffer from the drawback of missing context information     

基于切割距离场的体数据切割算法研究

为了精确地对体数据进行可以交互的切割模拟,提出了切割距离场的概念和一种基于切割距离场的三维体数据切割算法,该算法利用切割距离场作为切割体的数据表示形式,在图形处理单元(GPU)的着色器中同时实现体重建和实时切割两种功能,实验结果表明该切割算法可以达到可交互的速度,可以处理任意形状的切割体。     

A model for volume lighting and modeling

Direct volume rendering is a commonly used technique in visualization applications. Many of these applications require sophisticated shading models to capture subtle lighting effects and characteristics of volumetric data and materials. For many volumes, homogeneous regions pose problems for typical gradient-based surface shading. Many common objects and natural phenomena exhibit visual quality that cannot be captured using simple lighting models or cannot be solved at interactive rates using more sophisticated methods. We present a simple yet effective interactive shading model which captures volumetric light attenuation effects that incorporates volumetric shadows, an approximation to phase functions, an approximation to forward scattering, and chromatic attenuation that provides the subtle appearance of translucency. We also present a technique for volume displacement or perturbation that allows realistic interactive modeling of high frequency detail for both real and synthetic volumetric data.     

About the influence of illumination models on image comprehension in direct volume rendering

In this paper, we present a user study in which we have investigated the influence of seven state-of-the-art volumetric illumination models on the spatial perception of volume rendered images. Within the study, we have compared gradient-based shading with half angle slicing, directional occlusion shading, multidirectional occlusion shading, shadow volume propagation, spherical harmonic lighting as well as dynamic ambient occlusion. To evaluate these models, users had to solve three tasks relying on correct depth as well as size perception. Our motivation for these three tasks was to find relations between the used illumination model, user accuracy and the elapsed time. In an additional task, users had to subjectively judge the output of the tested models. After first reviewing the models and their features, we will introduce the individual tasks and discuss their results. We discovered statistically significant differences in the testing performance of the techniques. Based on these findings, we have analyzed the models and extracted those features which are possibly relevant for the improved spatial comprehension in a relational task. We believe that a combination of these distinctive features could pave the way for a novel illumination model, which would be optimized based on our findings.     

A versatile optical model for hybrid rendering of volume data

In volume rendering, most optical models currently in use are based on the assumptions that a volumetric object is a collection of particles and that the macro behavior of particles, when they interact with light rays, can be predicted based on the behavior of each individual particle. However, such models are not capable of characterizing the collective optical effect of a collection of particles which dominates the appearance of the boundaries of dense objects. In this paper, we propose a generalized optical model that combines particle elements and surface elements together to characterize both the behavior of individual particles and the collective effect of particles. The framework based on a new model provides a more powerful and flexible tool for hybrid rendering of isosurfaces and transparent clouds of particles in a single scene. It also provides a more rational basis for shading, so the problem of normal-based shading in homogeneous regions encountered in conventional volume rendering can be easily avoided. The model can be seen as an extension to the classical model. It can be implemented easily, and most of the advanced numerical estimation methods previously developed specifically for the particle-based optical model, such as preintegration, can be applied to the new model to achieve high-quality rendering results.     

Pre-integrated volume rendering with non-linear gradient interpolation

Shading is an important feature for the comprehension of volume datasets, but is difficult to implement accurately. Current techniques based on pre-integrated direct volume rendering approximate the volume rendering integral by ignoring non-linear gradient variations between front and back samples, which might result in cumulated shading errors when gradient variations are important and / or when the illumination function features high frequencies. In this paper, we explore a simple approach for pre-integrated volume rendering with non-linear gradient interpolation between front and back samples. We consider that the gradient smoothly varies along a quadratic curve instead of a segment in-between consecutive samples. This not only allows us to compute more accurate shaded pre-integrated look-up tables, but also allows us to more efficiently process shading amplifying effects, based on gradient filtering. An interesting property is that the pre-integration tables we use remain two-dimensional as for usual pre-integrated classification. We conduct experiments using a full hardware approach with the Blinn-Phong illumination model as well as with a non-photorealistic illumination model.     

凸多边形窗口线裁剪的折半查找算法

在Skala算法基础上,提出了一个更加快速的线裁剪算法．该算法将裁剪窗口分割成4条折线,依据折线的两个端点与被裁剪直线的位置关系,确定折线是否与直线相交;采用折半查找方法,快速确定与直线相交的窗口边界线,并求出交点位置．与Cyrus-Beck算法相比,该算法在乘除法次数和计算速度方面具有非常明显的优势,也比、Skala算法的效率更高。     

Visualization of vector fields using seed LIC and volume rendering

Line integral convolution (LIC) is a powerful texture-based technique for visualizing vector fields. Due to the high computational expense of generating 3D textures and the difficulties of effectively displaying the result, LIC has most commonly been used to depict vector fields in 2D or over a surface in 3D. We propose new methods for more effective volume visualization of three-dimensional vector fields using LIC: 1) we present a fast method for computing volume LIC textures that exploits the sparsity of the input texture. 2) We propose the use of a shading technique, called limb darkening, to reveal the depth relations among the field lines. The shading effect is obtained simply by using appropriate transfer functions and, therefore, avoids using expensive shading techniques. 3) We demonstrate how two-field visualization techniques can be used to enhance the visual information describing a vector field. The volume LIC textures are rendered using texture-based rendering techniques, which allows interactive exploration of a vector field.     

Efficient polygon clipping for an SIMD graphics pipeline

SIMD processors have become popular architectures for multimedia. Though most of the 3D graphics pipeline can be implemented on such SIMD platforms in a straightforward manner, polygon clipping tends to cause clumsy and expensive interruptions to the SIMD pipeline. This paper describes a way to increase the efficiency of SIMD clipping without sacrificing the efficient flow of a SIMD graphics pipeline. In order to fully utilize the parallel execution units, we have developed two methods to avoid serialization of the execution stream: deferred clipping postpones polygon clipping and uses hardware assistance to buffer polygons that need to be clipped. SIMD clipping partitions the actual polygon clipping procedure between the SIMD engine and a conventional RISC processor. To increase the efficiency of SIMD clipping, we introduce the concepts of clip-plane pairs and edge batching. Clip-plane pairs allow clipping a polygon against two clip planes without introducing corner vertices. Edge batching reduces the communication and control overhead for starting of clipping on the SIMD engine     

Combining estimators for Monte Carlo volume rendering with shading

Monte Carlo volume rendering (MCVR), which allows for generating X-ray like images, offers significant advantages over existing volume rendering techniques in terms of time and memory complexity. The classical shading for MCVR, however, results in a low quality image. In this paper, a so-called estimators combining technique is presented that estimates a realistic rendering using the Lambertian reflection illumination model. Such a technique is particularly adapted to changes in viewing and lighting, and provides high quality shading images exhibiting strong shape and spatial relationship of objects.     

Clustering Time Series with Clipped Data

Clustering time series is a problem that has applications in a wide variety of fields, and has recently attracted a large amount of research. Time series data are often large and may contain outliers. We show that the simple procedure of clipping the time series (discretising to above or below the median) reduces memory requirements and significantly speeds up clustering without decreasing clustering accuracy. We also demonstrate that clipping increases clustering accuracy when there are outliers in the data, thus serving as a means of outlier detection and a method of identifying model misspecification. We consider simulated data from polynomial, autoregressive moving average and hidden Markov models and show that the estimated parameters of the clipped data used in clustering tend, asymptotically, to those of the unclipped data. We also demonstrate experimentally that, if the series are long enough, the accuracy on clipped data is not significantly less than the accuracy on unclipped data, and if the series contain outliers then clipping results in significantly better clusterings. We then illustrate how using clipped series can be of practical benefit in detecting model misspecification and outliers on two real world data sets: an electricity generation bid data set and an ECG data set.     

Volume seeds: A volume exploration technique

Ray-traced volume rendering has been shown to be an effective method for visualizing 3D scalar data. However, with currently available workstation technology, interactive volume exploration using conventional volume rendering is still too slow to be attractive. This paper describes an enhanced volume rendering method which allows interactive changes of rendering parameters such as colour and opacity maps. An innovative technique is provided which allows the user to plant a ‘seed’ in the volume to rapidly modify local shading parameters. For a fixed viewing position, the user can interactively explore specific regions of interest. Furthermore, a virtual cutting technique with the exploratory seed allows the user to remove surfaces and see the internal structure of the volume. Examples demonstrate these techniques as an attractive option in many applications.     

基于图形硬件加速的体绘制关键技术综述

随着近年来计算机图形硬件性能的不断提高,利用硬件来实现体绘制过程中的某些环节以获取交互的绘制速率变为可能,并逐渐成为目前的研究热点。从体绘制的分类、明暗处理、重构、体积裁剪等4个角度对基于图形硬件加速的体绘制方法进行了分类综述,介绍了各种关键技术的研究进展和典型算法,并讨论了各自特点及其相互联系。     

三维空间的Nicholls-Lee-Nicholl裁剪算法

探讨了将传统一般平面中Nicholls-Lee-Nicholl(NLN)裁剪算法推广到三维空间。通过在窗口周围建立更多的分区,避免了一般线段裁剪算法中为求出线段对窗口的端点须进行许多无谓的计算的缺点,性能上有所提高,并与三维空间中常用的编码裁剪法,Liang_Barsky算法和Cyrus-Beck算法进行了性能比较。     

基于差分隐私的分段裁剪联邦学习算法

为解决现有的差分隐私联邦学习算法中使用固定的裁剪阈值和噪声尺度进行训练,从而导致数据隐私泄露、模型精度较低的问题,提出了一种基于差分隐私的分段裁剪联邦学习算法。首先,根据客户端的隐私需求分为隐私需求高和低。对于高隐私需求用户使用自适应裁剪来动态裁剪梯度;而低隐私需求用户则采用比例裁剪。其次根据裁剪后阈值大小自适应地添加噪声尺度。通过实验分析可得,该算法可以更好地保护隐私数据,同时通信代价也低于ADP-FL和DP-FL算法,并且与ADP-FL和DP-FL相比,模型准确率分别提高了2.25%和4.41%。     

A Directional Occlusion Shading Model for Interactive Direct Volume Rendering

Volumetric rendering is widely used to examine 3D scalar fields from CT/MRI scanners and numerical simulation datasets. One key aspect of volumetric rendering is the ability to provide perceptual cues to aid in understanding structure contained in the data. While shading models that reproduce natural lighting conditions have been shown to better convey depth information and spatial relationships, they traditionally require considerable (pre)computation. In this paper, a shading model for interactive direct volume rendering is proposed that provides perceptual cues similar to those of ambient occlusion, for both solid and transparent surface-like features. An image space occlusion factor is derived from the radiative transport equation based on a specialized phase function. The method does not rely on any precomputation and thus allows for interactive explorations of volumetric data sets via on-the-fly editing of the shading model parameters or (multi-dimensional) transfer functions while modifications to the volume via clipping planes are incorporated into the resulting occlusion-based shading.     

High-quality cardiac image dynamic visualization with feature enhancement and virtual surgical tool inclusion

Traditional approaches for rendering segmented volumetric data sets usually deliver unsatisfactory results, such as insufficient frame rate, low image quality, and intermixing artifacts. In this paper, we introduce a novel “color encoding” technique, based on graphics processing unit (GPU) accelerated raycasting and post-color attenuated classification, to address this problem. The result is an algorithm that can generate artifact-free dynamic volumetric images in real time. Next, we present a pre-integrated volume shading algorithm to reduce graphics memory requirements and computational cost when compared to traditional shading methods. We also present a normal-adjustment technique to improve image quality at clipped planes. Furthermore, we propose a new algorithm for color and depth texture indexing that permits virtual solid objects, such as surgical tools, to be manipulated within the dynamically rendered volumetric cardiac images in real time. Finally, all these techniques are combined within an environment that permits real-time visualization, enhancement, and manipulation of dynamic cardiac data sets.     

A Bit Level Representation for Time Series Data Mining with Shape Based Similarity

Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clipping is a useful and flexible transformation for the exploratory analysis of large time dependent data sets. We demonstrate how time series stored as bits can be very efficiently compressed and manipulated and that, under some assumptions, the discriminatory power with clipped series is asymptotically equivalent to that achieved with the raw data. Unlike other transformations, clipped series can be compared directly to the raw data series. We show that this means we can form a tight lower bounding metric for Euclidean and Dynamic Time Warping distance and hence efficiently query by content. Clipped data can be used in conjunction with a host of algorithms and statistical tests that naturally follow from the binary nature of the data. A series of experiments illustrate how clipped series can be used in increasingly complex ways to achieve better results than other popular representations. The usefulness of the proposed representation is demonstrated by the fact that the results with clipped data are consistently better than those achieved with a Wavelet or Discrete Fourier Transformation at the same compression ratio for both clustering and query by content. The flexibility of the representation is shown by the fact that we can take advantage of a variable Run Length Encoding of clipped series to define an approximation of the Kolmogorov complexity and hence perform Kolmogorov based clustering.     

Creative parameter selection for volume visualization

Most of the available algorithms for scalar volume visualization offer predefined techniques such as display of volumetric regions defined by scalar threshold values. The regions can usually be drawn opaque or transparent or appear in combinations. This paper presents an implementation of a volume visualization concept where several modelling and rendering techniques can be applied in any combination, mainly bounded by the creativity of the user. The concept is based on the use of a model for light scattering in a field of varying density emitters, and the use of fixed visual references to improve readability and disambiguate interpretation. An image is computed by means of an interval-based mapping from scalar range to visual parameters. Each interval has a set of associated parameters, such as colour and attenuation. In addition, each interval of the scalar range must be mapped into relative density by means of a transfer function which is selected in a ‘natural way’ depending on application. A methodology is suggested which enable the piecewise transfer functions to be easily determined. A prototype user-interface for the mapping from scalar values to visual parameters is demonstrated. The interface is easy to use for the beginner, while it also encourages creativity and intuition in the process of selecting parameters.     

The Priority Tree, a HL/HSR Approach for PHIGS

The Programmer's Hierarchical Interactive Grahics System (PHIGS) specifies an interface for programming device-independent computer graphics applications. PHIGS provides a powerful data grouping mechanism, called the PHIGS structure, that may be used to model the geometry of 3D objects. Hidden Line/Hidden Surface Removal (HL/HSR) is a required process to produce realistic solid views of the modeled objects. Modeling clip is an essential process for viewing a clipped portion of the modeled objects. A technique is presented that provides HL/HSR and modeling clip as added utilities to PHIGS. The technique is based on the Binary Space Partitioning (BSP) tree (sometimes called priority tree), and involves a back to front sorting of the primitives of a PHIGS structure network to another PHIGS structure. Modeling clip is achieved by limiting the sorting to those primitives in a specified clip ping region of the object space. The resulting structure when displayed on a raster device produces a realistic view of the possibly clipped object that was originally modeled by the PHIGS structure network.