Share Email Print

Proceedings Paper

Octree-based progressive geometry encoder
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Among progressive 3D mesh compression algorithms, the kd-tree-based algorithm proposed by Gandoin and Devillers is one of the state-of-the-art algorithms. Based on the observation that this geometry coder has a large amount of overhead at high kd-tree levels, we propose an octree-based geometry coder that demands a less amount of coding bits at high octree levels by applying selective cell subdivision at high tree levels, leading to a better rate-distortion performance for the low bit rate coding. Experimental results show that, compared with the kd-tree-based coder, the proposed 3D geometry coder performs better for an expanded tree of a level less than or equal to 8 but slightly worse for the full tree expansion with 12-bit quantization.

Paper Details

Date Published: 26 November 2003
PDF: 11 pages
Proc. SPIE 5242, Internet Multimedia Management Systems IV, (26 November 2003); doi: 10.1117/12.510857
Show Author Affiliations
Jingliang Peng, Univ. of Southern California (United States)
C. C. Jay Kuo, Univ. of Southern California (United States)

Published in SPIE Proceedings Vol. 5242:
Internet Multimedia Management Systems IV
John R. Smith; Sethuraman Panchanathan; Tong Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top