Multiresolution decomposition for triangular mesh geometry coding based on structuring surrounding vertices

A novel coding method using multiresolution decomposition for triangular mesh is proposed. We have proposed surrounding vertices structuring on a 2-D plane to obtain 2-D structured geometry data. In this paper, non-separable component decomposition is proposed to decompose the structured geometry data in consideration of correlations among neighboring vertices. The structured data are decomposed into four components depending on whether each vertex was located at even or odd positions along the horizontal and vertical axes. And a prediction and update are performed. In the prediction process the predicted value is obtained from the non-processed vertices neighboring to the target vertex in the 3-D space. By repeating the decomposition process for the update component, octave-decomposed coefficients are obtained. The vector SFQ is introduced to remove redundancies among the coefficients at similar positions in different resolution levels. Experiments showed that the proposed method gave better coding performances comparing to conventional coding schemes.

[1]  Gabriel Taubin,et al.  Geometry coding and VRML , 1998, Proc. IEEE.

[2]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[3]  Craig Gotsman,et al.  Triangle Mesh Compression , 1998, Graphics Interface.

[4]  Andrei Khodakovsky,et al.  Progressive geometry compression , 2000, SIGGRAPH.

[5]  Michael T. Orchard,et al.  Space-frequency quantization for wavelet image coding , 1996, Optics & Photonics.

[6]  A. Kawanaka,et al.  Triangular Mesh Geometry Coding with Multiresolution Decomposition Based on Structuring of Surrounding Vertices , 2008, 2008 IEEE International Symposium on Signal Processing and Information Technology.

[7]  Steven J. Gortler,et al.  Geometry images , 2002, SIGGRAPH.

[8]  Michael T. Orchard,et al.  Space-frequency quantization for wavelet image coding , 1997, IEEE Trans. Image Process..