Perceptually-Driven Decision Theory for Interactive Realistic Rendering

this paper we introduce a new approach to realistic rendering at interactive rates on commodity graphics hardware. The approach uses efficient perceptual metrics within a decision theoretic framework to optimally order rendering operations, producing images of the highest visual quality within system constraints. We demonstrate the usefulness of this approach for various applications such as diffuse texture caching, environment map prioritization and radiosity mesh simplification. Although here we address the problem of realistic rendering at interactive rates, the perceptually-based decision theoretic methodology we introduce can be usefully applied in many areas of computer graphic

Using perceptual texture masking for efficient image synthesis

Texture mapping has become indispensable in image synthesis as an inexpensive source of rich visual detail. Less obvious, but just as useful, is its ability to mask image errors due to inaccuracies in geometry or lighting. This ability can be used to substantially accelerate rendering by eliminating computations when the resulting errors will be perceptually insignificant. Our new method precomputes the masking ability of textures using aspects of the JPEG image compression standard. This extra information is stored as threshold elevation factors in the texture\u27s mip-map and interpolated at image generation time as part of the normal texture lookup process. Any algorithm which uses error tolerances or visibility thresholds can then take advantage of texture masking. Applications to adaptive shadow testing, irradiance caching, and path tracing are demonstrated. Unlike prior methods, our approach does not require that initial images be computed before masking can be exploited and incurs only negligible runtime computational overhead. Thus, it is much easier to integrate with existing rendering systems for both static and dynamic scenes and yields computational savings even when only small amounts of texture masking are present

Using Perceptual Texture Masking For Efficient Image Synthesis

Texture mapping has become indispensable in image synthesis as an inexpensive source of rich visual detail. Less obvious, but just as useful, is its ability to mask image errors due to inaccuracies in geometry or lighting. This ability can be used to substantially accelerate rendering by eliminating computations when the resulting errors will be perceptually insignificant. Our new method precomputes the masking ability of textures using aspects of the JPEG image compression standard. This extra information is stored as threshold elevation factors in the texture\u27s mip-map and interpolated at image generation time as part of the normal texture lookup process. Any algorithm which uses error tolerances or visibility thresholds can then take advantage of texture masking. Applications to adaptive shadow testing, irradiance caching, and path tracing are demonstrated. Unlike prior methods, our approach does not require that initial images be computed before masking can be exploited and incurs only negligible runtime computational overhead. Thus, it is much easier to integrate with existing rendering systems for both static and dynamic scenes and yields computational savings even when only small amounts of texture masking are present

Using Perceptual Texture Masking for Efficient Image Synthesis

Texture mapping has become indispensable in image synthesis as an inexpensive source of rich visual detail. Less obvious, but just as useful, is its ability to mask image errors due to inaccuracies in geometry or lighting. This ability can be used to substantially accelerate rendering by eliminating computations when the resulting errors will be perceptually insignificant. Our new method precomputes the masking ability of textures using aspects of the JPEG image compression standard. This extra information is stored as threshold elevation factors in the texture’s mip-map and interpolated at image generation time as part of the normal texture lookup process. Any algorithm which uses error tolerances or visibility thresholds can then take advantage of texture masking. Applications to adaptive shadow testing, irradiance caching, and path tracing are demonstrated. Unlike prior methods, our approach does not require that initial images be computed before masking can be exploited and incurs only negligible runtime computational overhead. Thus, it is much easier to integrate with existing rendering systems for both static and dynamic scenes and yields computational savings even when only small amounts of texture masking are present