28 January 2008 Spectral coding of mesh geometry with a hierarchical set partitioning algorithm
Author Affiliations +
Abstract
We propose a progressive mesh geometry coder, which expresses geometry information in terms of spectral coefficients obtained through a transformation and codes these coefficients using a hierarchical set partitioning algorithm. The spectral transformation used is the one proposed in [10] where the spectral coefficients are obtained by projecting the mesh geometry onto an orthonormal basis determined by mesh topology. The set partitioning method that jointly codes the zeroes of these coefficients, treats the spectral coefficients for each of the three spatial coordinates with the right priority at all bit planes and realizes a truly embedded bitstream by implicit bit allocation. The experiments on common irregular meshes reveal that the distortion-rate performance of our coder is significantly superior to that of the spectral coder of [10].
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Umut Konur, Umut Konur, Ulug Bayazit, Ulug Bayazit, Hasan F. Ates, Hasan F. Ates, Fikret S. Gürgen, Fikret S. Gürgen, } "Spectral coding of mesh geometry with a hierarchical set partitioning algorithm", Proc. SPIE 6822, Visual Communications and Image Processing 2008, 682227 (28 January 2008); doi: 10.1117/12.764851; https://doi.org/10.1117/12.764851
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT

Lattice quantization in the wavelet domain
Proceedings of SPIE (October 31 1993)
Iterative Restoration Of Tomosynthetic Slices
Proceedings of SPIE (August 02 1984)
Lattice vector quantization approach to image coding
Proceedings of SPIE (October 31 1992)
Very low bit-rate vector-quantized video codecs
Proceedings of SPIE (December 27 1998)

Back to Top