【24h】

Wavelet based progressive mesh compression with random accessibility

机译:基于小波的渐进式网格压缩,随机访问

获取原文

摘要

Because of self-occlusion, browsing 3D objects is naturally a random access problem. After compression, if only data of visible regions under the current viewing parameter are transmitted and decoded, the network bandwidth and decoding resources can be saved. Almost all state of the art mesh compression schemes do not take random access into account. We propose a wavelet transform based progressive mesh compression scheme which incorporates random accessibility. The mesh is partitioned into many blocks, the detail of each block is encoded independently, then only detail of visible blocks are transmitted. The wavelet coefficients which represent detail are grouped into zerotrees, and each zerotree is encoded independently using a modified SPIHT (set partitioning in hierarchical trees) algorithm. The experimental results indicate the proposed scheme has achieved comparable compression efficiency with PGC, and only about 60% of total bit-stream is required to reconstruct visible regions.
机译:由于自遮挡,浏览3D对象是自然的随机接入问题。在压缩之后,如果仅发送和解码当前观看参数下可见区域的数据,则可以保存网络带宽和解码资源。几乎所有最先进的网格压缩方案都不会考虑随机访问。我们提出了一种基于小波变换的渐进网格压缩方案,其包含随机可访问性。该网格被划分为许多块,每个块的细节独立地编码,然后仅发送可见块的细节。表示细节的小波系数被分组为Zerotrees,并且每个Zerotree使用修改的SPIHT(分层树中设置分区)算法独立编码。实验结果表明所提出的方案已经实现了PGC的可比压缩效率,并且只需要总比特流的约60%来重建可见区域。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号