检索结果-内蒙古大学图书馆

Delphi: geometry-based connectivity prediction in triangle mesh compression

VISUAL COMPUTER 2004年第8-9期20卷 507-520页

作者： Coors, V Rossignac, J Stuttgart Univ Appl Sci Geomat Comp Sci & Math D-70174 Stuttgart Germany Georgia Inst Technol Coll Comp IRIS Atlanta GA 30332 USA Georgia Inst Technol Coll Comp GVU Ctr Atlanta GA 30332 USA

Delphi is a new geometry-guided predictive scheme for compressing the connectivity of triangle meshes. Both compression and decompression algorithms traverse the mesh using the EdgeBreaker state machine. However, instead of encoding the EdgeBreaker clers symbols that capture connectivity explicitly, they estimate the location of the unknown vertex, v, of the next triangle. If the predicted location lies sufficiently close to the nearest vertex, w, on the boundary of the previously traversed portion of the mesh, then Delphi estimates that v coincides with w. When the guess is correct, a single confirmation bit is encoded. Otherwise, additional bits are used to encode the rectification of that prediction. When v coincides with a previously visited vertex that is not adjacent to the parent triangle (EdgeBreaker S case), the offset, which identifies the vertex v, must be encoded, mimicking the cut-border machine compression proposed by Gumhold and Strasser. On models where 97% of Delphi predictions are correct, the connectivity is compressed down to 0.19 bits per triangle. Compression rates decrease with the frequency of wrong predictors, but remains below 1.50 bits per triangle for all models tested.

关键词： triangle meshes connectivity coding geometric prediction geometry compression

来源：评论

学校读者我要写书评

暂无评论

Triangle strip compression

引用

COMPUTER GRAPHICS FORUM 2001年第2期20卷 91-101页

作者： Isenburg, M Univ N Carolina Chapel Hill NC 27514 USA

In this paper we introduce a simple and efficient scheme for encoding the connectivity and the stripification of a triangle mesh. Since generating a good set of triangle strips is a hard problem, it is desirable to do this just once and store the computed strips with the triangle mesh. However, no previously reported mesh encoding scheme is designed to include triangle strip information into the compressed representation. our algorithm encodes the stripification and the connectivity in an interwoven fashion, that exploits the correlation existing between the two.

关键词： mesh compression connectivity coding triangle strips triangle fans stripification

来源：评论

学校读者我要写书评

暂无评论

3D Model compression using connectivity-Guided Adaptive Wavelet Transform built into 2D SPIHT

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2010年第1期21卷 17-28页

作者： Kose, Kivanc Cetin, A. Enis Gudukbay, Ugur Onural, Levent Bilkent Univ Dept Elect & Elect Engn TR-06800 Ankara Turkey Bilkent Univ Dept Comp Engn TR-06800 Ankara Turkey

connectivity-Guided Adaptive Wavelet Transform based mesh compression framework is proposed. The transformation uses the connectivity information of the 3D model to exploit the inter-pixel correlations. Orthographic projection is used for converting the 3D mesh into a 2D image-like representation. The proposed conversion method does not change the connectivity among the vertices of the 3D model. There is a correlation between the pixels of the composed image due to the connectivity of the 3D mesh. The proposed wavelet transform uses an adaptive predictor that exploits the connectivity information of the 3D model. Known image compression tools cannot take advantage of the correlations between the samples. The wavelet transformed data is then encoded using a zero-tree wavelet based method. Since the encoder creates a hierarchical bitstream, the proposed technique is a progressive mesh compression technique. Experimental results show that the proposed method has a better rate distortion performance than MPEG-3DGC/MPEG-4 mesh coder. (C) 2009 Elsevier Inc. All tights reserved.

关键词： SPIHT Mesh compression Adaptive wavelet transform Projection Image compression Static mesh connectivity coding Progressive mesh representation

来源：评论

学校读者我要写书评

暂无评论

A distance-based compression of 3D meshes for mobile devices

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2008年第3期54卷 1398-1405页

作者： Kim, Daeyoung Lee, Haeyoung Cho, Sungdae Hongik Univ Dept Comp Engn Seoul South Korea Samsung Elect Co Suwon Gyeonggido South Korea

We present a new 3D mesh codec for mobile devices. Mobile devices have limited resources such as low memory, show CPU speed, low power, and no floaling-point processor. Considering these mobile characteristics. we suggest a new approach: a hybrid of a progressive geometry and a single-rate connectivity coding. By this approach, our algorithm achieves fast visual updates of progressive 3D point clouds on a small screen of a mobile device and later finalizes restoring faces of the mesh without intensive computing. For a progressive geometry coding, an octree is created and coded. For a single-rate connectivity, coding, a new distance based algorithm is introduced. Our algorithm uses only fixed-point arithmetic with simple data structures. Our new 3D mesh codec has been tested 017 a real mobile phone and the statistical and visual results are also presented in this paper(1).

关键词： mobile devices 3D mesh compression connectivity coding geometry coding

来源：评论

学校读者我要写书评

暂无评论

Triangle mesh compression along the Hamiltonian cycle

引用

VISUAL COMPUTER 2013年第6-8期29卷 717-727页

作者： Zhang, Jie Zheng, Changwen Hu, Xiaohui Chinese Acad Sci Inst Software Natl Key Lab Integrated Informat Syst Technol Beijing Peoples R China Chinese Acad Sci Grad Univ Beijing Peoples R China

This paper proposes a novel and efficient algorithm for single-rate compression of triangle meshes. The input mesh is traversed along its greedy Hamiltonian cycle in O(n) time. Based on the Hamiltonian cycle, the mesh connectivity can be encoded by a face label sequence with low entropy containing only four kinds of labels (HETS) and the transmission delay at the decoding end that frequently occurs in the conventional single-rate approaches is obviously reduced. The mesh geometry is compressed with a global coordinate concentration strategy and a novel local parallelogram error prediction scheme. Experiments on realistic 3D models demonstrate the effectiveness of our approach in terms of compression rates and run time performance compared to the leading single-rate and progressive mesh compression methods.

关键词： Triangle mesh Mesh compression Hamiltonian cycle connectivity coding Geometry coding Arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Streaming compression of tetrahedral volume meshes

Streaming compression of tetrahedral volume meshes

引用

32nd Graphics Interface Conference

作者： Isenburg, Martin Lindstrom, Peter Gumhold, Stefan Shewchuk, Jonathan Univ Calif Berkeley Berkeley CA 94720 USA LLNL Livermore CA 94550 USA Tech Univ Dresden Dresden Germany

ISBN: (纸本)1568813082

Geometry processing algorithms have traditionally assumed that the input data is entirely in main memory and available for random access. This assumption does not scale to large data sets, as exhausting the physical memory typically leads to IO-inefficient thrashing. Recent works advocate processing geometry in a "streaming" manner, where computation and output begin as soon as possible. Streaming is suitable for tasks that require only local neighbor information and batch process an entire data set. We describe a streaming compression scheme for tetrahedral volume meshes that encodes vertices and tetrahedra in the order they are written. To keep the memory footprint low, the compressor is informed when vertices are referenced for the last time (i.e. are finalized). The compression achieved depends on how coherent the input order is and how many tetrahedra are buffered for local reordering. For reasonably coherent orderings and a buffer of 10,000 tetrahedra, we achieve compression rates that are only 25 to 40 percent above the state-of-the-art, while requiring drastically less memory resources and less than half the processing time.

关键词： mesh compression geometry streaming connectivity coding stream-processing tetrahedral meshes volume data

来源：评论

学校读者我要写书评

暂无评论

Lossless Compression of Adaptive Multiresolution Meshes

Lossless Compression of Adaptive Multiresolution Meshes

引用

22nd Brazilian Symposium on Computer Graphics and Image Processing

作者： Kaelberer, Felix Polthier, Konrad von Tycowicz, Christoph Free Univ Berlin D-1000 Berlin Germany

ISBN: (纸本)9781424449781

We present a novel coder for lossless compression of adaptive multiresolution meshes that exploits their special hierarchical structure. The heart of our method is a new progressive connectivity coder that can be combined with leading geometry encoding techniques. The compressor uses the parent/child relationships inherent to the hierarchical mesh. We use the rules that accord to the refinement scheme and store bits only where it leaves freedom of choice, leading to compact codes that are free of redundancy. To illustrate our scheme we chose the widespread red-green refinement, but the underlying concepts can be directly transferred to other adaptive refinement schemes as well. The compression ratio of our method exceeds that of state-of-the-art coders by a factor of 2 to 3 on most of our benchmark models.

关键词： multiresolution subdivision surfaces level-of-detail connectivity coding lossless progressive mesh coding 3D mesh compression

来源：评论

学校读者我要写书评

暂无评论

Compressing polygon mesh connectivity with degree duality prediction

Compressing polygon mesh connectivity with degree duality pr...

引用

Graphics Interface 2002 Conference

作者： Isenburg, M Univ N Carolina Chapel Hill NC 27514 USA

ISBN: (纸本)1568811837

In this paper we present a coder for polygon mesh connectivity that delivers the best connectivity compression rates meshes reported so far. Our coder is an extension of the vertex-based coder for triangle mesh connectivity by Touma and Gotsman [26]. We code polygonal connectivity as a sequence of face and vertex degrees and exploit the correlation between them for mutual predictive compression. Because low-degree vertices are likely to be surrounded by high-degree faces and vice versa, we predict vertex degrees based on neighboring face degrees and face degrees based on neighboring vertex degrees.

关键词： connectivity coding graph coding mesh compression non-manifold meshes degree duality

来源：评论

学校读者我要写书评

暂无评论

Triangle mesh compression along the Hamiltonian cycle

Triangle mesh compression along the Hamiltonian cycle

引用

Computer Graphics International (CGI) Conference

关键词： Triangle mesh Mesh compression Hamiltonian cycle connectivity coding Geometry coding Arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Streaming compression of tetrahedral volume meshes 06

Streaming compression of tetrahedral volume meshes

引用

Proceedings of Graphics Interface 2006

作者： Martin Isenburg Peter Lindstrom Stefan Gumhold Jonathan Shewchuk UC Berkeley LLNL TU Dresden

ISBN: (纸本)9781568813080

Geometry processing algorithms have traditionally assumed that the input data is entirely in main memory and available for random access. This assumption does not scale to large data sets, as exhausting the physical memory typically leads to IO-inefficient thrashing. Recent works advocate processing geometry in a "streaming" manner, where computation and output begin as soon as possible. Streaming is suitable for tasks that require only local neighbor information and batch process an entire data *** describe a streaming compression scheme for tetrahedral volume meshes that encodes vertices and tetrahedra in the order they are written. To keep the memory footprint low, the compressor is informed when vertices are referenced for the last time (i.e. are finalized). The compression achieved depends on how coherent the input order is and how many tetrahedra are buffered for local reordering. For reasonably coherent orderings and a buffer of 10,000 tetrahedra, we achieve compression rates that are only 25 to 40 percent above the state-of-the-art, while requiring drastically less memory resources and less than half the processing time.

关键词： stream-processing connectivity coding tetrahedral meshes geometry streaming volume data mesh compression

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：