Premium
Predictive compression of animated 3D models by optimized weighted blending of key‐frames
Author(s) -
Hajizadeh Mohammadali,
Ebrahimnezhad Hossein
Publication year - 2015
Publication title -
computer animation and virtual worlds
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 49
eISSN - 1546-427X
pISSN - 1546-4261
DOI - 10.1002/cav.1685
Subject(s) - computer science , key (lock) , huffman coding , algorithm , coding (social sciences) , data compression , residual , key frame , compression (physics) , vertex (graph theory) , lossless compression , heuristic , frame (networking) , artificial intelligence , theoretical computer science , mathematics , telecommunications , graph , statistics , materials science , computer security , composite material
Efficient compression techniques are required for animated mesh sequences with fixed connectivity and time‐varying geometry. In this paper, we propose a key‐frame‐based technique for three‐dimensional dynamic mesh compression. First, key‐frames are extracted from the animated sequence. Extracted key‐frames are then linearly combined using blending weights to predict the vertex locations of the other frames. These blending weights play a key role in the proposed algorithm because the prediction performance and the required number of key‐frames greatly depend on these weights. We present a novel method in order to compute the optimum blending weight that makes it possible to predict location of the vertices of the non‐key frames with the minimum number of key‐frames. The residual prediction errors are finally quantized and encoded using Huffman coding and another heuristic method. Experimental results on different test sequences with various sizes, topologies, and geometries demonstrate the privileged performance of the proposed method compared with the previous techniques. Copyright © 2015 John Wiley & Sons, Ltd.