Octree-Based 3D Animation Compression with Motion Vector Sharing

Geometry compression is the coding of 3D geometric data in a form that requires less space to store and less bandwidth to transmit. Animated geometry compression is the compression of temporal sequences of geometric data. An octree-based motion representation method in which a small set of motion vectors are generated for each frame by analyzing the motion between consecutive frames was proposed in a previous research. The recursive dividing of regions by the algorithm may put vertices with the similar motions into multiple disjoint regions of various depths and sizes. This paper proposes a method that enables the sharing of motion vectors in different regions. The cost of storing the reference to another motion vector is much lower than the cost of storing the whole motion vector. We implemented the motion vector sharing algorithm and compared the performance of this method to the original method on four animation sequences: dance, chef, chicken and cow. The improvement in compression ratio of P-frames ranges from 11% to 52%

[1]  Alain Fournier,et al.  Triangulating Simple Polygons and Equivalent Problems , 1984, TOGS.

[2]  Gabriel Taubin,et al.  Geometric compression through topological surgery , 1998, TOGS.

[3]  David Levin,et al.  Progressive Compression of Arbitrary Triangular Meshes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[4]  Jovan Popovic,et al.  Progressive simplicial complexes , 1997, SIGGRAPH.

[5]  Gabriel Taubin,et al.  Progressive forest split compression , 1998, SIGGRAPH.

[6]  Craig Gotsman,et al.  Triangle Mesh Compression , 1998, Graphics Interface.

[7]  Gabriel Taubin.  3D geometry compression recent advances and challenges , 2001, Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001.

[8]  Jed Lengyel,et al.  Compression of time-dependent geometry , 1999, SI3D.

[9]  Raimund Seidel,et al.  A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons , 1991, Comput. Geom..

[10]  Pedro V. Sander,et al.  Geometry videos: a new representation for 3D animations , 2003, SCA '03.

[11]  Renato Pajarola,et al.  Compressed Progressive Meshes , 2000, IEEE Trans. Vis. Comput. Graph..

[12]  Jinghua Zhang,et al.  Octree-based animated geometry compression , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[13]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[14]  Valerio Pascucci,et al.  Progressive compression and transmission of arbitrary triangular meshes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[15]  F. Bossen.  On the art of compressing three-dimensional polygonal meshes and their associated properties , 1999 .

[16]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[17]  Michael Deering,et al.  Geometry compression , 1995, SIGGRAPH.

[18]  Craig Gotsman,et al.  Compression of soft-body animation sequences , 2004, Comput. Graph..

[19]  Marc Alexa,et al.  Representing Animations by Principal Components , 2000, Comput. Graph. Forum.

[20]  Andrei Khodakovsky,et al.  Progressive geometry compression , 2000, SIGGRAPH.

[21]  Olivier Devillers,et al.  Progressive lossless compression of arbitrary simplicial complexes , 2002, SIGGRAPH.

[22]  Jarek Rossignac,et al.  Dynapack: space-time compression of the 3D animations of triangle meshes with fixed connectivity , 2003, SCA '03.