Progressive compression of 3D dynamic mesh sequences

An algorithm to compress 3D mesh sequences for dynamic objects is proposed in this work. Given an irregular mesh sequence, we construct a semi-regular mesh structure for the first frame and then map it to the subsequent frames bused on the hierarchical motion estimation. The regular structure of the resulting mesh sequence enables us to employ the zero-tree coding scheme to compress the motion compensation residuals efficiently. Simulation results demonstrate that the proposed algorithm provides significantly better compression performance than the static coder that encodes each frame independently.

[1]  Peter Schröder,et al.  Normal meshes , 2000, SIGGRAPH.

[2]  Yao Wang,et al.  Video Processing and Communications , 2001 .

[3]  A. Murat Tekalp,et al.  Hierarchical 2-D mesh representation, tracking, and compression for object-based video , 1999, IEEE Trans. Circuits Syst. Video Technol..

[4]  William A. Pearlman,et al.  A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..

[5]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[7]  Sang Uk Lee,et al.  Compression of 3-D triangle mesh sequences based on vertex-wise motion vector prediction , 2002, IEEE Trans. Circuits Syst. Video Technol..

[8]  Yao Wang,et al.  Active mesh-a feature seeking and tracking image sequence representation scheme , 1994, IEEE Trans. Image Process..

[9]  Ashraf A. Kassim,et al.  Registration and partitioning-based compression of 3-D dynamic data , 2003, IEEE Trans. Circuits Syst. Video Technol..

[10]  Chang-Su Kim,et al.  Robust semi-regular mesh representation of 3D dynamic objects , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..