Progressive compression of geometry information with smooth intermediate meshes
- Authors
- Park, Taejung; Lee, Haeyoung; Kim, Chang-hun
- Issue Date
- 2007
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- PATTERN RECOGNITION AND IMAGE ANALYSIS, PT 2, PROCEEDINGS, v.4478, pp.89 - +
- Journal Title
- PATTERN RECOGNITION AND IMAGE ANALYSIS, PT 2, PROCEEDINGS
- Volume
- 4478
- Start Page
- 89
- End Page
- +
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/29926
- ISSN
- 0302-9743
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.