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

18th IEEE International Conference on Image Processing (ICIP)

作者： Lee, dae-Youn Ahn, Jae-Kyun Ahn, Minsu Kim, James d. K. Kim, ChangYeong Kim, Chang-Su Korea Univ Sch Elect Engn Seoul South Korea Samsung Adv Inst Technol Suwon South Korea

ISBN: (纸本)9781457713033

A three-dimensional (3d) mesh compression algorithm based on novel prediction methods and a mode decision scheme is proposed in this work. After decomposing an input mesh into base and refinement layers, we segment the geometry data of each layer into clusters. To encode vertex positions efficiently, we propose two predict ion methods: the dual ring prediction and the minimum mean square error (MMSE) prediction. Also, we develop a mode decision scheme that selects the best prediction mode for each cluster. Simulation results demonstrate that the proposed algorithm provides significantly better compression performance than conventional techniques.

关键词： 3d mesh compression progressive mesh compression geometry coding predictive coding mode decision

来源：评论

学校读者我要写书评

暂无评论

Progressive 3d mesh compression using MOG-based Bayesian entropy coding and gradual prediction

引用

VISUAL COMPUTER 2014年第10期30卷 1077-1091页

作者： Lee, dae-Youn Sull, Sanghoon Kim, Chang-Su Korea Univ Sch Elect Engn Seoul South Korea

A progressive 3d triangular mesh compression algorithm built on the MOG-based Bayesian entropy coding and the gradual prediction scheme is proposed in this work. For connectivity coding, we employ MOG models to estimate the posterior probabilities of topology symbols given vertex geometries. Then, we encode the topology symbols using an arithmetic coder with different contexts, which depend on the posterior probabilities. For geometry coding, we propose the gradual prediction labeling and the dual-ring prediction to divide vertices into groups and predict later groups more efficiently using the information in already encoded groups. Simulation results demonstrate that the proposed algorithm provides significantly better performance than the conventional wavemesh coder, with the average bit rate reduction of about 16.9 %.

关键词： Triangular mesh 3d mesh compression Predictive coding Progressive coding Mixture of Gaussian model Context-based arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Technologies for 3d mesh compression: A survey

引用

JOURNAL OF VISUAL COMMUNICATION ANd IMAGE REPRESENTATION 2005年第6期16卷 688-733页

作者： Peng, Jingliang Kim, Chang-Su Kuo, C. -C. Jay Univ So Calif Dept Elect Engn Integrated Media Syst Ctr Los Angeles CA 90089 USA Chinese Univ Hong Kong Dept Informat Engn Shatin Hong Kong Peoples R China

Three-dimensional (313) meshes have been widely used in graphic applications for the representation of 3d objects. They often require a huge amount of data for storage and/or transmission in the raw data format. Since most applications demand compact storage, fast transmission, and efficient processing of 3d meshes, many algorithms have been proposed to compress 3d meshes efficiently since early 1990s. In this survey paper, we examine 3d mesh compression technologies developed over the last decade, with the main focus on triangular mesh compression technologies. In this effort, we classify various algorithms into classes, describe main ideas behind each class, and compare the advantages and shortcomings of the algorithms in each class. Finally, we address some trends in the 3d mesh compression technology development. (c) 2005 Elsevier Inc. All rights reserved.

关键词： 3d mesh compression single-rate mesh coding progressive mesh coding MPEG-4

来源：评论

学校读者我要写书评

暂无评论

Objective and subjective evaluation of static 3d mesh compression

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 2013年第2期28卷 181-195页

作者： Berjon, daniel Moran, Francisco Manjunatha, Shankar Univ Politecn Madrid Grp Tratamiento Imagenes ETSL Telecomunicac E-28040 Madrid Spain Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90095 USA

3d mesh compression is essential in the context of network-based virtual worlds, but so are objective and subjective fidelity of the reconstructed mesh to the original one. Unfortunately, it is difficult to establish a fair way to compare objectively two textured, triangular 3d meshes meant to approximate the surface of the same 3d object. We explain why by elaborating on how the geometric distance between two meshes can be estimated, after introducing some basic concepts related to mesh shape and a brief taxonomy of static 3d mesh coding techniques. We review a selection of such coding techniques, almost all of which deal only with the shape of the surface, and then focus on surface appearance, usually described separately with a texture to be mapped onto the 3d mesh at rendering time, and we also review existing techniques specifically devised to compress textures meant for 3d models. Finally, we discuss the even larger complexity of establishing any reasonable way to compare the subjective quality of the experience produced by two versions of the same 3d object, especially if different rendering methods may be used. (C) 2012 Elsevier B.V. All rights reserved.

关键词： 3d mesh compression Surface distance Texture compression Objective error Subjective error

来源：评论

学校读者我要写书评

暂无评论

Fast 3d mesh compression Using Shared Vertex Analysis

引用

ETRI JOURNAL 2010年第1期32卷 163-165页

作者： Jang, Euee Seon Lee, Seungwook Koo, Bonki Kim, daiyong Son, Kyoungsoo Hanyang Univ Dept Elect Comp & Commun Engn Seoul 133791 South Korea ETRI Contents Res Div Taejon South Korea

A trend in 3d mesh compression is codec design with low computational complexity which preserves the input vertax and face order However;this added information increases the complexity. We present a fast 3d mesh compression method that compresses the redundant shared vertex information between neighboring faces using simple first-order differential coding followed by fast entropy coding with a fixed length prefix. Our algorithm is feasible for low complexity designs and maintains the order which is now part of the MPEG-4 scalable complexity 3d mesh compression standard. The proposed algorithm is 30 times faster than MPEG-4 3d mesh coding extension.

关键词： 3d mesh compression prefix code real-time encoding and decoding

来源：评论

学校读者我要写书评

暂无评论

An efficient 3d mesh compression technique based on triangle fan structure

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 2003年第1期18卷 17-32页

作者： Sim, JY Kim, CS Lee, SU Seoul Natl Univ Sch Elect Engn & Comp Sci Seoul 151742 South Korea

In this paper, we propose an efficient compression algorithm for 3d triangular meshes, consisting of topology data and geometry data. First, the vertex degree warping technique is proposed to compress the topology data losslessly. The proposed algorithm exploits the geometrical information to efficiently encode the topology data, while most conventional algorithms process the topology data and the geometry data independently. Second, the dual parallelogram prediction technique is proposed as an effective geometry prediction scheme. By using forward and backward parallelograms, the proposed algorithm provides smaller prediction errors than the conventional parallelogram prediction scheme. Simulation results on various mesh models demonstrate that the proposed algorithm yields higher compression ratio than the conventional mesh compression algorithms proposed in Touma and Gotsman (Proceedings of the Graphics Interface '98, June 1998, pp. 26-34) and MPEG-4 3d mesh coding (3dMC) standard ISO/IEC 14496-2 (Information Technology-Coding of Audio-Visual Objects- Part 2: Visual, July 2001. The 3dMC reference software is available from http://***/shhc). (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： 3d mesh compression vertex degree warping dual parallelogram prediction

来源：评论

学校读者我要写书评

暂无评论

TFAN: A low complexity 3d mesh compression algorithm

引用

COMPUTER ANIMATION ANd VIRTUAL WORLdS 2009年第2-3期20卷 343-354页

作者： Mamou, Khaled Zaharia, Titus Preteux, Francoise TELECOM SudParis Inst TELECOM ARTEMIS Dept F-91011 Evry France

This paper proposes a novel approach for mono-resolution 3d mesh compression, called TFAN (Triangle Fan-based compression). TFAN treats in a unified manner meshes of arbitrary topologies, i.e., manifold or not, oriented or not, while offering a linear computational complexity (with respect to the number of mesh vertices) for both encoding and decoding algorithms. In addition, the TFAN compressed representation is optimized for real-time decoding applications. In order to validate the proposed approach, two databases have been considered for experimentations. The first is the MPEG-4 test set, Which includes over 3500 general purpose manifold meshes. Vie second, related to the French national project SEMANTIC-3d, includes over 4000 computer assisted design (CAd) meshes of highly irregular, non-manifold topologies. In both cases, the TFAN approach outperforms existing techniques such as MPEG-4/3dMC (3d mesh Coding) or Touma and Gotsman, with decoding times lower by an order of magnitude at equivalent or even better levels of compression efficiency (+/- 10% in bitrate). In addition, When applied to non-manifold 3d data, the compression performances are significantly enhanced (6-30% gain in bitrate). due to its high compression performances the TFAN approach has been recently retained for ISO standardization, within the framework of the MPEG-4/AFX standard. Copyright (C) 2009 John Wiley & Sons, Ltd.

关键词： 3d mesh compression real-time decoding low complexity MPEG-4 standard

来源：评论

学校读者我要写书评

暂无评论

A TRIANGLE-FAN-BASEd APPROACH FOR LOW COMPLEXITY 3d mesh compression

A TRIANGLE-FAN-BASED APPROACH FOR LOW COMPLEXITY 3D MESH COM...

引用

16th IEEE International Conference on Image Processing

作者： Mamou, Khaled Zaharia, Titus Preteux, Francoise TELECOM & Management SudParis Inst TELECOM ARTEMIS Dept F-91011 Evry France

ISBN: (纸本)9781424456536

This paper proposes a novel approach for mono-resolution 3d mesh compression, called TFAN (Triangle Fan-based compression). TFAN treats in a unified manner meshes of arbitrary topologies, i.e. manifold or not, oriented or not, while supporting real-time decoding. The proposed approach has been evaluated on both manifold and non-manifold databases, including more than 7000 3d mesh models. Experiments show that the TFAN approach outperforms existing techniques such as MPEG-4 3dMC or Touma & Gotsman, with decoding times lower by an order of magnitude at equivalent or even better levels of compression efficiency (+/-10% in bitrate). When applied to non-manifold 3d data, the compression performances are significantly enhanced (6% to 30% gain in bitrate). due to its high compression performances TFAN has been recently retained for ISO MPEG-4 standardization.

关键词： 3d mesh compression real-time decoding low complexity MPEG-4 standard

来源：评论

学校读者我要写书评

暂无评论

TFAN: A low complexity 3d mesh compression algorithm

TFAN: A low complexity 3D mesh compression algorithm

引用

22nd International Conference on Computer Animation and Social Agents (CASA 2009)

作者： Mamou, Khaled Zaharia, Titus Preteux, Francoise TELECOM SudParis Inst TELECOM ARTEMIS Dept F-91011 Evry France

关键词： 3d mesh compression real-time decoding low complexity MPEG-4 standard

来源：评论

学校读者我要写书评

暂无评论

3d mesh compression Using Reverse Subdivision Based on Vertex Saliency

3D Mesh Compression Using Reverse Subdivision Based on Verte...

引用

2014 International Conference on Advanced Computer Science and Engineering(ACSE 2014)

作者： Zi-long ZHAO Ye YUAN Qing-fu LI School of Information Engineering Beijing Institute of Fashion Technology Department of Elements Beijing Institute of Fashion Technology

Mobile 3d graphics processing on mobile terminals is an emerging research area in the computer graphics field. Considering the limited processor performance and storage space of mobile terminals as well as narrow bandwidth of wireless networks, a progressive representation of the 3d mesh object is introduced in this paper. The presented scheme is the combination of simplification, adjustment of the simplified mesh, reverse subdivision and generation of the displacements. Through which, the original mesh can be decomposed into a compact mesh and a sequence of displacements. The sequence of displacements are characterized by small magnitude allowing us to compress most connectivity information. Successive data to be transmitted over the wireless network consist of the compact mesh and a stream of displacements. mesh reconstruction is achieved by adding displacement values incrementally to the compact mesh.

关键词： 3d mesh compression Reverse subdivision Vertex saliency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：