Share Email Print

Proceedings Paper

Progressive geometry encoder based on the octree structure
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 18 January 2004
PDF: 11 pages
Proc. SPIE 5308, Visual Communications and Image Processing 2004, (18 January 2004); doi: 10.1117/12.525560
Show Author Affiliations
Jingliang Peng, Univ. of Southern California (United States)
Chung-Chieh Jay Kuo, Univ. of Southern California (United States)

Published in SPIE Proceedings Vol. 5308:
Visual Communications and Image Processing 2004
Sethuraman Panchanathan; Bhaskaran Vasudev, Editor(s)

© SPIE. Terms of Use
Back to Top