In this paper, we propose a new compression method for geometrydata of 3-D mode using decoded coefficient prediction based on the structuring of surrounding vertices. We have proposed the structuring procedure of sur...
详细信息
ISBN:
(纸本)9781467356046
In this paper, we propose a new compression method for geometrydata of 3-D mode using decoded coefficient prediction based on the structuring of surrounding vertices. We have proposed the structuring procedure of surrounding 3-D vertices on a 2-D plane to obtain 2-D structured geometrydata. In this paper, multiresolution decomposition by decoded coefficient prediction decomposes structured geometrydata in consideration of correlations between adjacent vertices. The decomposition processing gives four components in one step according to where each vertex is located in the structured geometrydata and the prediction is performed. In the prediction process, the predicted value is obtained from decoded coefficients of the processed vertices adjacent to the target vertex in the polygonal mesh. Experimental results show that the proposed method gives better coding performance, in particular at higher coding rates, than conventional coding methods.
In this paper, we propose a novel coding scheme for the geometry of the triangular mesh model. The geometrycoding schemes can be classified into two groups: schemes with perfect reconstruction property that maintains...
详细信息
In this paper, we propose a novel coding scheme for the geometry of the triangular mesh model. The geometrycoding 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 geometrycoding 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.
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 geometrydata. In this paper, nonsep...
详细信息
ISBN:
(纸本)9781424456536
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 geometrydata. In this paper, nonseparable component decomposition is proposed to decompose the structured geometrydata 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.
暂无评论