Progressive Compression of Geometry Information with Smooth Intermediate Meshes

  • Authors:
  • Taejung Park;Haeyoung Lee;Chang-Hun Kim

  • Affiliations:
  • Computer Graphics Lab., Dept. Of Computer Science and Engineering, Korea University, Seoul, 136-701, Korea;Hongik University, 72-1 Sangsudong, Mapogu, Seoul, 121-719, Korea;Computer Graphics Lab., Dept. Of Computer Science and Engineering, Korea University, Seoul, 136-701, Korea

  • Venue:
  • IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new geometry compression algorithm for manifold 3D meshes based on octree coding. For a given mesh, regular volume grids are built with an adaptive octree. For each grid point, a binary sign, which indicates inside or outside of the mesh, is generated based on the distance to the mesh. In each leaf cell having a vertex, a least square fitting plane is created for a localized geometry range with signs. Finally, quantized geometry information is locally encoded. We demonstrate that the octree with signs can be used to predict the vertex positions. As a result, the proposed method generates competitive bitrates compared to the current state-of-art progressive geometry coder. Our method also shows better rate-distortion performance during decompression or transmission with improved smoothness.