An efficient bit allocation for compressing normal meshes with an error-driven quantization

  • Authors:
  • Frédéric Payan;Marc Antonini

  • Affiliations:
  • Laboratoire I3S, UMR 6070 CNRS, Université de Nice-Sophia Antipolis, 2000 route des Lucioles, F-06903 Sophia Antipolis, France;Laboratoire I3S, UMR 6070 CNRS, Université de Nice-Sophia Antipolis, 2000 route des Lucioles, F-06903 Sophia Antipolis, France

  • Venue:
  • Computer Aided Geometric Design - Special issue: Geometry processing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a new wavelet compression algorithm based on the rate-distortion optimization for densely sampled triangular meshes. Exploiting the normal remesher of Guskov et al., the proposed algorithm includes a wavelet transform and an original bit allocation optimizing the quantization of the wavelet coefficients. The allocation process minimizes the reconstruction error for a given bit budget. As distortion measure, we use the mean square error of the normal mesh quantization, expressed according to the quantization error of each subband. We show that this metric is a suitable criterion to evaluate the reconstruction error, i.e., the geometric distance between the input mesh and the quantized normal one. Moreover, to design a fast bit allocation, we propose a model-based approach, depending on distribution of the wavelet coefficients. Compared to the state-of-the-art methods for normal meshes, our algorithm provides improvements in coding performance, up to +2.5 dB compared to the original zerotree coder.