ACM Home Page
Please provide us with feedback. Feedback
Simple and efficient compression of animation sequences
Full text PdfPdf (800 KB)
Source Symposium on Computer Animation archive
Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation table of contents
Los Angeles, California
SESSION: Non-photorealistic animation and compression table of contents
Pages: 209 - 217  
Year of Publication: 2005
ISBN:1-7695-2270-X
Authors
Mirko Sattler  University of Bonn. Germany
Ralf Sarlette  University of Bonn. Germany
Reinhard Klein  University of Bonn. Germany
Sponsors
Eurographics: Eurographics Association
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 57,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1073368.1073398
What is a DOI?

ABSTRACT

We present a new geometry compression method for animations, which is based on the clustered principal component analysis (CPCA). Instead of analyzing the set of vertices for each frame, our method analyzes the set of paths for all vertices for a certain animation length. Thus, using a data-driven approach, it can identify mesh parts, that are "coherent" over time. This usually leads to a very efficient and robust segmentation of the mesh into meaningful clusters, e.g. the wings of a chicken. These parts are then compressed separately using standard principal component analysis (PCA). Each of this clusters can be compressed more efficiently with lesser PCA components compared to previous approaches. Results show, that the new method outperforms other compression schemes like pure PCA based compression or combinations with linear prediction coding, while maintaining a better reconstruction error. This is true, even if the components and weights are quantized before transmission. The reconstruction process is very simple and can be performed directly on the GPU.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
{AM00} Alexa M., Müller W.: Representing animations by principal components. Computer Graphics Forum 19, 3 (2000).
 
3
{ARB} ARB: http://oss.sgi.com/projects/ogl-sample/registry/.
 
4
5
6
 
7
8
 
9
 
10
{JDH04} Jesse D. Hall J. C. H.: Gpu acceleration of iterative clustering. Manuscript accompanying poster at GP2: The ACM Workshop on General Purpose Computing on Graphics Processors, and SIGGRAPH 2004 poster (2004).
 
11
 
12
 
13
{KG04} Karni Z., Gotsman C.: Compression of soft-body animation sequences. Computer and Graphics 28 (2004), 25--34.
 
14
 
15
16
 
17
{LAP} LAPACK: http://www.netlib.org/apack/.
18
 
19
{Llo82} Lloyd S. P.: Least square quantization in pcm. IEEE Transactions on Information Theory 28, 2 (1982), 129--137.
 
20
 
21
22
 
23
 
24
 
25
{Ros04} Rossignac J.: Surface simplification and 3D geometry compression: Chapter 54 in Handbook of Discrete and Computational Geometry, 2nd ed. Editors: J. E. Goodman and J. O'Rourke, 2004.
26
 
27
{STK02} Shlafman S., Tal A., Katz S.: Metamorphosis of polyhedral surfaces using decomposition, 2002.
 
28
{TG98} Touma C., Gotsman C.: Triangle mesh compression. In Graphics Interface (June 1998), pp. 26--34.
29
 
30
{TR99} Taubin G., Rossignac J.: 3d geometry compression. Siggraph Course Notes, 21 (1999).
31

CITED BY  10

Collaborative Colleagues:
Mirko Sattler: colleagues
Ralf Sarlette: colleagues
Reinhard Klein: colleagues