Simple and efficient compression of animation sequences

Simple item page
dc.contributor.authorSattler, Mirkoen_US
dc.contributor.authorSarlette, Ralfen_US
dc.contributor.authorKlein, Reinharden_US
dc.contributor.editorD. Terzopoulos and V. Zordan and K. Anjyo and P. Faloutsosen_US
dc.date.accessioned2014-01-29T07:12:30Z
dc.date.available2014-01-29T07:12:30Z
dc.date.issued2005en_US
dc.description.abstractWe 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 GP.en_US
dc.description.seriesinformationSymposium on Computer Animationen_US
dc.identifier.isbn1-59593-198-8en_US
dc.identifier.issn1727-5288en_US
dc.identifier.urihttps://doi.org/10.2312/SCA/SCA05/209-218en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Animationen_US
dc.titleSimple and efficient compression of animation sequencesen_US
Files
Collections
SCA 05: Eurographics/SIGGRAPH Symposium on Computer Animation