Octree-based progressive geometry encoder

26 November 2003 Octree-based progressive geometry encoder

Jingliang Peng, C. C. Jay Kuo

Proceedings Volume 5242, Internet Multimedia Management Systems IV; (2003) https://doi.org/10.1117/12.510857
Event: ITCom 2003, 2003, Orlando, Florida, United States

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.

Citation Download Citation

Jingliang Peng and C. C. Jay Kuo "Octree-based progressive geometry encoder", Proc. SPIE 5242, Internet Multimedia Management Systems IV, (26 November 2003); https://doi.org/10.1117/12.510857

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available