Bidirectional Texture Function Compression Based on Multi-Level Vector Quantization
نویسندگان
چکیده
The Bidirectional Texture Function (BTF) is becoming widely used for accurate representation of real-world material appearance. In this paper a novel BTF compression model is proposed. The model resamples input BTF data into a parametrization, allowing decomposition of individual view and illumination dependent texels into a set of multidimensional conditional probability density functions. These functions are compressed in turn using a novel multi-level vector quantization algorithm. The result of this algorithm is a set of index and scale code-books for individual dimensions. BTF reconstruction from the model is then based on fast chained indexing into the nested stored code-books. In the proposed model, luminance and chromaticity are treated separately to achieve further compression. The proposed model achieves low distortion and compression ratios 1 : 233−1 : 2040, depending on BTF sample variability. These results compare well with several other BTF compression methods with predefined compression ratios, usually smaller than 1 : 200. We carried out a psychophysical experiment comparing our method with LPCA method. BTF synthesis from the model was implemented on a standard GPU, yielded interactive framerates. The proposed method allows the fast importance sampling required by eye-path tracing algorithms in image synthesis.
منابع مشابه
Parallel BTF Compression with Multi-Level Vector Quantization in OpenCL
Bidirectional Texture Function (BTF) as an effective visual fidelity representation of surface appearance is becoming more and more widely used. In this paper we report on contributions to BTF data compression for multi-level vector quantization. We describe novel decompositions that improve the compression ratio by 15% in comparison with the original method, without loss of visual quality. Fur...
متن کاملEfficient GPU-based Decompression of BTF Data Compressed using Multi-Level Vector Quantization
One of the main drawbacks of Bidirectional Texture Function (BTF), as a method of capturing realistic and accurate real-world material appearance, is the resulting size of the measured data set. Several lossy methods to compress the data were proposed over the years to cope with this problem. To efficiently use the compressed data an appropriate decompression algorithms are also needed, allowin...
متن کاملTexture Analysis Using Multidimensional Histogram
Texture features have long been used in remote sensing applications for representing and retrieving regions similar to a query region. Various representations of texture have been proposed based on the power spectrum, grey-level cooccurrence matrices, wavelet features, Gabor features, etc. Analysis of several co-occurring pixel values may benefit texture description but is impeded by the expone...
متن کاملPyramid Texture Compression and Decompression Using Interpolative Vector Quantization
Texture mapping is a common technique used to increase the visual quality of 3D scenes. As texture mapping requires large memory to deal with large textures generally r e quired in the current visual systems, we propose an algorithm for compressing a pyramid texture used for mipmapping. Vector quantization is used to compress all levels of the pyramid texture to one representative value databoo...
متن کاملEffective Multi-resolution Rendering and Texture Compression for Captured Volumetric Trees
Trees can be realistically rendered in synthetic environments by creating volumetric representations from photographs. However, volumetric tree representations created with previous methods are expensive to render due to the high number of primitives, and have very high texture memory requirements. We address both shortcomings by presenting an efficient multi-resolution rendering method and an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 29 شماره
صفحات -
تاریخ انتشار 2010