Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition

Peng, Jingliang; Kuo, C.-C. Jay

doi:10.1145/1186822.1073237

Cited by 57 publications

(87 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The connectivity is encoded using vertex splits. Peng and Kuo also developed a geometry-driven progressive mesh compression algorithm [19] based on an octree data structure. This coder predicts the connectivity of the mesh from the neighbor vertices geometry during the vertex splits thanks to pivot vertices.…”

Section: Geometry-basedmentioning

confidence: 99%

“…It can also be noticed that the experimental results presented in [10] and [13] do not compare favorably with recent state of the art techniques. In recent work [19], Peng and Kuo discuss the progressive compression of polygon meshes by an octree coder. As their algorithm can compress arbitrary connectivity between vertices, it is possible to modify the face construction algorithm to reconstruct polygon faces.…”

Section: Handling Polygon Meshesmentioning

confidence: 99%

“…The main rationale is that a precise level of the initial quantization is not needed for low LODs which have very few vertices. The decimation contests are encoded with the AD coder and the quantization contests are encoded with the Peng and Kuo geometry coder [19].…”

Section: Adaptive Quantizationmentioning

confidence: 99%

“…The approach of Valette et al [21] also provides very good results: the compression ratio are high and the R-D curve is excellent with the rabbit model, at the price of not guaranteeing the restoration of the initial connectivity. The octree coder [19] gives good compression rates but the distortion is high at low rates. The R-D optimized coder from [20] also performs well in terms of compression ratio but is weaker than our coder in terms of distortion at low rates.…”

Section: Progressive Compression Of Triangle Meshesmentioning

confidence: 99%

See 3 more Smart Citations

Progressive compression of manifold polygon meshes

Maglo

Courbet

Alliez

et al. 2012

Computers & Graphics

View full text Add to dashboard Cite

This paper presents a new algorithm for the progressive compression of manifold polygon meshes. The input surface is decimated by several traversals that generate successive levels of detail through a specific patch decimation operator which combines vertex removal and local remeshing. The mesh connectivity is encoded by two lists of Boolean error predictions based on the mesh geometry: one for the inserted edges and the other for the faces with a removed center vertex. The mesh geometry is encoded with a barycentric error prediction of the removed vertex coordinates and a local curvature prediction. We also include two methods that improve the rate-distortion performance: a wavelet formulation with a lifting scheme and an adaptive quantization technique. Experimental results demonstrate the effectiveness of our approach in terms of compression rates and rate-distortion performance.

show abstract

Section: Geometry-basedmentioning

confidence: 99%

Section: Handling Polygon Meshesmentioning

confidence: 99%

Section: Adaptive Quantizationmentioning

confidence: 99%

Section: Progressive Compression Of Triangle Meshesmentioning

confidence: 99%

See 2 more Smart Citations

Progressive compression of manifold polygon meshes

Maglo

Courbet

Alliez

et al. 2012

Computers & Graphics

View full text Add to dashboard Cite

show abstract

“…Ma (Ma and Li, 2016) proposed the KD-tree based on the compression method of a 3D dynamic scene which reduces the limitation of network bandwidth. Benefiting from both regular and recursive rules, the octree is capable of compressing the model size due to restructuring spatial relationship and finally accelerates searching speed (Peng and Kuo, 2005;Yue et al, 2009). This is also usually used for spatial subdivision in 3D geographic scenes (Jiong et al, 2017;Lixin and Jieqing, 2009).…”

Section: Introductionmentioning

confidence: 99%

An Encoding Method for Compressing Geographical Coordinates in 3d Space

Qian

Jiang²,

Li³

2017

Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci.

View full text Add to dashboard Cite

ABSTRACT:This paper proposed an encoding method for compressing geographical coordinates in 3D space. By the way of reducing the length of geographical coordinates, it helps to lessen the storage size of geometry information. In addition, the encoding algorithm subdivides the whole space according to octree rules, which enables progressive transmission and loading. Three main steps are included in this method: (1) subdividing the whole 3D geographic space based on octree structure, (2) resampling all the vertices in 3D models, (3) encoding the coordinates of vertices with a combination of Cube Index Code (CIC) and Geometry Code. A series of geographical 3D models were applied to evaluate the encoding method. The results showed that this method reduced the storage size of most test data by 90% or even more under the condition of a speed of encoding and decoding. In conclusion, this method achieved a remarkable compression rate in vertex bit size with a steerable precision loss. It shall be of positive meaning to the web 3d map storing and transmission.

show abstract

Fast accessing Web3D contents using lightweight progressive meshes

Wen

Xie

Jia

2015

Computer Animation & Virtual

View full text Add to dashboard Cite

Accessing Web3D contents is relatively slow through Internet under limited bandwidth. Preprocessing of 3D models can certainly alleviate the problem, such as 3D compression and progressive meshes (PM). But none of them considers the similarity between components of a 3D model, so that we could take advantage of this to further improve the efficiency. This paper proposes a similarity-aware data reduction method together with PM, called lightweight progressive meshes (LPM). LPM aims to excavate similar components in a 3D model, generates PM representation of each component left after removing redundant components, and organizes all the processed data using a structure called lightweight scene graph. The proposed LPM possesses four significant advantages. First, it can minimize the file size of 3D model dramatically without almost any precision loss. Because of this, minimal data is delivered. Second, PM enables the delivery to be progressive, so called streaming. Third, when rendering at client side, due to lightweight scene graph, decompression is not necessary and instanced rendering is fully exerted. Fourth, it is extremely efficient and effective under very limited bandwidth, especially when delivering large 3D scenes. Performance on real data justifies the effectiveness of our LPM, which improves the state-of-the-art in accessing Web3D contents.

show abstract

Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition

Cited by 57 publications

References 20 publications

Progressive compression of manifold polygon meshes

Progressive compression of manifold polygon meshes

An Encoding Method for Compressing Geographical Coordinates in 3d Space

Fast accessing Web3D contents using lightweight progressive meshes

Contact Info

Product

Resources

About