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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Compression of 3D triangle meshes based on predictive vector quantization


    Contributors:


    Publication date :

    2010-06-01


    Size :

    789158 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Predictive Compression of Dynamic 3D Meshes

    Muller, K. / Smolic, A. / Kautzner, M. et al. | British Library Conference Proceedings | 2005


    Predictive compression of dynamic 3D meshes

    Muller, K. / Smolic, A. / Kautzner, M. et al. | IEEE | 2005


    Predictive residual vector quantization

    Rizvi, S.A. / Nasrabadi, N.M. | IEEE | 1994


    Predictive Residual Vector Quantization

    Rizvi, S. A. / Nasrabadi, N. M. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    Concentric Strips: Algorithms and Architecture for the Compression/Decompression of Triangle Meshes

    Mallon, P. / Boo, M. / Amor, M. et al. | British Library Conference Proceedings | 2002