Attributes | Values |
---|
rdf:type
| |
Description
| - During the last decade many algorithms for compressing 3D animations represented by sequences of triangular meshes have been proposed. Most of these algorithms are lossy in their nature, i.e. the reconstructed data do not exactly match the algorithm input. Quite surprisingly, most of the existing algorithms mainly use only general compression techniques, such as entropy coding, quantisation, PCA or wavelet decomposition, while the inherent geometrical properties of the compressed surface remain unexploited. In this paper we focus on geometry specific optimisation: we extend the PCA-based dynamic mesh compression by optimising the order in which the mesh is traversed. We will show that considering the residual entropy and by optimising the gate selection strategy we may reduce the data rates by 15% on average, while the error introduced by compression remains unchanged. This optimisation improves the performance of our encoder above the performance of current state of the art algorithms.
- During the last decade many algorithms for compressing 3D animations represented by sequences of triangular meshes have been proposed. Most of these algorithms are lossy in their nature, i.e. the reconstructed data do not exactly match the algorithm input. Quite surprisingly, most of the existing algorithms mainly use only general compression techniques, such as entropy coding, quantisation, PCA or wavelet decomposition, while the inherent geometrical properties of the compressed surface remain unexploited. In this paper we focus on geometry specific optimisation: we extend the PCA-based dynamic mesh compression by optimising the order in which the mesh is traversed. We will show that considering the residual entropy and by optimising the gate selection strategy we may reduce the data rates by 15% on average, while the error introduced by compression remains unchanged. This optimisation improves the performance of our encoder above the performance of current state of the art algorithms. (en)
|
Title
| - Optimised mesh traversal for dynamic mesh compression
- Optimised mesh traversal for dynamic mesh compression (en)
|
skos:prefLabel
| - Optimised mesh traversal for dynamic mesh compression
- Optimised mesh traversal for dynamic mesh compression (en)
|
skos:notation
| - RIV/49777513:23520/11:43899267!RIV12-MSM-23520___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...iv/cisloPeriodika
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/49777513:23520/11:43899267
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - dynamic mesh, compression, traversal, optimisation, animation, distribution (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...odStatuVydavatele
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/nazevZdroje
| |
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...v/svazekPeriodika
| |
http://linked.open...iv/tvurceVysledku
| |
issn
| |
number of pages
| |
http://localhost/t...ganizacniJednotka
| |