BTF modelling using BRDF texels

Authors:
J. Filip;M. Haindl
Affiliations:
Dept. of Pattern Recognition, Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, Prague, Czech Republic;Dept. of Pattern Recognition, Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, Prague, Czech Republic
Venue:
IWICPAS'06 Proceedings of the 2006 Advances in Machine Vision, Image Processing, and Pattern Analysis international conference on Intelligent Computing in Pattern Analysis/Synthesis
Year:
2006

Citing 8
Cited 0

Image quilting for texture synthesis and transfer

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Polynomial texture maps

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Efficient rendering of spatial bi-directional reflectance distribution functions

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Graphcut textures: image and video synthesis using graph cuts

ACM SIGGRAPH 2003 Papers
Wang Tiles for image and texture generation

ACM SIGGRAPH 2003 Papers
Efficient and realistic visualization of cloth

EGRW '03 Proceedings of the 14th Eurographics workshop on Rendering
TensorTextures: multilinear image-based rendering

ACM SIGGRAPH 2004 Papers
BTF Image Space Utmost Compression and Modelling Method

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03

Quantified Score

Hi-index	0.00

Visualization

Abstract

The highest fidelity representations of realistic real-world materials currently used comprise Bidirectional Texture Functions (BTF). The BTF is a six dimensional function depending on view and illumination directions as well as on planar texture coordinates. The huge size of such measurements, typically in the form of thousands of images covering all possible combinations of illumination and viewing angles, has prohibited their practical exploitation and obviously some compression and modelling method of these enormous BTF data spaces is inevitable. The proposed approach combines BTF spatial clustering with cluster index modelling by means of an efficient Markov random field model. This method allows to generate seamless cluster index of arbitrary size to cover large virtual 3D objects surfaces. The method represents original BTF data using a set of local spatially dependent Bidirectional Reflectance Distribution Function (BRDF) values which are combined according to synthesised cluster index and illumination / viewing directions. BTF data compression using this method is about 1:100 and their synthesis is very fast.