Journal of Computer Science and Technology

, Volume 30, Issue 3, pp 540–552 | Cite as

Spectral Animation Compression

  • Chao Wang
  • Yang Liu
  • Xiaohu Guo
  • Zichun Zhong
  • Binh Le
  • Zhigang Deng
Regular Paper


This paper presents a spectral approach to compress dynamic animation consisting of a sequence of homeomorphic manifold meshes. Our new approach directly compresses the field of deformation gradient defined on the surface mesh, by decomposing it into rigid-body motion (rotation) and non-rigid-body deformation (stretching) through polar decomposition. It is known that the rotation group has the algebraic topology of 3D ring, which is different from other operations like stretching. Thus we compress these two groups separately, by using Manifold Harmonics Transform to drop out their high-frequency details. Our experimental result shows that the proposed method achieves a good balance between the reconstruction quality and the compression ratio. We compare our results quantitatively with other existing approaches on animation compression, using standard measurement criteria.


dynamic animation animation compression deformation gradient polar decomposition 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Sumner R, Popović J. Deformation transfer for triangle meshes. ACM Transactions on Graphics, 2004, 23(3): 399–405.Google Scholar
  2. [2]
    Shoemake K, Duff T. Matrix animation and polar decomposition. In Proc. the Conference on Graphics Interface, May 1992, pp.258-264.Google Scholar
  3. [3]
    Baker A. Matrix Groups: An Introduction to Lie Group Theory. Springer, 2002.Google Scholar
  4. [4]
    Karni Z, Gotsman C. Spectral compression of mesh geometry. In Proc. the 27th Annual Conference on Computer Graphics and Interactive Techniques, July 2000, pp.279-286.Google Scholar
  5. [5]
    Vallet B, Lévy B. Spectral geometry processing with manifold harmonics. Computer Graphics Forum, 2008, 27(2): 251–260.CrossRefGoogle Scholar
  6. [6]
    Karni Z, Gotsman C. Compression of soft-body animation sequences. Computers & Graphics, 2004, 28(1): 25–34.CrossRefGoogle Scholar
  7. [7]
    Alexa M, Müller W. Representing animations by principal components. Computer Graphics Forum, 2000, 19(3): 411–418.Google Scholar
  8. [8]
    Váča L, Skala V. COBRA: Compression of the basis for PCA represented animations. Computer Graphics Forum, 2009, 28(6): 1529–1540.CrossRefGoogle Scholar
  9. [9]
    Sattler M, Sarlette R, Klein R. Simple and efficient compression of animation sequences. In Proc. the 2005 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, July 2005, pp.209-217.Google Scholar
  10. [10]
    Tejera M, Hilton A. Compression techniques for 3D video mesh sequences. In Articulated Motion and Deformable Objects, Perales F J, Fisher R B, Moeslund T B (eds.), Springer Berlin Heidelberg, 2012, pp.12–25.Google Scholar
  11. [11]
    Váša L, Skala V. Combined compression and simplification of dynamic 3D meshes. Computer Animation and Virtual Worlds, 2009, 20(4): 447–456.CrossRefGoogle Scholar
  12. [12]
    Ibarria L, Rossignac J. Dynapack: Space-time compression of the 3D animations of triangle meshes with fixed connectivity. In Proc. the 2003 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, July 2003, pp.126-135.Google Scholar
  13. [13]
    Ahn J, Koh Y, Kim C. Efficient fine-granular scalable coding of 3D mesh sequences. IEEE Transactions on Multimedia, 2013, 15(3): 485–497.CrossRefGoogle Scholar
  14. [14]
    Khodakovsky A, Schröder P, Sweldens W. Progressive geometry compression. In Proc. the 27th Annual Conference on Computer Graphics and Interactive Techniques, July 2000, pp.271-278.Google Scholar
  15. [15]
    Amjoun R, Straßer W. Single-rate near lossless compression of animated geometry. Computer-Aided Design, 2009, 41(10): 711–718.CrossRefGoogle Scholar
  16. [16]
    Stefanoski N, Ostermann J. SPC: Fast and efficient scalable predictive coding of animated meshes. Computer Graphics Forum, 2010, 29(1): 101–116.CrossRefGoogle Scholar
  17. [17]
    Váša L, Skala V. CODDYAC: Connectivity driven dynamic mesh compression. In Proc. 3DTV Conference, May 2007.Google Scholar
  18. [18]
    Váša L, Skala V. Geometry-driven local neighbourhood based predictors for dynamic mesh compression. Computer Graphics Forum, 2010, 29(6): 1921–1933.CrossRefGoogle Scholar
  19. [19]
    Lee D, Sull S, Kim C. Progressive 3D mesh compression using MOG-based Bayesian entropy coding and gradual prediction. The Visual Computer, 2014, 30(10): 1077–1091.CrossRefGoogle Scholar
  20. [20]
    Zhang J, Zheng C, Hu X. Triangle mesh compression along the Hamiltonian cycle. The Visual Computer, 2013, 29(6/7/8): 717–727.Google Scholar
  21. [21]
    James D, Twigg C. Skinning mesh animations. ACM Transactions on Graphics, 2005, 24(3): 399–407.CrossRefGoogle Scholar
  22. [22]
    Mamou K, Zaharia T, Prêteux F. A skinning approach for dynamic 3D mesh compression. Computer Animation and Virtual Worlds, 2006, 17(3/4): 337–346.CrossRefGoogle Scholar
  23. [23]
    Mamou K, Zaharia T, Prêteux F. FAMC: The MPEG-4 standard for animated mesh compression. In Proc. the 15th IEEE International Conference on Image Processing, October 2008, pp.2676-2679.Google Scholar
  24. [24]
    Le B, Deng Z. Smooth skinning decomposition with rigid bones. ACM Transactions on Graphics, 2012, 31(6): Article No. 199.Google Scholar
  25. [25]
    Kavan L, Sloan P, O’Sullivan C. Fast and efficient skinning of animated meshes. Computer Graphics Forum, 2010, 29(2): 327–336.CrossRefGoogle Scholar
  26. [26]
    Váša L, Skala V. A perception correlated comparison method for dynamic meshes. IEEE Transactions on Visualization and Computer Graphics, 2011, 17(2): 220–230.CrossRefGoogle Scholar
  27. [27]
    Váša L, Petřík O. Optimising perceived distortion in lossy encoding of dynamic meshes. Computer Graphics Forum, 2011, 30(5): 1439–1449.CrossRefGoogle Scholar
  28. [28]
    Zhang H, Kaick O, Dyer R. Spectral methods for mesh processing and analysis. In Proc. EUROGRAPHICS, Sept. 2007.Google Scholar
  29. [29]
    Taubin G. A signal processing approach to fair surface design. In Proc. the 22nd Annual Conference on Computer Graphics and Interactive Techniques, September 1995, pp.351-358.Google Scholar
  30. [30]
    Liu R, Zhang H. Mesh segmentation via spectral embedding and contour analysis. Computer Graphics Forum, 2007, 26(3): 385–394.CrossRefGoogle Scholar
  31. [31]
    Cotting D, Weyrich T, Pauly M, Markus G. Robust watermarking of point-sampled geometry. In Proc. Shape Modeling International, June 2004, pp.233-242.Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Chao Wang
    • 1
  • Yang Liu
    • 2
  • Xiaohu Guo
    • 1
  • Zichun Zhong
    • 1
  • Binh Le
    • 3
  • Zhigang Deng
    • 3
  1. 1.Department of Computer ScienceUniversity of Texas at DallasRichardsonU.S.A.
  2. 2.FacebookMenlo ParkU.S.A.
  3. 3.Department of Computer ScienceUniversity of HoustonHoustonU.S.A.

Personalised recommendations