Compression of complex animated meshes

Authors:
Rachida Amjoun;Ralf Sondershaus;Wolfgang Straßer
Affiliations:
WSI-GRIS, University of Tübingen, Tübingen, Germany;WSI-GRIS, University of Tübingen, Tübingen, Germany;WSI-GRIS, University of Tübingen, Tübingen, Germany
Venue:
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Year:
2006

Citing 6
Cited 4

Arithmetic coding for data compression

Communications of the ACM
Compression of time-dependent geometry

I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
Dynapack: space-time compression of the 3D animations of triangle meshes with fixed connectivity

Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation
Wavelet compression of parametrically coherent mesh sequences

SCA '04 Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation
Simple and efficient compression of animation sequences

Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation
Error-resilient coding of 3-D graphic models via adaptive mesh segmentation

IEEE Transactions on Circuits and Systems for Video Technology

MPEG-4 Part 25: A graphics compression framework for XML-based scene graph formats

Image Communication
Single-rate near lossless compression of animated geometry

Computer-Aided Design
Reconstructing animated meshes from time-varying point clouds

SGP '08 Proceedings of the Symposium on Geometry Processing
Improved prediction methods for scalable predictive animated mesh compression

Journal of Visual Communication and Image Representation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new compression algorithm for complex animated meshes of constant connectivity based on the local principal component analysis. The algorithm segments the animated mesh into segments using a region growing algorithm and transforms the original vertex coordinates into the local coordinate frame of their segment. This transformation leads to a strong clustering behavior of vertices and makes each region invariant to any deformation over time. Then each segment is efficiently encoded using the principal component analysis. The set of basis vectors and coefficients corresponding to each segment are quantized and entropy encoded. Experimental results show that our algorithm yields a significant improvement upon some current coders.