COBRA: Compression of the Basis for PCA Represented Animations
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F09%3A00502087" target="_blank" >RIV/49777513:23520/09:00502087 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
COBRA: Compression of the Basis for PCA Represented Animations
Popis výsledku v původním jazyce
In this paper we present an extension of dynamic mesh compression techniques based on PCA. Such representation allows very compact representation of moving 3d surfaces, however it requires some side information to be transmitted along with the main data.The biggest part of this information is the PCA basis, and since the data can be encoded very efficiently, the size of the basis cannot be neglected when considering the overall performance of a compression algorithm. We present a new work in this area,as none of the papers about PCA based compression really addresses this issue. We will show that for an efficient and accurate encoding there are better choices than even sophisticated algorithms such as LPC. We will present results showing that our approach can reduce the size of the basis by 90% with respect to direct encoding, which can lead to approximately 25% increase of performance of the compression algorithm without any significant loss of accuracy. Such improvement moves the
Název v anglickém jazyce
COBRA: Compression of the Basis for PCA Represented Animations
Popis výsledku anglicky
In this paper we present an extension of dynamic mesh compression techniques based on PCA. Such representation allows very compact representation of moving 3d surfaces, however it requires some side information to be transmitted along with the main data.The biggest part of this information is the PCA basis, and since the data can be encoded very efficiently, the size of the basis cannot be neglected when considering the overall performance of a compression algorithm. We present a new work in this area,as none of the papers about PCA based compression really addresses this issue. We will show that for an efficient and accurate encoding there are better choices than even sophisticated algorithms such as LPC. We will present results showing that our approach can reduce the size of the basis by 90% with respect to direct encoding, which can lead to approximately 25% increase of performance of the compression algorithm without any significant loss of accuracy. Such improvement moves the
Klasifikace
Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
JC - Počítačový hardware a software
OECD FORD obor
—
Návaznosti výsledku
Projekt
<a href="/cs/project/LC06008" target="_blank" >LC06008: Centrum počítačové grafiky</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Ostatní
Rok uplatnění
2009
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
Computer Graphics forum
ISSN
0167-7055
e-ISSN
—
Svazek periodika
28
Číslo periodika v rámci svazku
6
Stát vydavatele periodika
GB - Spojené království Velké Británie a Severního Irska
Počet stran výsledku
12
Strana od-do
—
Kód UT WoS článku
000269902100001
EID výsledku v databázi Scopus
—