CNRS - Centre National de la Recherche Scientifique : UMR5800, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Inria Bordeaux - Sud-Ouest, Université Sciences et Technologies - Bordeaux 1
Abstract : Polynomial Wavelet Tree is a new tool for accurate and efficient compression of BTFs. The key idea is to separate directional and spatial variations by projecting the spatial BTF domain (i.e., the light-dependent textures) onto a wavelet basis and to approximate these light-dependent wavelet coefficients with a polynomial function. Fitting wavelet coefficients instead of data themselves is a more efficient approximation compared to previous solutions since low frequency light transitions are smooth and higher frequency coefficients can be quantized with less importance. This wavelet projection and the light-dependent polynomial approximation is done for each view-point. Our solution is also designed for efficient high quality materials rendering on GPU.
https://hal.inria.fr/inria-00355359 Contributor : Jérôme BarilConnect in order to contact the contributor Submitted on : Thursday, January 22, 2009 - 3:58:47 PM Last modification on : Monday, December 20, 2021 - 4:50:11 PM Long-term archiving on: : Tuesday, June 8, 2010 - 7:17:55 PM
Jerome Baril, Tamy Boubekeur, Patrick Gioia, Christophe Schlick. Polynomial Wavelet Trees for Bidirectional Texture Functions. ACM Siggraph 2008 - Talk Program, Aug 2008, Los Angeles, United States. ⟨10.1145/1401032.1401072⟩. ⟨inria-00355359⟩