Optimizing octree motion representation for 3D animation

  • Authors:
  • Jinghua Zhang;Jinsheng Xu

  • Affiliations:
  • Wesleyan College, Macon, Georgia;North Carolina A&T State University, Greensboro, NC

  • Venue:
  • Proceedings of the 44th annual Southeast regional conference
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Geometry compression is the coding of 3D geometric data in a form that requires less space to store and less bandwidth to transmit. Animated geometry compression is the compression of temporal sequences of geometric data. An octree-based motion representation method in which a small set of motion vectors are generated for each frame by analyzing the motion between consecutive frames was proposed in a previous research. The goal of this paper is to optimize the octree-based animated geometry compression algorithm by storing the motion vectors at non-leaf nodes in contrast to the original method where motion vectors are stored only in leaf nodes. Some leaf nodes do not need to store the motion vectors by inheriting their parents' motion vectors. This method especially benefits the animation where most regions have simple movement and small area has complicated movements. The proposed technique will always perform better than the original method. In some cases, it may have much better compression ratio than the original method. This new approach is easy to implement on top of original octree-based algorithm and has faster encoding and decoding speed.