The transmission and storage of large amounts of triangle and vertex geometry data are required for rendering geometrically detailed 3D meshes. This paper proposes a novel vertex encoding algorithm using VQ with a region growing based k-ring prediction scheme. During the encoding process, the parameter k at the vertex to be encoded is estimated by the error vectors of the preceding encoded vertices, and then the adaptive prediction rule of the vertex is computed according to k. Experiment results show that, compared with the vertex encoding algorithm based on the conventional parallelogram prediction, the proposed algorithm achieves a higher encoding quality at the same bit rate.
Compression of 3D triangle meshes based on predictive vector quantization
01.06.2010
789158 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Predictive Compression of Dynamic 3D Meshes
British Library Conference Proceedings | 2005
|Predictive compression of dynamic 3D meshes
IEEE | 2005
|Predictive residual vector quantization
IEEE | 1994
|Predictive Residual Vector Quantization
British Library Conference Proceedings | 1994
|Concentric Strips: Algorithms and Architecture for the Compression/Decompression of Triangle Meshes
British Library Conference Proceedings | 2002
|