Geometry Coding for Triangular Mesh Model with Structuring Surrounding Vertices and Connectivity-Oriented Multiresolution Decomposition

Shuji WATANABE  Akira KAWANAKA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E94-D   No.4   pp.886-894
Publication Date: 2011/04/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E94.D.886
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Image Processing and Video Processing
Keyword: 
polygonal mesh,  multiresolution decomposition,  2-D structuring,  geometry data coding,  space-frequency quantization,  

Full Text: PDF(1.5MB)>>
Buy this Article




Summary: 
In this paper, we propose a novel coding scheme for the geometry of the triangular mesh model. The geometry coding schemes can be classified into two groups: schemes with perfect reconstruction property that maintains their connectivity, and schemes without it in which the remeshing procedure is performed to change the mesh to semi-regular or regular mesh. The former schemes have good coding performance at higher coding rate, while the latter give excellent coding performance at lower coding rate. We propose a geometry coding scheme that maintains the connectivity and has a perfect reconstruction property. We apply a method that successively structures on 2-D plane the surrounding vertices obtained by expanding vertex sequences neighboring the previous layer. Non-separable component decomposition is applied, in which 2-D structured data are decomposed into four components depending on whether their location was even or odd on the horizontal and vertical axes in the 2-D plane. And a prediction and update are performed for the decomposed components. In the prediction process the predicted value is obtained from the vertices, which were not processed, neighboring the target vertex in the 3-D space. And the zero-tree coding is introduced in order to remove the redundancies between the coefficients at similar positions in different resolution levels. SFQ (Space-Frequency Quantization) is applied, which gives the optimal combination of coefficient pruning for the descendant coefficients of each tree element and a uniform quantization for each coefficient. Experiments applying the proposed method to several polygon meshes of different resolutions show that the proposed method gives a better coding performance at lower bit rate when compared to the conventional schemes.