ImageVerifierCode 换一换
格式:PDF , 页数:34 ,大小:2.55MB ,
资源ID:590426      下载积分:10000 积分
快捷下载
登录下载
邮箱/手机:
温馨提示:
如需开发票,请勿充值!快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。
如填写123,账号就是123,密码也是123。
特别说明:
请自助下载,系统不会自动发送文件的哦; 如果您已付费,想二次下载,请登录后访问:我的下载记录
支付方式: 支付宝扫码支付 微信扫码支付   
注意:如需开发票,请勿充值!
验证码:   换一换

加入VIP,免费下载
 

温馨提示:由于个人手机设置不同,如果发现不能下载,请复制以下地址【http://www.mydoc123.com/d-590426.html】到电脑端继续下载(重复下载不扣费)。

已注册用户请登录:
账号:
密码:
验证码:   换一换
  忘记密码?
三方登录: 微信登录  

下载须知

1: 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。
2: 试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。
3: 文件的所有权益归上传用户所有。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 本站仅提供交流平台,并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

版权提示 | 免责声明

本文(CAN CSA-ISO IEC 14496-16B-2015 Information technology - Coding of audio-visual objects - Part 16 Animation Framework eXtension (AFX) AMENDMENT 2 Multi-resolution 3D mesh compressio.pdf)为本站会员(ideacase155)主动上传,麦多课文库仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知麦多课文库(发送邮件至master@mydoc123.com或直接QQ联系客服),我们立即给予删除!

CAN CSA-ISO IEC 14496-16B-2015 Information technology - Coding of audio-visual objects - Part 16 Animation Framework eXtension (AFX) AMENDMENT 2 Multi-resolution 3D mesh compressio.pdf

1、 ISO/IEC 2014. CSA Group 2015. All rights reserved. Unauthorized reproduction is strictly prohibited.Amendment 2:2015 (IDT) toCAN/CSA-ISO/IEC 14496-16:13(ISO/IEC 14496-16:2011, IDT)National Standard of CanadaAmendment 2:2015 (IDT) to CAN/CSA-ISO/IEC 14496-16:13Information technology Coding of audio-

2、visual objects Part 16:Animation Framework eXtension (AFX)AMENDMENT 2: Multi-resolution 3D mesh compression(ISO/IEC 14496-16:2011, IDT)Standards Update ServiceAmendment 2:2015 (IDT) to CAN/CSA-ISO/IEC 14496-16:13December 2015Title: Information technology Coding of audio-visual objects Part 16: Anima

3、tionFramework eXtension (AFX)AMENDMENT 2: Multi-resolution 3D mesh compressionTo register for e-mail notification about any updates to this publication go to shop.csa.ca click on CSA Update ServiceThe List ID that you will need to register for updates to this publication is 2424069.If you require as

4、sistance, please e-mail techsupportcsagroup.org or call 416-747-2233.Visit CSA Groups policy on privacy at www.csagroup.org/legal to find out how we protect yourpersonal information.Reference numberISO/IEC 14496-16:2011/Amd.2:2014(E)ISO/IEC 2014INTERNATIONAL STANDARD ISO/IEC14496-16Fourth edition201

5、1-11-01AMENDMENT 22014-01-15Information technology Coding of audio-visual objects Part 16: Animation Framework eXtension (AFX) AMENDMENT 2: Multi-resolution 3D mesh compression Technologies de linformation Codage des objets audiovisuels Partie 16: Extension du cadre danimation (AFX) AMENDEMENT 2: Co

6、mpression de maillages 3D multirsolution ISO/IEC 14496-16:2011/Amd.2:2014(E) COPYRIGHT PROTECTED DOCUMENT ISO/IEC 2014 All rights reserved. Unless otherwise specified, no part of this publication may be reproduced or utilized otherwise in any form or by any means, electronic or mechanical, including

7、 photocopying, or posting on the internet or an intranet, without prior written permission. Permission can be requested from either ISO at the address below or ISOs member body in the country of the requester. ISO copyright office Case postale 56 CH-1211 Geneva 20 Tel. + 41 22 749 01 11 Fax + 41 22

8、749 09 47 E-mail copyrightiso.org Web www.iso.org ii ISO/IEC 2014 All rights reservedAmendment 2:2015 (IDT) toCAN/CSA-ISO/IEC 14496-16:13ISO/IEC 14496-16:2011/Amd.2:2014(E) ISO/IEC 2014 All rights reserved iiiForeword ISO (the International Organization for Standardization) and IEC (the Internationa

9、l Electrotechnical Commission) form the specialized system for worldwide standardization. National bodies that are members of ISO or IEC participate in the development of International Standards through technical committees established by the respective organization to deal with particular fields of

10、 technical activity. ISO and IEC technical committees collaborate in fields of mutual interest. Other international organizations, governmental and non-governmental, in liaison with ISO and IEC, also take part in the work. In the field of information technology, ISO and IEC have established a joint

11、technical committee, ISO/IEC JTC 1. International Standards are drafted in accordance with the rules given in the ISO/IEC Directives, Part 2. The main task of the joint technical committee is to prepare International Standards. Draft International Standards adopted by the joint technical committee a

12、re circulated to national bodies for voting. Publication as an International Standard requires approval by at least 75 % of the national bodies casting a vote. Attention is drawn to the possibility that some of the elements of this document may be the subject of patent rights. ISO and IEC shall not

13、be held responsible for identifying any or all such patent rights. Amendment 2 to ISO/IEC 14496-16:2011 was prepared by Joint Technical Committee ISO/IEC JTC 1, Information technology, Subcommittee SC 29, Coding of audio, picture, multimedia and hypermedia information. Amendment 2:2015 (IDT) to CAN/

14、CSA-ISO/IEC 14496-16:13ISO/IEC 14496-16:2011/Amd.2:2014(E) ISO/IEC 2014 All rights reserved 1Information technology Coding of audio-visual objects Part 16: Animation Framework eXtension (AFX) AMENDMENT 2: Multi-resolution 3D mesh compression Add 5.2.6: 5.2.6 Multi-Resolution 3D Mesh Coding Multi-Res

15、olution 3D Mesh Coding (MR3DMC) specifies a progressive compression approach for manifold triangular 3D meshes providing efficient rate-distortion performances and supporting the following functionalities: - Lossless connectivity coding: retrieve the original connectivity with a possible permutation

16、 of the mesh vertices/triangles. - Spatial scalability: the mesh resolution (i.e. the number of triangles/vertices) is adapted to the terminal rendering performances and to the available bandwidth. - Quality scalability: the precision of coordinates/attributes is progressively refined as the bitstre

17、am is decoded. - Near-lossless encoding of the geometry/attributes: the maximal error permitted, when the entire bitstream is decoded, is controlled by varying a set of encoder parameters. 5.2.6.1 MR3DMC Bistream structure The MR3DMC stream describes a multi-resolution representation of any triangul

18、ar mesh stored as an IndexedFaceSet, with single or multiple attributes defined per vertex of per triangle. The stream is decoded in a coarse-to-fine way by exploiting a set of spatial and quality levels of detail (LODs). The bitstream is composed of two main components (cf. Figure AMD1.1): - The he

19、ader: describing general information about the coded mesh. - The data stream: describing the mesh LODs. Amendment 2:2015 (IDT) to CAN/CSA-ISO/IEC 14496-16:13ISO/IEC 14496-16:2011/Amd.2:2014(E) 2 ISO/IEC 2014 All rights reservedFigure AMD1.1 MR3DMC stream structure The MR3DMCStream is encapsulated in

20、 an AFX stream and has the following AFX object code: Table AMD1.1 AFX object code AFX object code Object Associated node Type value of bitwrapper 0x0C Multi-Resolution 3D Mesh IndexedFaceSet 2 When used in a BIFS scene, the value of the field “type“ is 2. 5.2.6.2 MR3DMC Bitstream syntax and semanti

21、cs 5.2.6.2.1 MR3DMC Bistream structure 5.2.6.2.1.1 Syntax class MR3DMCStream MR3DMCStreamHeader header; MR3DMCStreamData data; 5.2.6.2.1.2 Semantics header: This is the header buffer of MR3DMC. data: This is the data buffer of MR3DMC. 5.2.6.2.2 MR3DMCStreamHeader class 5.2.6.2.2.1 Syntax class MR3DM

22、CStreamHeader unsigned int (32) streamSize; Amendment 2:2015 (IDT) to CAN/CSA-ISO/IEC 14496-16:13ISO/IEC 14496-16:2011/Amd.2:2014(E) ISO/IEC 2014 All rights reserved 3bit (8) simplificationMode; bit (16) numberOfSpatialLODs; float (32) creaseAngle; bit (1) ccw; bit (1) solid; bit (1) convex; bit (1)

23、 colorPerVertex; bit (1) normalPerVertex; bit (1) otherAttributesPerVertex; bit (1) isTriangularMesh; bit (1) markerBit / always set as 1 unsigned int (32) numberOfCoord; unsigned int (32) numberOfNormal unsigned int (32) numberOfTexCoord; unsigned int (32) numberOfColor; unsigned int (32) numberOfO

24、therAttributes; unsigned int (32) maxNumberOfVerticesInPatch if (numberOfOtherAttributes 0) unsigned int (8) dimensionOfOtherAttributes; if (numberOfCoord0) unsigned int (32) numberOfCoordIndex; bit(8) QPforGeometry; if (numberOfNormal0) bit(8) QPforNormal; if (numberOfColor0) bit(8) QPforColor; if

25、(numberOfTexCoord0) bit(8) QPforTexCoord; if (numberOfOtherAttributes 0) bit(8) QPforOtherAttributes if (numberOfCoord0) for(i=0;i0) for (i=0;i0) for(i=0;i0) for(i=0;i0) for(i=0;i 0 ) numberOfRefinedVerticescc+; 5.2.6.2.6.2 Semantics connectivityCurrentLOD: A TFANIndexDecoder stream (cf. 5.2.5.3.9s)

26、 describing the connectivity of the current spatial LOD. decodedVertexMapping: A bitstream of type IntArrayDecoder specifying for each vertex of the previous LOD its index the current one. numberOfConnectivitySymbols: An array of 32 bit unsigned integer specifying the number of connectivity symbols,

27、 which represent the valences of refined vertices or null in the current spatial LOD for each connected component. conquestMode: A 8-bit unsigned integer indicating conquest strategy in the current spatial LOD. Amendment 2:2015 (IDT) to CAN/CSA-ISO/IEC 14496-16:13ISO/IEC 14496-16:2011/Amd.2:2014(E)

28、8 ISO/IEC 2014 All rights reservedTable AMD1.3 MR3DMC conquest modes conquestMode Method 0 Decimating Conquest 1 Cleaning Conquest 2-255 ISO reserved valenceOfRefinedVertices: An array of integer describing the valences of inserted vertices or null symbols in order to refine the previous spatial LOD

29、. numberOfRefinedVertices: An array of 32-bit unsigned integer indicating the number of the refined vertices for each spatial LOD 5.2.6.2.7 QualityLODDecoder class 5.2.6.2.7.1 Syntax class QualityLODDecoder QualityLODHeader qualityLODMR3DMCHeader QualityLODData qualityLODMR3DMCData 5.2.6.2.7.2 Seman

30、tics qualityLODHeader: Header buffer specifying the current quality LOD properties. qualityLODData: A QualityLODData stream describing the compressed predicted approximation errors associated with the current quality LOD vertices (cf. Annex U.7) 5.2.6.2.8 QualityLODHeader class 5.2.6.2.8.1 Syntax cl

31、ass QualityLODHeader if (qualityLODEncodingStrategy = 0 ) bits(8) numberOfCurrentQPLayer; bits(32) numberOfVerticesOfCurrentQualityLOD; 5.2.6.2.8.2 Semantics numberOfCurrentQPLayer: An 8 bit integer indicating the number of QP layer in the current quality LOD. numberOfVerticesOfCurrentQualityLOD: An

32、 32 bit integer indicating the number of vertices in current quality LOD. Amendment 2:2015 (IDT) to CAN/CSA-ISO/IEC 14496-16:13ISO/IEC 14496-16:2011/Amd.2:2014(E) ISO/IEC 2014 All rights reserved 95.2.6.2.9 QualityLODData class 5.2.6.2.9.1 Syntax class QualityLODData If ( qualityLODEncodingStrategy

33、= 0 ) for ( j=0; j 5, the factors MF remain unchanged but the 2qbits increases by a factor 2 for each increment of 6 in QP. Amendment 2:2015 (IDT) to CAN/CSA-ISO/IEC 14496-16:13ISO/IEC 14496-16:2011/Amd.2:2014(E) 24 ISO/IEC 2014 All rights reservedTable U.1 Quantization Step in cascaded quantization

34、 QP 0 1 2 3 4 5 6 7 Qstep 0.625 0.6875 0.8125 0.875 1 1.125 1.25 1.375 QP 8 9 10 11 12 13 14 . Qstep 1.625 1.75 2 2.25 2.5 2.75 3.25 . Figure U.5 illustrates the quantization process for a given quality LOD to support SNR scalability functionality. Figure U.5 An illustration of quantization assignme

35、nt for each quality LOD in a given spatial LOD. U.8.2 Bit plane coding Let y denote an n-dimensional vector, which consists of the tangential components or the transform coefficients for the normal components. We first obtain the quantized vector y by uniformly quantizing each element in y with m bi

36、ts. Then, y can be represented by m bit planes with additional sign bits. Figure U.6 shows an example, in which a 9-dimensional vector is represented by five bit planes. In general, the bit planes form an m n array. The bits within the array are encoded with a context-based arithmetic coder in the r

37、aster scan order from the most significant bit (MSB) planes to the least significant bit (LSB) planes. The bits are classified into two clusters. In each column, the bits from the MSB to the first 1 bit compose the first cluster, while the other bits compose the second cluster. Most bits in the firs

38、t cluster are 0, especially when represents a coefficient vector whose energy is compacted into a small number of coefficients. The bits in the first cluster are further classified into m classes according to their bit planes, since more significant bit planes have higher probabilities for 0 bit. Th

39、us, the m classes, composing the first cluster, have different bit distributions, and hence they are encoded using different contexts. On the other hand, 0 and 1 are almost equally likely in the second cluster. Thus, the bits in the second cluster are encoded with a separate context. Moreover, after

40、 encoding the first 1 bit in each column, the corresponding sign bit is encoded using another context. In total, we employ m + 2 contexts. In Figure U.6, colors represent different contexts. yAmendment 2:2015 (IDT) to CAN/CSA-ISO/IEC 14496-16:13ISO/IEC 14496-16:2011/Amd.2:2014(E) ISO/IEC 2014 All ri

41、ghts reserved 25Figure U.6 Bit plane coding, where different colors denote different contexts. U.9 Connectivity Coding for Multi-Resolution 3D Mesh In the multi-resolution 3d mesh compression, a simplification process is generally used to obtain the LODs. The simplification method affects the compre

42、ssion performance of connectivity data as well as that of the geometry data, since vertex positions are predicatively encoded based on the mesh topology at each layer. We propose an simplification method for efficient connectivity compression performance. U.9.1 Patch-Based Simplification Our approac

43、h is based on the simplification method of Alliez and Desburn 96 and let us briefly explain their algorithm. Their method performs a sequence of patch-based vertex removals and the connectivity data are represented as removed vertices valences. From an arbitrary edge, it expands the processed region

44、 repeatedly while marking removed vertices and conquering the corresponding patches. Specifically, a boundary edge of the processed region is called a gate. The unprocessed vertex in front of the gate is referred to as the front vertex, and the front vertex and its adjacent vertices form a patch. Th

45、eir method removes the front vertex, retriangulates the patch, and tags newly processed vertices as or as shown in Fig. U.7. If the front vertex has valence equal to or larger than 7, it is not removed and a null patch is declared. After the retriangulation, their method pushes new boundary edges in

46、to the gate queue to conquer other patches later. In this way, the encoder conquers all vertices and faces, and records the valences of front vertices and the symbols for null patches for the connectivity coding. The simplification process is carried out by alternating the decimating conquest and the cleaning conquest: the former removes vertices with valences 3 6, whereas the latter removes valence-3 vertices only. Amendment 2:2015 (IDT) to CAN/CSA-ISO/IEC 14496-16:13

copyright@ 2008-2019 麦多课文库(www.mydoc123.com)网站版权所有
备案/许可证编号:苏ICP备17064731号-1