Progressive geometry compression

Khodakovsky, Andrei; Schröder, Peter; Sweldens, Wim

doi:10.1145/344779.344922

Cited by 463 publications

(416 citation statements)

References 39 publications

Supporting

Mentioning

409

Contrasting

Unclassified

Order By: Relevance

“…In the context of progressive transmission much of the work has focused on methods for better compression of geometric data rather than on robust transmission [39,30,26,3,18]. These techniques are complementary to our own, in that they could fit within the techniques proposed here to achieve higher transmission rates.…”

Section: Progressive Mesh Transmissionmentioning

confidence: 99%

See 1 more Smart Citation

Hybrid and forward error correction transmission techniques for unreliable transport of 3D geometry

2005

View full text Add to dashboard Cite

Abstract. The continual improvement in computer performance together with the prevalence of high-speed network connections having high throughput and moderate latencies enables the deployment of multimedia applications, such as collaborative virtual environments, over wide area networks. These applications can serve as simulated environments in scenarios such as emergency response training to catastrophic disasters, military training, and entertainment. Many of these systems use 3D graphics for display and may be required to distribute geometric models on demand between participants. Progressive meshes provide an attractive mechanism for such distribution. Previous uses of progressive meshes have sent data using reliable protocols (TCP). However, such protocols have disadvantages in on-demand settings, in that they: (1) use flow control, which limits performance in wide area networks; (2) add additional bandwidth when there is loss; (3) treat all loss as an indication of congestion; and (4) require feature-rich multicast support, which is not always available. In this paper, we modify progressive mesh models to allow reconstruction even in the event of packet loss. We use these modifications in two transmission schemes, a hybrid transmission that uses TCP and UDP to send packets and a forward error-correcting transmission scheme that uses redundancy to decode the information sent. We assess the performance of these transmission schemes when deployed on network testbeds that simulate wide-area and wireless characteristics.

show abstract

Section: Progressive Mesh Transmissionmentioning

confidence: 99%

“…Various authors [30,39,26] have combined mesh compression techniques with progressive transmission to reduce the amount of data that needs to be sent. Typically, there is a trade-off between compression ratio and the fragility of the compressed mesh.…”

Section: Introductionmentioning

confidence: 99%

Hybrid and forward error correction transmission techniques for unreliable transport of 3D geometry

2005

View full text Add to dashboard Cite

show abstract

“…isosurfaces) include those by [27,12]. A compression scheme specialized for isosurfaces [29] utilizes the unique property of an isosurface that only the signifi-cant edges and function values defined on a vertex are required to be encoded.…”

Section: Compressionmentioning

confidence: 99%

Volumetric video compression for interactive playback

Sohn

Bajaj

Siddavanahalli

2004

Computer Vision and Image Understanding

View full text Add to dashboard Cite

We develop a volumetric video system which supports interactive browsing of compressed timevarying volumetric features (significant isosurfaces and interval volumes). Since the size of even one volumetric frame in a time-varying 3D data set is very large, transmission and on-line reconstruction are the main bottlenecks for interactive remote visualization of time-varying volume and surface data. We describe a compression scheme for encoding time-varying volumetric features in a unified way, which allows for on-line reconstruction and rendering. To increase the run-time decompression speed and compression ratio, we decompose the volume into small blocks and encode only the significant blocks that contribute to the isosurfaces and interval volumes. The results show that our compression scheme achieves high compression ratio with fast reconstruction, which is effective for client-side rendering of time-varying volumetric features.

show abstract

“…Furthermore, this representation implies that majority of vertices have valence 6. This piecewise sampling regularity allows very efficient wavelet decomposition [7,8], and consequently several wavelet coders exploit them. Let us cite for example the coder NMC proposed by Khodakovsky and Guskov (2002) in [8].…”

Section: Introductionmentioning

confidence: 99%

“…Let us cite for example the coder NMC proposed by Khodakovsky and Guskov (2002) in [8]. This coder is based on an unlifted butterfly wavelet transform and a zerotree coder developed in [7]. By using a local frame depending on the coarser mesh, this transform ensures that for smooth surfaces the majority of wavelet coefficients have no tangential component, and that almost all the geometry information lies in the normal components.…”

Section: Introductionmentioning

confidence: 99%

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

Payan

Antonini

2005

Computer Aided Geometric Design

View full text Add to dashboard Cite

We propose a new wavelet compression algorithm based on the rate-distortion optimization for densely sampled triangular meshes. This algorithm includes the normal remesher, 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 useful bit allocation, we propose a model-based approach, depending on the wavelet coefficient distributions. The proposed algorithm achieves results better than state-of-the-art methods, up to +2.5 dB compared to the original zerotree coder for normal meshes.

show abstract

Progressive geometry compression

Cited by 463 publications

References 39 publications

Hybrid and forward error correction transmission techniques for unreliable transport of 3D geometry

Hybrid and forward error correction transmission techniques for unreliable transport of 3D geometry

Volumetric video compression for interactive playback

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

Contact Info

Product

Resources

About