An Efficient 3D Animation Data Reduction Using Frame Removal
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32807
An Efficient 3D Animation Data Reduction Using Frame Removal

Authors: Jinsuk Yang, Choongjae Joo, Kyoungsu Oh

Abstract:

Existing methods in which the animation data of all frames are stored and reproduced as with vertex animation cannot be used in mobile device environments because these methods use large amounts of the memory. So 3D animation data reduction methods aimed at solving this problem have been extensively studied thus far and we propose a new method as follows. First, we find and remove frames in which motion changes are small out of all animation frames and store only the animation data of remaining frames (involving large motion changes). When playing the animation, the removed frame areas are reconstructed using the interpolation of the remaining frames. Our key contribution is to calculate the accelerations of the joints of individual frames and the standard deviations of the accelerations using the information of joint locations in the relevant 3D model in order to find and delete frames in which motion changes are small. Our methods can reduce data sizes by approximately 50% or more while providing quality which is not much lower compared to original animations. Therefore, our method is expected to be usefully used in mobile device environments or other environments in which memory sizes are limited.

Keywords: Data Reduction, Interpolation, Vertex Animation, 3D Animation.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1061892

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1603

References:


[1] M. M. Chow, “Optimized geometry compression for real-time rendering,” in IEEE Visualization"97 Conference Proceedings, pp. 347-354, 1997.
[2] J. Rossignac, “EdgeBreaker : Connectivity Compression for Triangle Meshes,” IEEE Transactions on Visualization and Computer Graphics, pp. 47-67, 1999.
[3] M. Isenburg and J. Snoeyink, “Face Fixer: Compressing Polygon MeshesWith Properties,” in ACM SIGGRAPH 2000 Conference Proceedings, pp. 263-270, 2000.
[4] M. Isenburg and P. Alliez, “Compressing polygon mesh geometry withparallelogram prediction,” in Visualization'02 Conference Proceedings, pp. 141-146, 2002.
[5] P. Alliez and M. Desbrun, “Valence-Driven Connectivity Encoding of 3DMeshes,” in Eurographics 2001 Conference Proceedings, pp. 480-489, 2001.
[6] M. Eck, T. Derose, T. Duchamp, H. Hoppe, M. Lounsbery and W. Stuetzle, “Multiresolution analysis of arbitary meshes,” in R. Cook, editor, SIGGRAPH 95 Conference Proceedings, pp. 173-182. 1995.
[7] K. Mamow, T.Zaharia and F.Preteux, “Frame-based Compression of Animated Meshes in MPEG-4,” in ICME 2008, pp. 1121-1124, 2008.
[8] http://www.idleworm.com