An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a sequence of meshes contains a large degree of temporal statistical dependencies that can be exploited for compression using DPCM. The vertex positions are predicted at the encoder from a previously decoded mesh. The difference vectors are further clustered in an octree approach. Only a representative for a cluster of difference vectors is further processed providing a significant reduction of data rate. The representatives are scaled and quantized and finally entropy coded using CABAC, the arithmetic coding technique used in H.264/MPEG4-AVC. The mesh is then reconstructed at the encoder for prediction of the next mesh. In our experiments we compare the efficiency of the proposed algorithm in terms of bit-rate and quality compared to static mesh coding and interpolator compression indicating a significant improvement in compression efficiency.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Predictive compression of dynamic 3D meshes


    Contributors:
    Muller, K. (author) / Smolic, A. (author) / Kautzner, M. (author) / Eisert, P. (author) / Wiegand, T. (author)


    Publication date :

    2005-01-01


    Size :

    276081 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


    Dynamic adaptation for deforming tetrahedral meshes

    Baker, Timothy / Cavallo, Peter | AIAA | 1999




    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