EGSR07: 18th Eurographics Symposium on Rendering

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/386

Browse

Now showing 1 - 20 of 35

Compressed Random-Access Trees for Spatially Coherent Data
(The Eurographics Association, 2007) Lefebvre, Sylvain; Hoppe, Hugues; Jan Kautz and Sumanta Pattanaik
Adaptive multiresolution hierarchies are highly efficient at representing spatially coherent graphics data. We introduce a framework for compressing such adaptive hierarchies using a compact randomly-accessible tree structure. Prior schemes have explored compressed trees, but nearly all involve entropy coding of a sequential traversal, thus preventing fine-grain random queries required by rendering algorithms. Instead, we use fixed-rate encoding for both the tree topology and its data. Key elements include the replacement of pointers by local offsets, a forested mipmap structure, vector quantization of inter-level residuals, and efficient coding of partially defined data. Both the offsets and codebook indices are stored as byte records for easy parsing by either CPU or GPU shaders. We show that continuous mipmapping over an adaptive tree is more efficient using primal subdivision than traditional dual subdivision. Finally, we demonstrate efficient compression of many data types including light maps, alpha mattes, distance fields, and HDR images.
Convolution Shadow Maps
(The Eurographics Association, 2007) Annen, Thomas; Mertens, Tom; Bekaert, Philippe; Seidel, Hans-Peter; Kautz, Jan; Jan Kautz and Sumanta Pattanaik
We present Convolution Shadow Maps, a novel shadow representation that affords efficient arbitrary linear filtering of shadows. Traditional shadow mapping is inherently non-linear w.r.t. the stored depth values, due to the binary shadow test. We linearize the problem by approximating shadow test as a weighted summation of basis terms. We demonstrate the usefulness of this representation, and show that hardware-accelerated anti-aliasing techniques, such as tri-linear filtering, can be applied naturally to Convolution Shadow Maps. Our approach can be implemented very efficiently in current generation graphics hardware, and offers real-time frame rates.
Dirty Glass: Rendering Contamination on Transparent Surfaces
(The Eurographics Association, 2007) Gu, Jinwei; Ramamoorthi, Ravi; Belhumeur, Peter; Nayar, Shree; Jan Kautz and Sumanta Pattanaik
Rendering of clean transparent objects has been well studied in computer graphics. However, real-world transparent objects are seldom clean their surfaces have a variety of contaminants such as dust, dirt, and lipids. These contaminants produce a number of complex volumetric scattering effects that must be taken into account when creating photorealistic renderings. In this paper, we take a step toward modeling and rendering these effects. We make the assumption that the contaminant is an optically thin layer and construct an analytic model following results in radiative transport theory and computer graphics. Moreover, the spatial textures created by the different types of contamination are also important in achieving visual realism. To this end, we measure the spatially varying thicknesses and the scattering parameters of a number of glass panes with various types of dust, dirt, and lipids. We also develop a simple interactive synthesis tool to create novel instances of the measured contamination patterns. We show several results that demonstrate the use of our scattering model for rendering 3D scenes, as well as modifying real 2D photographs.
Dynamic Point Distribution for Stroke-based Rendering
(The Eurographics Association, 2007) Vanderhaeghe, David; Barla, Pascal; Thollot, Joelle; Sillion, Francois X.; Jan Kautz and Sumanta Pattanaik
We present a new point distribution algorithm that is well adapted to stroke-based rendering systems. Its main characteristic is to deal efficiently with three conflicting constraints: the distribution of points should retain a good repartition in 2D; their motion should tightly follow the target motion in the underlying scene; and as few points as possible should be added or deleted from frame to frame. We show that previous methods fail to meet at least one of these constraints in the general case, as opposed to our approach that is independent of scene complexity and motion. As a result, our algorithm is able to take 3D scenes as well as videos as input and create non-uniform distributions with good temporal coherence and density properties. To illustrate it, we show applications in four different styles: stippling, pointillism, hatching and painterly.
Efficient Basis Decomposition for Scattered Reflectance Data
(The Eurographics Association, 2007) Weistroffer, R. Peter; Walcott, Kristen R.; Humphreys, Greg; Lawrence, Jason; Jan Kautz and Sumanta Pattanaik
Recent progress in acquisition technology has increased the availability and quality of measured appearance data. Although representations based on dimensionality reduction provide the greatest fidelity to measured data, they require assembling a high-resolution and regularly sampled matrix from sparse and non-uniformly scattered input. Constructing and processing this immense matrix becomes a significant computational bottleneck. We describe a technique for performing basis decomposition directly from scattered measurements. Our approach is flexible in how the basis is represented and can accommodate any number of linear constraints on the factorization. Because its time- and space-complexity is proportional to the number of input measurements and the size of the output, we are able to decompose multi-gigabyte datasets faster and at lower error rates than currently available techniques. We evaluate our approach by representing measured spatially-varying reflectance within a reduced linear basis defined over radial basis functions and a database of measured BRDFs.
Efficient Rendering of Human Skin
(The Eurographics Association, 2007) d'Eon, Eugene; Luebke, David; Enderton, Eric; Jan Kautz and Sumanta Pattanaik
Existing offline techniques for modeling subsurface scattering effects in multi-layered translucent materials such as human skin achieve remarkable realism, but require seconds or minutes to generate an image. We demonstrate rendering of multi-layer skin that achieves similar visual quality but runs orders of magnitude faster. We show that sums of Gaussians provide an accurate approximation of translucent layer diffusion profiles, and use this observation to build a novel skin rendering algorithm based on texture space diffusion and translucent shadow maps. Our technique requires a parameterized model but does not otherwise rely on any precomputed information, and thus extends trivially to animated or deforming models. We achieve about 30 frames per second for realistic real-time rendering of deformable human skin under dynamic lighting.
Feature-Guided Dynamic Texture Synthesis on Continuous Flows
(The Eurographics Association, 2007) Narain, Rahul; Kwatra, Vivek; Lee, Huai-Ping; Kim, Theodore; Carlson, Mark; Lin, Ming C.; Jan Kautz and Sumanta Pattanaik
We present a technique for synthesizing spatially and temporally varying textures on continuous flows using image or video input, guided by the physical characteristics of the fluid stream itself. This approach enables the generation of realistic textures on the fluid that correspond to the local flow behavior, creating the appearance of complex surface effects, such as foam and small bubbles. Our technique requires only a simple specification of texture behavior, and automatically generates and tracks the features and texture over time in a temporally coherent manner. Based on this framework, we also introduce a technique to perform feature-guided video synthesis. We demonstrate our algorithm on several simulated and recorded natural phenomena, including splashing water and lava flows. We also show how our methodology can be extended beyond realistic appearance synthesis to more general scenarios, such as temperature-guided synthesis of complex surface phenomena in a liquid during boiling.
General Linear Cameras with Finite Aperture
(The Eurographics Association, 2007) Adams, Andrew; Levoy, Marc; Jan Kautz and Sumanta Pattanaik
A pinhole camera selects a two-dimensional set of rays from the four-dimensional light field. Pinhole cameras are a type of general linear camera, defined as planar 2D slices of the 4D light field. Cameras with finite apertures can be considered as the summation of a collection of pinhole cameras. In the limit they evaluate a two-dimensional integral of the four-dimensional light field. Hence a general linear camera with finite aperture factors the 4D light field into two integrated dimensions and two imaged dimensions. We present a simple framework for representing these slices and integral projections, based on certain eigenspaces in a two-plane parameterization of the light field. Our framework allows for easy analysis of focus and perspective, and it demonstrates their dual nature. Using our framework, we present analogous taxonomies of perspective and focus, placing within them the familiar perspective, orthographic, cross-slit, and bilinear cameras; astigmatic and anastigmatic focus; and several other varieties of perspective and focus.
Global Illumination for the Masses
(The Eurographics Association, 2007) Gatenby, Neil; Jan Kautz and Sumanta Pattanaik
Global Illumination (GI) algorithms came to fruition in the Graphics labs of USA, Europe, Japan, and beyond, during the 1980s and 1990s. The researchers who developed the algorithms had expert knowledge of the underlying physics, and an even more expert knowledge of how their own software behaved (and misbehaved!). Ten years ago, only the most specialised applications contained GI rendering algorithms those targetted at architects, or automotive manufacturers, or digital imagery for movies/advertising. The number of seats was always small, and the price per seat was always large. Radiosity, ray tracing and photon mapping, final gathering, irradiance caches and the use of MC and QMC importance sampling may all appear on an undergraduate graphics course in 2007, but they are still not the kind of thing one overhears being discussed in the average public house, or cafe! Yet today, it is hard to find AEC or MCAD software that does not contain such algorithms. Many of the public houses and cafes where the algorithms are not discussed contain customers who have kitchen (or bathroom, or garden) design software on their PC/Mac at home. They might not use it very often, nor explore its limits when they do use it, but use it they do. There are many millions of such users, and none of them has paid very much for the software in question. This talk will discuss the difficulties and opportunities that arise when designing GI software for such a market place, and will outline some of the shortcuts and tricks that are commonly employed by those writing the code.
High Dynamic Range Image Hallucination
(The Eurographics Association, 2007) Wang, Lvdi; Wei, Li-Yi; Zhou, Kun; Guo, Baining; Shum, Heung-Yeung; Jan Kautz and Sumanta Pattanaik
We introduce high dynamic range image hallucination for adding high dynamic range details to the over-exposed and under-exposed regions of a low dynamic range image. Our method is based on a simple assumption: there exist high quality patches in the image with similar textures as the regions that are over or under exposed. Hence, we can add high dynamic range details to a region by simply transferring texture details from another patch that may be under different illumination levels. In our approach, a user only needs to annotate the image with a few strokes to indicate textures that can be applied to the corresponding under-exposed or over-exposed regions, and these regions are automatically hallucinated by our algorithm. Experiments demonstrate that our simple, yet effective approach is able to significantly increase the amount of texture details in a wide range of common scenarios, with a modest amount of user interaction.
Incremental Instant Radiosity for Real-Time Indirect Illumination
(The Eurographics Association, 2007) Laine, Samuli; Saransaari, Hannu; Kontkanen, Janne; Lehtinen, Jaakko; Aila, Timo; Jan Kautz and Sumanta Pattanaik
We present a method for rendering single-bounce indirect illumination in real time on currently available graphics hardware. The method is based on the instant radiosity algorithm, where virtual point lights (VPLs) are generated by casting rays from the primary light source. Hardware shadow maps are then employed for determining the indirect illumination from the VPLs. Our main contribution is an algorithm for reusing the VPLs and incrementally maintaining their good distribution. As a result, only a few shadow maps need to be rendered per frame as long as the motion of the primary light source is reasonably smooth. This yields real-time frame rates even when hundreds of VPLs are used.
Instant Sound Scattering
(The Eurographics Association, 2007) Tsingos, Nicolas; Dachsbacher, Carsten; Lefebvre, Sylvain; Dellepiane, Matteo; Jan Kautz and Sumanta Pattanaik
Real-time sound rendering engines often render occlusion and early sound reflection effects using geometrical techniques such as ray or beam tracing. They can only achieve interactive rendering for environments of low local complexity resulting in crude effects which can degrade the sense of immersion. However, surface detail or complex dynamic geometry has a strong influence on sound propagation and the resulting auditory perception. This paper focuses on high-quality modeling of first-order sound scattering. Based on a surface-integral formulation and the Kirchhoff approximation, we propose an efficient evaluation of scattering effects, including both diffraction and reflection, that leverages programmable graphics hardware for dense sampling of complex surfaces. We evaluate possible surface simplification techniques and show that combined normal and displacement maps can be successfully used for audio scattering calculations. We present an auralization framework that can render scattering effects interactively thus providing a more compelling experience. We demonstrate that, while only considering first order phenomena, our approach can provide realistic results for a number of practical interactive applications. It can also process highly detailed models containing millions of unorganized triangles in minutes, generating high-quality scattering filters. Resulting simulations compare well with on-site recordings showing that the Kirchhoff approximation can be used for complex scattering problems.
Interactive Illumination with Coherent Shadow Maps
(The Eurographics Association, 2007) Ritschel, Tobias; Grosch, Thorsten; Kautz, Jan; Mueller, Stefan; Jan Kautz and Sumanta Pattanaik
We present a new method for interactive illumination computations based on precomputed visibility using coherent shadow maps (CSMs). It is well-known that visibility queries dominate the cost of physically based rendering. Precomputing all visibility events, for instance in the form of many shadow maps, enables fast queries and allows for real-time computation of illumination but requires prohibitive amounts of storage. We propose a lossless compression scheme for visibility information based on shadow maps that efficiently exploits coherence. We demonstrate a Monte Carlo renderer for direct lighting using CSMs that runs entirely on graphics hardware. We support spatially varying BRDFs, normal maps, and environment maps all with high frequencies, spatial as well as angular. Multiple dynamic rigid objects can be combined in a scene. As opposed to precomputed radiance transfer techniques, that assume distant lighting, our method includes distant lighting as well as local area lights of arbitrary shape, varying intensity, or anisotropic light distribution that can freely vary over time.
An Interactive Perceptual Rendering Pipeline using Contrast and Spatial Masking
(The Eurographics Association, 2007) Drettakis, George; Bonneel, Nicolas; Dachsbacher, Carsten; Lefebvre, Sylvain; Schwarz, Michael; Viaud-Delmon, Isabelle; Jan Kautz and Sumanta Pattanaik
We present a new perceptual rendering pipeline which takes into account visual masking due to contrast and spatial frequency. Our framework predicts inter-object, scene-level masking caused by partial occlusion and shadows. It is designed for interactive applications and runs efficiently on the GPU. This is achieved using a layer-based approach together with an efficient GPU-based computation of threshold maps. We build upon this prediction framework to introduce a perceptually-based level of detail control algorithm. We conducted a perceptual user study which indicates that our perceptual pipeline generates results which are consistent with what the user perceives. Our results demonstrate significant quality improvement for scenes with masking due to frequencies and contrast, such as masking due to trees or foliage, or due to high-frequency shadows.
Interactive Smooth and Curved Shell Mapping
(The Eurographics Association, 2007) Jeschke, Stefan; Mantler, Stephan; Wimmer, Michael; Jan Kautz and Sumanta Pattanaik
Shell mapping is a technique to represent three-dimensional surface details. This is achieved by extruding the triangles of an existing mesh along their normals, and mapping a 3D function (e.g., a 3D texture) into the resulting prisms. Unfortunately, such a mapping is nonlinear. Previous approaches perform a piece-wise linear approximation by subdividing the prisms into tetrahedrons. However, such an approximation often leads to severe artifacts. In this paper we present a correct (i.e., smooth) mapping that does not rely on a decomposition into tetrahedrons. We present an efficient GPU ray casting algorithm which provides correct parallax, self-occlusion, and silhouettes, at the cost of longer rendering times. The new formulation also allows modeling shells with smooth curvatures using Coons patches within the prisms. Tangent continuity between adjacent prisms is guaranteed, while the mapping itself remains local, i.e. every curved prism content is modeled at runtime in the GPU without the need for any precomputation. This allows instantly replacing animated triangular meshes with prism-based shells.
Large-Scale Data Management for PRT-Based Real-Time Rendering of Dynamically Skinned Models
(The Eurographics Association, 2007) Feng, Wei-Wen; Peng, Liang; Jia, Yuntao; Yu, Yizhou; Jan Kautz and Sumanta Pattanaik
Computer games and real-time applications frequently adopt mesh skinning as a deformation technique for virtual characters and articulated objects. Rendering skinned models with global shading effects, such as interreflection and subsurface scattering, using precomputed radiance transfer enables high-quality real-time display of dynamically deformed objects. In this approach, we need to precompute radiance transfer for many sampled poses. Resulting datasets reach hundreds of gigabytes, and are orders of magnitude larger than those for a static object. This paper presents simple but effective large-scale data management techniques so that runtime data communication, decompression and interpolation can be performed efficiently and accurately. Specifically, we have developed a mesh clustering technique based on spectral graph partitioning to facilitate interpolation from nearest neighbors and an incremental clustering method for transfer matrix compression. By exploiting additional data redundancies among different sampled poses, we can achieve higher compression ratios with the same fidelity. Our incremental clustering can make the runtime cost of per-frame data decompression and interpolation satisfy a prescribed upper bound. As a result, we can achieve real-time performance using the massive precomputed data and an efficient runtime algorithm.
Material Based Splashing of Water Drops
(The Eurographics Association, 2007) Garg, Kshitiz; Krishnan, Gurunandan G.; Nayar, Shree K.; Jan Kautz and Sumanta Pattanaik
The splashing of a water drop is a fascinating phenomenon that results from a variety of complex interactions between the drop and the material it impacts. In general, the distribution of droplets of a splash depends on the drop size and velocity; the surface roughness, rigidity, and wetness; and the angle of impact. Given the number of factors involved, it is difficult to develop an analytical model for the splash distribution. Instead, we take an empirical approach. We have measured the splashing behaviors of 22 different materials that are commonly found in the real world. These materials can be broadly classified as rough (e.g., wood and brick), smooth (e.g., marble and glass), flexible (e.g., silk and paper), and miscellaneous (e.g., water and moss). We have developed a stochastic model for splash distribution that builds upon empirical models previously developed in fluid dynamics and meteorology. Our model is simple and only requires 7 coefficients for generating splashes for head-on impact for a material. A more general model for generating splashes for arbitrary impact angles (due to surface inclination or wind) requires 54 coefficients. The models of different materials may be combined to generate physically plausible splashes for novel materials that have not been measured. Our model is applicable for rendering splashes due to rain as well as water drops falling from large heights such as windowsills, trees, and rooftops.
Microfacet Models for Refraction through Rough Surfaces
(The Eurographics Association, 2007) Walter, Bruce; Marschner, Stephen R.; Li, Hongsong; Torrance, Kenneth E.; Jan Kautz and Sumanta Pattanaik
Microfacet models have proven very successful for modeling light reflection from rough surfaces. In this paper we review microfacet theory and demonstrate how it can be extended to simulate transmission through rough surfaces such as etched glass. We compare the resulting transmission model to measured data from several real surfaces and discuss appropriate choices for the microfacet distribution and shadowing-masking functions. Since rendering transmission through media requires tracking light that crosses at least two interfaces, good importance sampling is a practical necessity. Therefore, we also describe efficient schemes for sampling the microfacet models and the corresponding probability density functions.
Natural Image Colorization
(The Eurographics Association, 2007) Luan, Qing; Wen, Fang; Cohen-Or, Daniel; Liang, Lin; Xu, Ying-Qing; Shum, Heung-Yeung; Jan Kautz and Sumanta Pattanaik
In this paper, we present an interactive system for users to easily colorize the natural images of complex scenes. In our system, colorization procedure is explicitly separated into two stages: Color labeling and Color mapping. Pixels that should roughly share similar colors are grouped into coherent regions in the color labeling stage, and the color mapping stage is then introduced to further fine-tune the colors in each coherent region. To handle textures commonly seen in natural images, we propose a new color labeling scheme that groups not only neighboring pixels with similar intensity but also remote pixels with similar texture. Motivated by the insight into the complementary nature possessed by the highly contrastive locations and the smooth locations, we employ a smoothness map to guide the incorporation of intensity-continuity and texture-similarity constraints in the design of our labeling algorithm. Within each coherent region obtained from the color labeling stage, the color mapping is applied to generate vivid colorization effect by assigning colors to a few pixels in the region. A set of intuitive interface tools is designed for labeling, coloring and modifying the result. We demonstrate compelling results of colorizing natural images using our system, with only a modest amount of user input.
Photorealistic Image Rendering with Population Monte Carlo Energy Redistribution
(The Eurographics Association, 2007) Lai, Yu-Chi; Fan, Shao Hua; Chenney, Stephen; Dyer, Charcle; Jan Kautz and Sumanta Pattanaik
This work presents a novel global illumination algorithm which concentrates computation on important light transport paths and automatically adjusts energy distributed area for each light transport path. We adapt statistical framework of Population Monte Carlo into global illumination to improve rendering efficiency. Information collected in previous iterations is used to guide subsequent iterations by adapting the kernel function to approximate the target distribution without introducing bias into the final result. Based on this framework, our algorithm automatically adapts the amount of energy redistribution at different pixels and the area over which energy is redistributed. Our results show that the efficiency can be improved by exploring the correlated information among light transport paths.

Browse

Browsing EGSR07: 18th Eurographics Symposium on Rendering by Title

Results Per Page

Sort Options