Volume 27 (2008)
Permanent URI for this community
Browse
Browsing Volume 27 (2008) by Title
Now showing 1 - 20 of 240
Results Per Page
Sort Options
Item 2008 Eurographics Symposium on Parallel Graphics and Visualization(The Eurographics Association and Blackwell Publishing Ltd, 2008) Weiskopf, DanielItem 29th EUROGRAPHICS General Assembly(The Eurographics Association and Blackwell Publishing Ltd, 2008)Item Abstractive Representation and Exploration of Hierarchically Clustered Diffusion Tensor Fiber Tracts(The Eurographics Association and Blackwell Publishing Ltd., 2008) Chen, Wei; Zhang, Song; Correia, Stephen; Ebert, David S.; A. Vilanova, A. Telea, G. Scheuermann, and T. MoellerDiffusion tensor imaging (DTI) has been used to generate fibrous structures in both brain white matter and muscles. Fiber clustering groups the DTI fibers into spatially and anatomically related tracts. As an increasing number of fiber clustering methods have been recently developed, it is important to display, compare, and explore the clustering results efficiently and effectively. In this paper, we present an anatomical visualization technique that reduces the geometric complexity of the fiber tracts and emphasizes the high-level structures. Beginning with a volumetric diffusion tensor image, we first construct a hierarchical clustering representation of the fiber bundles. These bundles are then reformulated into a 3D multi-valued volume data. We then build a set of geometric hulls and principal fibers to approximate the shape and orientation of each fiber bundle. By simultaneously visualizing the geometric hulls, individual fibers, and other data sets such as fractional anisotropy, the overall shape of the fiber tracts are highlighted, while preserving the fibrous details. A rater with expert knowledge of white matter structure has evaluated the resulting interactive illustration and confirmed the improvement over straightforward DTI fiber tract visualization.Item Accelerating Ray Tracing using Constrained Tetrahedralizations(The Eurographics Association and Blackwell Publishing Ltd, 2008) Lagae, Ares; Dutre, PhilipIn this paper we introduce the constrained tetrahedralization as a new acceleration structure for ray tracing. A constrained tetrahedralization of a scene is a tetrahedralization that respects the faces of the scene geometry. The closest intersection of a ray with a scene is found by traversing this tetrahedralization along the ray, one tetrahedron at a time. We show that constrained tetrahedralizations are a viable alternative to current acceleration structures, and that they have a number of unique properties that set them apart from other acceleration structures: constrained tetrahedralizations are not hierarchical yet adaptive; the complexity of traversing them is a function of local geometric complexity rather than global geometric complexity; constrained tetrahedralizations support deforming geometry without any effort; and they have the potential to unify several data structures currently used in global illumination.Item Accurate Shadows by Depth Complexity Sampling(The Eurographics Association and Blackwell Publishing Ltd, 2008) Forest, Vincent; Barthe, Loic; Paulin, MathiasThe accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate the generation of shadows from the computation of lighting. In addition to such approximations, they generate shadows using some restrictive assumptions only correct in very specific cases, leading to penumbra over-estimation or light-leaking artifacts. In this paper we present an algorithm that produces soft shadows without exhibiting the previous drawbacks. Using a new efficient evaluation of the number of occluders between two points (i.e. the depth complexity) we either modulate direct lighting or numerically solve the rendering equation for direct illumination. Our approach approximates shadows cast by semi-opaque occluders and naturally handles area lights with spatially varying luminance. Furthermore, depending on the desired performance and quality, the resulting shadows are either very close to, or as accurate as, a ray-traced reference. As a result, the presented method is well suited to many domains, ranging from quality-sensitive to performance-critical applications.Item An Adaptive Contact Model for the Robust Simulation of Knots(The Eurographics Association and Blackwell Publishing Ltd, 2008) Spillmann, Jonas; Teschner, MatthiasIn this paper, we present an adaptive model for dynamically deforming hyper-elastic rods. In contrast to existing approaches, adaptively introduced control points are not governed by geometric subdivision rules. Instead, their states are determined by employing a non-linear energy-minimization approach. Since valid control points are computed instantaneously, post-stabilization schemes are avoided and the stability of the dynamic simulation is improved.Due to inherently complex contact configurations, the simulation of knot tying using rods is a challenging task. In order to address this problem, we combine our adaptive model with a robust and accurate collision handling method for elastic rods. By employing our scheme, complex knot configurations can be simulated in a physically plausible way.Item Adaptive Surface Texture Synthesis Using Round-Shaped Neighbourhoods(The Eurographics Association and Blackwell Publishing Ltd, 2008) Chen, D.; Dong, F.This paper presents a novel surface texture synthesis method, which is capable of producing high-quality results by performing the synthesis within an effective multi-resolution scheme using an adaptive texture similarity metric. Compared with related works, our method allows us to directly carry out multi-resolution synthesis without involving complicated operations such as mesh hierarchy and partitioning on the target surface. Also, the adaptive similarity metric focuses on measuring texture properties at different scales ranging from local to global, allowing for consistency within differently-sized texture structures. Further, with the introduced round shaped neighbourhoods, we can save considerable amount of computation for the surface texture synthesis over variable texture directions. Experimental results are provided and comparisons are made against other latest works.Item Agile Spectrum Imaging: Programmable Wavelength Modulation for Cameras and Projectors(The Eurographics Association and Blackwell Publishing Ltd, 2008) Mohan, Ankit; Raskar, Ramesh; Tumblin, JackWe advocate the use of quickly-adjustable, computer-controlled color spectra in photography, lighting and displays. We present an optical relay system that allows mechanical or electronic color spectrum control and use it to modify a conventional camera and projector. We use a diffraction grating to disperse the rays into different colors, and introduce a mask (or LCD/DMD) in the optical path to modulate the spectrum. We analyze the trade-offs and limitations of this design, and demonstrate its use in a camera, projector and light source. We propose applications such as adaptive color primaries, metamer detection, scene contrast enhancement, photographing fluorescent objects, and high dynamic range photography using spectrum modulation.Item An Analysis of the In-Out BRDF Factorization for View-Dependent Relighting(The Eurographics Association and Blackwell Publishing Ltd, 2008) Mahajan, Dhruv; Tseng, Yu-Ting; Ramamoorthi, RaviInteractive rendering with dynamic natural lighting and changing view is a long-standing goal in computer graphics. Recently, precomputation-based methods for all-frequency relighting have made substantial progress in this direction. Many of the most successful algorithms are based on a factorization of the BRDF into incident and outgoing directions, enabling each term to be precomputed independent of viewing direction, and re-combined at run-time. However, there has so far been no theoretical understanding of the accuracy of this factorization, nor the number of terms needed. In this paper, we conduct a theoretical and empirical analysis of the BRDF in-out factorization. For Phong BRDFs, we obtain analytic results, showing that the number of terms needed grows linearly with the Phong exponent, while the factors correspond closely to spherical harmonic basis functions. More generally, the number of terms is quadratic in the frequency content of the BRDF along the reflected or half-angle direction. This analysis gives clear practical guidance on the number of factors needed for a given material. Different objects in a scene can each be represented with the correct number of terms needed for that particular BRDF, enabling both accuracy and interactivity.Item Animating Causal Overlays(The Eurographics Association and Blackwell Publishing Ltd., 2008) Bartram, Lyn; Yao, Miao; A. Vilanova, A. Telea, G. Scheuermann, and T. MoellerMost approaches to representing causality, such as the common causal graph, require a separate and static view, but in many cases it is useful to add the dimension of causality to the context of an existing visualization. Building on research from perceptual psychology that shows the perception of causality is a low-level visual event derived from certain types of motion, we are investigating how to add animated causal representations, called visual causal vectors, onto other visualizations. We refer to these as causal overlays. Our initial experimental results show this approach has great potential but that extra cues are needed to elicit the perception of causality when the motions are overlaid on other graphical objects. In this paper we describe the approach and report on a study that examined two issues of this technique: how to accurately convey the causal flow and how to represent the strength of the causal effect.Item Apparent Greyscale: A Simple and Fast Conversion to Perceptually Accurate Images and Video(The Eurographics Association and Blackwell Publishing Ltd, 2008) Smith, Kaleigh; Landes, Pierre-Edouard; Thollot, Joelle; Myszkowski, KarolThis paper presents a quick and simple method for converting complex images and video to perceptually accurate greyscale versions. We use a two-step approach first to globally assign grey values and determine colour ordering, then second, to locally enhance the greyscale to reproduce the original contrast. Our global mapping is image independent and incorporates the Helmholtz-Kohlrausch colour appearance effect for predicting differences between isoluminant colours. Our multiscale local contrast enhancement reintroduces lost discontinuities only in regions that insufficiently represent original chromatic contrast. All operations are restricted so that they preserve the overall image appearance, lightness range and differences, colour ordering, and spatial details, resulting in perceptually accurate achromatic reproductions of the colour original.Item Articulated Object Reconstruction and Markerless Motion Capture from Depth Video(The Eurographics Association and Blackwell Publishing Ltd, 2008) Pekelny, Yuri; Gotsman, CraigWe present an algorithm for acquiring the 3D surface geometry and motion of a dynamic piecewise-rigid object using a single depth video camera. The algorithm identifies and tracks the rigid components in each frame, while accumulating the geometric information acquired over time, possibly from different viewpoints. The algorithm also reconstructs the dynamic skeleton of the object, thus can be used for markerless motion capture. The acquired model can then be animated to novel poses. We show the results of the algorithm applied to synthetic and real depth video.Item Augmented Panoramic Video(The Eurographics Association and Blackwell Publishing Ltd, 2008) Hermans, C.; Vanaken, C.; Mertens, T.; Van Reeth, F.; Bekaert, P.Many video sequences consist of a locally dynamic background containing moving foreground subjects. In this paper we propose a novel way of re-displaying these sequences, by giving the user control over a virtual camera frame. Based on video mosaicing, we first compute a static high quality background panorama. After segmenting and removing the foreground subjects from the original video, the remaining elements are merged into a dynamic background panorama, which seamlessly extends the original video footage. We then re-display this augmented video by warping and cropping the panorama. The virtual camera can have an enlarged field-of-view and a controlled camera motion. Our technique is able to process videos with complex camera motions, reconstructing high quality panoramas without parallax artefacts, visible seams or blurring, while retaining repetitive dynamic elements.Item Automatic Conversion of Mesh Animations into Skeleton-based Animations(The Eurographics Association and Blackwell Publishing Ltd, 2008) De Aguiar, Edilson; Theobalt, Christian; Thrun, Sebastian; Seidel, Hans-PeterRecently, it has become increasingly popular to represent animations not by means of a classical skeleton-based model, but in the form of deforming mesh sequences. The reason for this new trend is that novel mesh deformation methods as well as new surface based scene capture techniques offer a great level of flexibility during animation creation. Unfortunately, the resulting scene representation is less compact than skeletal ones and there is not yet a rich toolbox available which enables easy post-processing and modification of mesh animations. To bridge this gap between the mesh-based and the skeletal paradigm, we propose a new method that automatically extracts a plausible kinematic skeleton, skeletal motion parameters, as well as surface skinning weights from arbitrary mesh animations. By this means, deforming mesh sequences can be fully-automatically transformed into fullyrigged virtual subjects. The original input can then be quickly rendered based on the new compact bone and skin representation, and it can be easily modified using the full repertoire of already existing animation tools.Item Automatic Detection and Visualization of Distinctive Structures in 3D Unsteady Multi-fields(The Eurographics Association and Blackwell Publishing Ltd., 2008) Jänicke, Heike; Böttinger, Michael; Tricoche, Xavier; Scheuermann, Gerik; A. Vilanova, A. Telea, G. Scheuermann, and T. MoellerCurrent unsteady multi-field simulation data-sets consist of millions of data-points. To efficiently reduce this enormous amount of information, local statistical complexity was recently introduced as a method that identifies distinctive structures using concepts from information theory. Due to high computational costs this method was so far limited to 2D data. In this paper we propose a new strategy for the computation that is substantially faster and allows for a more precise analysis. The bottleneck of the original method is the division of spatio-temporal configurations in the field (light-cones) into different classes of behavior. The new algorithm uses a density-driven Voronoi tessellation for this task that more accurately captures the distribution of configurations in the sparsely sampled high-dimensional space. The efficient computation is achieved using structures and algorithms from graph theory. The ability of the method to detect distinctive regions in 3D is illustrated using flow and weather simulations.Item Automatic Facsimile of Chinese Calligraphic Writings(The Eurographics Association and Blackwell Publishing Ltd, 2008) Xu, Songhua; Jiang, Hao; Jin, Tao; Lau, Francis C.M.; Pan, YunheItem Automatic Registration for Articulated Shapes(The Eurographics Association and Blackwell Publishing Ltd, 2008) Chang, Will; Zwicker, MatthiasWe present an unsupervised algorithm for aligning a pair of shapes in the presence of significant articulated motion and missing data, while assuming no knowledge of a template, user-placed markers, segmentation, or the skeletal structure of the shape. We explicitly sample the motion, which gives a priori the set of possible rigid transformations between parts of the shapes. This transforms the problem into a discrete labeling problem, where the goal is to find an optimal assignment of transformations for aligning the shapes. We then apply graph cuts to optimize a novel cost function, which encodes a preference for a consistent motion assignment from both source to target and target to source. We demonstrate the robustness of our method by aligning several synthetic and real-world datasets.Item The Beam Radiance Estimate for Volumetric Photon Mapping(The Eurographics Association and Blackwell Publishing Ltd, 2008) Jarosz, Wojciech; Zwicker, Matthias; Jensen, Henrik WannWe present a new method for efficiently simulating the scattering of light within participating media. Using a theoretical reformulation of volumetric photon mapping, we develop a novel photon gathering technique for participating media. Traditional volumetric photon mapping samples the in-scattered radiance at numerous points along the length of a single ray by performing costly range queries within the photon map. Our technique replaces these multiple point-queries with a single beam-query, which explicitly gathers all photons along the length of an entire ray. These photons are used to estimate the accumulated in-scattered radiance arriving from a particular direction and need to be gathered only once per ray. Our method handles both fixed and adaptive kernels, is faster than regular volumetric photon mapping, and produces images with less noise.Item A Biorthogonal Wavelet Approach based on Dual Subdivision(The Eurographics Association and Blackwell Publishing Ltd, 2008) Zhang, Hui; Qin, Guiming; Qin, Kaihuai; Sun, HanqiuIn this paper a biorthogonal wavelet approach based on Doo-Sabin subdivision is presented. In the dual subdivision like Doo-Sabin scheme, all the old control vertices disappear after one subdivision step, which is a big challenge to the biorthogonal wavelet construction. In our approach, the barycenters of the V-faces corresponding to the old vertices are selected as the vertices associated with the scaling functions to construct the scaling space. The lifting scheme is used to guarantee the fitting quality of the wavelet transform, and a local orthogonalization is introduced with a discrete inner product operation to improve the computation efficiency. Sharp feature modeling based on extended Doo-Sabin subdivision rules is also discussed in the framework of our wavelet construction. The presented wavelet construction is proven to be stable and effective by the experimental results.Item Book Review(The Eurographics Association and Blackwell Publishing Ltd, 2008)