Spectral coding of mesh geometry with a hierarchical set partitioning algorithm

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