All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Extensions to bidirectional texture function compression with multi-level vector quantization in OpenCL

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00233079" target="_blank" >RIV/68407700:21230/15:00233079 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.sciencedirect.com/science/article/pii/S0097849315000060" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0097849315000060</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.cag.2015.01.005" target="_blank" >10.1016/j.cag.2015.01.005</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Extensions to bidirectional texture function 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 three contributions to BTF data compression. First, we propose novel decompositions for multi-level vector quantization in BTF data compression that improve the compression ratio by 12% in comparison with the original method, without loss of visual quality. This is achieved by a highly configurable software architecture that allows for different compression pipelines. Second, we show how for offline storage the compression ratio can be increased by 30% in total by Huffman coding. Third, we show how to efficiently parallelize this vector quantization algorithm in OpenCL for massivelyparallel architectures such as GPUs with a new modular design of the compression pipeline. The results for the new compression algorithm are shown on twelve low dynamic range BTFs and four high dynamic range publicly available BTF samples

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • 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

Others

  • Publication year

    2015

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Computers & Graphics

  • ISSN

    0097-8493

  • e-ISSN

  • Volume of the periodical

    48

  • Issue of the periodical within the volume

    05

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    10

  • Pages from-to

    1-10

  • UT code for WoS article

    000355029200002

  • EID of the result in the Scopus database

    2-s2.0-84924787633