Paper
18 January 2004 Progressive geometry encoder based on the octree structure
Author Affiliations +
Proceedings Volume 5308, Visual Communications and Image Processing 2004; (2004) https://doi.org/10.1117/12.525560
Event: Electronic Imaging 2004, 2004, San Jose, California, United States
Abstract
A progressive 3D geometry coding scheme based on the octree structure is proposed in this work, which achieves better coding efficiency than the state-of-the-art geometric codec known as the kd-tree-based codec. Given a 3D mesh, the quantized 3D vertices are first partitioned into an octree structure. The octree is then traversed from the root and gradually to the leaves and, during the traversal, each 3D cell in the tree front is subdivided along three orthogonal directions. For each cell subdivision, the order of subdivision directions is adaptively chosen, the neighborhood-prediction is used and the vertex number distribution is efficiently encoded. The final output bit stream contains relevant information associated with each cell subdivision. It is shown in experimental results that the coding cost is around 15.6 bits per vertex (bpv) for 12-bit coordinate quantization and 5.6 bpv for 8-bit coordinate quantization on average.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jingliang Peng and Chung-Chieh Jay Kuo "Progressive geometry encoder based on the octree structure", Proc. SPIE 5308, Visual Communications and Image Processing 2004, (18 January 2004); https://doi.org/10.1117/12.525560
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Quantization

3D image processing

Binary data

Optical coherence tomography

Visualization

Algorithm development

Back to Top