Parallel BTF Compression with Multi-Level Vector Quantization in OpenCL

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00221435" target="_blank" >RIV/68407700:21230/14:00221435 - isvavai.cz</a>
Result on the web
<a href="http://diglib.eg.org/EG/DL/PE/PG/PG2014short/131-134.pdf.abstract.pdf" target="_blank" >http://diglib.eg.org/EG/DL/PE/PG/PG2014short/131-134.pdf.abstract.pdf</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Parallel BTF Compression with Multi-Level Vector Quantization in OpenCL
Original language description
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. Further, we show how for offline storage the compression ratio can be increased by 33% in total by Huffman coding.We also show that efficient parallelization of the vector quantization algorithm in OpenCL can reduce the compression time by factor of 9 on a GPU. The results for the new compression algorithm are shown on six low dynamic range BTFs and four high dynamic range publicly available BTF samples. Our method allows for real time synthesis on a GPU.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
S - Specificky vyzkum na vysokych skolach

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)