公开(公告)号：WO2010089380A1

公开(公告)日：2010-08-12

申请号：PCT/EP2010/051443

申请日：2010-02-05

Applicant: THOMSON LICENSING ,  CHEN, Quqing ,  CAI, Kangying ,  TENG, Jun

Inventor： CHEN, Quqing ,  CAI, Kangying ,  TENG, Jun

IPC: G06T9/00 ,  H04N7/26 ,  H04N7/32 ,  H04N7/34

CPC classification number: G06T9/001 ,  G06T9/004

Abstract: 3D mesh models are widely used in various applications for representing 3D objects. These models are made of vertices and corresponding triangles, which can be compressed based on prediction and residuals. The present invention improves the accuracy of parallelogram prediction, particularly near sharp features. The proposed 3D mesh model encoding comprises analyzing the spatial or dihedral angles between triangles, clustering triangles with similar or equal dihedral angles, and defining a representative dihedral angle for each cluster. Triangles of each cluster are then encoded relative to individual prediction triangles having the representative dihedral angle according to the cluster. Additionally, the prediction triangle may be mirrored. An indication of the encoding mode is inserted into each vertex of the encoded bitstream. A decoder extracts the encoding mode indication, reconstructs the individual prediction triangles based on the respective representative dihedral angles and performs triangle prediction and reconstruction.

Abstract translation: 3D网格模型广泛用于表示3D对象的各种应用中。 这些模型由顶点和相应的三角形组成，可以根据预测和残差进行压缩。 本发明提高了平行四边形预测的精度，特别是在尖锐特征附近。 所提出的3D网格模型编码包括分析三角形之间的空间或二面角，具有相似或相等二面角的聚类三角形，并为每个簇定义代表性的二面角。 然后，相对于根据簇的具有代表性的二面角的各个预测三角形对每个簇的三角形进行编码。 另外，预测三角形可以被镜像。 将编码模式的指示插入编码比特流的每个顶点。 解码器提取编码模式指示，基于相应的代表性二面角重建各个预测三角形，并执行三角形预测和重构。

公开(公告)号：WO2010115790A1

公开(公告)日：2010-10-14

申请号：PCT/EP2010/054259

申请日：2010-03-30

Applicant: THOMSON LICENSING ,  CHEN, Quqing ,  CAI, Kangying ,  CHEN, Zhibo ,  TENG, Jun

Inventor： CHEN, Quqing ,  CAI, Kangying ,  CHEN, Zhibo ,  TENG, Jun

IPC: H03M5/14

CPC classification number: H03M5/14 ,  H03M7/30

Abstract: The invention is made in the technical field of encoding and decoding of bit sequences. The invention proposes a device for compression-encoding an input bit sequence (IBS) in which Zeroes and Ones occur equally frequent, comprising an XOR gate (XOR) adapted for receiving pairs of immediately succeeding bits of the input bit sequence (IBS) as inputs and for outputting further bits of an other bit sequence (OBS), means for adding a bit to said other bit sequence (OBS) wherein the added bit is a primary bit which is equal to a primary bit of the input bit sequence (IBS) or a last bit which is equal to a last bit of the input bit sequence (IBS), and means for encoding the other sequence. The XOR gate (XOR) transforms the input bit sequence (IBS) into the other bit sequence (OBS) which comprises more uneven frequencies of occurrence of Zeroes and Ones than the input bit sequence (IBS).

Abstract translation: 本发明是在比特序列的编码和解码的技术领域中进行的。 本发明提出了一种用于压缩编码其中零和等于频繁出现的输入比特序列（IBS）的装置，包括适于将输入比特序列（IBS）的紧随其后的比特对作为输入的XOR门（XOR） 并且为了输出其他比特序列（OBS）的其他比特，用于将比特加到所述另一比特序列（OBS）的装置，其中所述相加比特是等于所述输入比特序列（IBS）的主比特的主比特， 或等于输入比特序列（IBS）的最后一位的最后一位，以及用于对其他序列进行编码的装置。 异或门（XOR）将输入比特序列（IBS）转换为比输入比特序列（IBS）更多的不均匀出现零和零的频率的比特序列（OBS）。

公开(公告)号：WO2010115789A1

公开(公告)日：2010-10-14

申请号：PCT/EP2010/054257

申请日：2010-03-30

Applicant: THOMSON LICENSING ,  CHEN, Quqing ,  CAI, Kangying ,  CHEN, Zhibo ,  TENG, Jun

Inventor： CHEN, Quqing ,  CAI, Kangying ,  TENG, Jun

IPC: G06T9/00 ,  H04N7/26 ,  H03M7/46

CPC classification number: G06T9/001 ,  G06T9/005 ,  H03M7/30 ,  H04N19/91

Abstract: A method for compressing a symbol sequence, wherein each symbol may have one out of three or more possible symbol values, said method comprises the steps of modifying the symbol sequence by replacing each run pair, which contains a first run of symbols of a most frequent symbol value and a second run of symbols of a second most frequent symbol value, by a further symbol value not comprised in the three or more possible symbol values, generating a binary sequence comprising all replaced run pairs and compression encoding the binary sequence and the modified symbol sequence.

Abstract translation: 一种用于压缩符号序列的方法，其中每个符号可以具有三个或更多个可能的符号值中的一个，所述方法包括以下步骤：通过替换每个运行对来修改符号序列，每个运行对包含最频繁的符号的第一行 符号值和第二最常用符号值的符号的第二次运行，通过未包括在三个或更多个可能的符号值中的另外的符号值，生成包括所有替换的运行对的二进制序列和对二进制序列进行压缩编码和经修改的 符号序列。

公开(公告)号：WO2011130874A1

公开(公告)日：2011-10-27

申请号：PCT/CN2010/000537

申请日：2010-04-20

Applicant: THOMSON LICENSING ,  CHEN, Quqing ,  TENG, Jun ,  CHEN, Zhibo

Inventor： CHEN, Quqing ,  TENG, Jun ,  CHEN, Zhibo

IPC: H04N7/26

CPC classification number: H04N19/27 ,  G06T9/00 ,  G06T15/005 ,  H04N19/70

Abstract: The invention is made in the field of image codec products. More precisely, the invention relates to encoding and decoding of data for image rendering using computer graphics. A method for decoding data for rendering at least one image using computer graphics is proposed, said method comprising decoding a portion of a bit stream, said portion comprising a syntax element and at least one parameter for a parameter based procedural computer graphics generation method for generating said computer graphics, said syntax element indicating that said portion further comprises said at least one parameter. Further, an apparatus for performing said method is proposed.

Abstract translation: 本发明是在图像编解码产品领域进行的。 更准确地说，本发明涉及使用计算机图形进行图像渲染的数据的编码和解码。 提出了一种用于使用计算机图形来渲染至少一个图像的数据的方法，所述方法包括解码比特流的一部分，所述部分包括语法元素和用于基于参数的程序计算机图形生成方法的至少一个参数，用于生成 所述计算机图形，所述语法元素指示所述部分还包括所述至少一个参数。 此外，提出了一种用于执行所述方法的装置。

公开(公告)号：WO2010018138A1

公开(公告)日：2010-02-18

申请号：PCT/EP2009/060284

申请日：2009-08-07

Applicant: THOMSON LICENSING ,  AN, Jicheng ,  CHEN, Quqing ,  CHEN, Zhibo ,  TENG, Jun

Inventor： AN, Jicheng ,  CHEN, Quqing ,  CHEN, Zhibo ,  TENG, Jun

IPC: H04N7/26 ,  H04N7/50

CPC classification number: H04N19/176 ,  H04N19/103 ,  H04N19/149 ,  H04N19/15 ,  H04N19/18 ,  H04N19/194 ,  H04N19/91 ,  H04N19/93

Abstract: In known image compression, following quantisation, a very sparse distribution of significant (i.e. non-zero) amplitude coefficients of the transformed image signal may be obtained while most quantised coefficients are zeros. A costly task for a transform-based image compression in terms of resulting overall data rate is to record the locations of such significant coefficients within the coding blocks. In quartation processing, a 'significant square' (containing at least one non-zero amplitude coefficient in the coefficient block) is recursively divided into four smaller squares until single significant coefficients are reached, and the significance statuses of all generated squares are encoded. However, for some distribution patterns encoding the x-y-coordinates of the significant coefficients as binary numbers will lead to less coding cost. According to the invention, at least four different pattern determination or encoding modes are checked, and the encoding side selects the least costly one of these modes and transfers the corresponding mode information to the decoding side for corresponding decoding.

Abstract translation: 在已知的图像压缩中，在量化之后，可以获得变换图像信号的显着（即非零）振幅系数的非常稀疏的分布，而大多数量化的系数是零。 在所得到的总体数据速率方面，用于基于变换的图像压缩的昂贵任务是记录这些重要系数在编码块内的位置。 在四次分组处理中，将“显着平方”（包含系数块中的至少一个非零幅度系数）递归地划分为四个较小的正方形，直到达到单个有效系数，并且编码所有生成的正方形的显着状态。 然而，对于将有效系数的x-y坐标编码为二进制数的一些分布模式将导致较少的编码成本。 根据本发明，检查至少四种不同的图案确定或编码模式，并且编码方选择这些模式中最便宜的一种模式，并将相应的模式信息传送到解码端用于相应的解码。

公开(公告)号：WO2011066672A1

公开(公告)日：2011-06-09

申请号：PCT/CN2009/001369

申请日：2009-12-04

Applicant: THOMSON LICENSING ,  CHEN, Zhibo ,  XU, Xiaozhong ,  CHEN, Quqing

Inventor： CHEN, Zhibo ,  XU, Xiaozhong ,  CHEN, Quqing

IPC: H04N7/50

CPC classification number: H04N19/14 ,  H04N19/119 ,  H04N19/122 ,  H04N19/176 ,  H04N19/46

Abstract: The invention is related to encoding an image block of an image using a partitioned block transform. The inventors recognized that applying a texture-pattern associated invertible mapping to the pixels of a first partition, said first partition resulting from partitioning said image block according to a current texture pattern with which said texture-pattern associated invertible mapping is associated, allows for limiting the maximum number of required first 1-D transforms to not exceeding a number of columns in the image block as well as limiting the maximum number of required second 1-D transforms to not exceeding a number of rows in the image block, also. Achieving limitation of maximum required 1-D transforms enables more efficient implementation on hardware and improves encoding performance but also allows for further partitions according to texture patterns which comprise at least one of multiple strips, texture patterns with highly unsymmetrical pixel distribution and non-directional texture patterns.

Abstract translation: 本发明涉及使用分区块变换对图像的图像块进行编码。 本发明人认识到，将纹理图案相关联的可逆映射应用于第一分区的像素，所述第一分区根据与所述纹理图案相关联的可逆映射相关联的当前纹理图案分割所述图像块，导致限制 所需的第一个1-D的最大数量变换为不超过图像块中的列数，并且将所需的第二个1-D变换的最大数量限制为不超过图像块中的行数。 实现最大需要的1-D变换的限制使得能够在硬件上更有效地实现并提高编码性能，并且还允许根据纹理图案进一步分割，其包括多个条带中的至少一个，具有高度不对称像素分布的纹理图案和非定向纹理 图案。

公开(公告)号：WO2008128380A1

公开(公告)日：2008-10-30

申请号：PCT/CN2007/001297

申请日：2007-04-20

Applicant: THOMSON LICENSING ,  CHEN, Quqing ,  CHEN, Zhibo ,  GU, Xiaodong

Inventor： CHEN, Quqing ,  CHEN, Zhibo ,  GU, Xiaodong

IPC: H04N7/26

CPC classification number: H04N19/93 ,  H04N19/102 ,  H04N19/12 ,  H04N19/14 ,  H04N19/176 ,  H04N19/61 ,  H04N19/91

Abstract: International image or video coding standards uses hybrid coding, wherein a picture is separated into pixel blocks on which predictive coding, transform coding and entropy coding is employed. The transform coding is effective because the prediction error samples are correlated in the frequency domain. However, when the prediction quality is getting better and better, spatial domain coding becomes more effective than transform coding. According to the invention, it is first determined in which corner of a current block the first non-zero amplitude value is located. Based on the related zeroes run length value in that block, a pre-defined scan path is selected, i.e. a context-based adaptive scan mode is used.

Abstract translation: 国际图像或视频编码标准使用混合编码，其中将图像分成使用预测编码，变换编码和熵编码的像素块。 变换编码是有效的，因为预测误差样本在频域上是相关的。 然而，当预测质量越来越好时，空间域编码变得比变换编码更有效。 根据本发明，首先确定当前块的哪一个角位于第一非零振幅值。 基于该块中相关的零运行长度值，选择预定义的扫描路径，即使用基于上下文的自适应扫描模式。

公开(公告)号：WO2011029876A1

公开(公告)日：2011-03-17

申请号：PCT/EP2010/063245

申请日：2010-09-09

Applicant: THOMSON LICENSING ,  CHEN, Quqing ,  ZHOU, Tong ,  CHEN, Zhibo

Inventor： CHEN, Quqing ,  ZHOU, Tong ,  CHEN, Zhibo

IPC: H03M7/24 ,  H03M7/30 ,  G06T9/00

CPC classification number: G06T9/001 ,  H03M7/24 ,  H03M7/30 ,  H04N19/423 ,  H04N19/50 ,  H04N19/61 ,  H04N19/70

Abstract: An algorithm for efficiently compressing floating-point data in 3D meshes is disclosed. 3D meshes are represented by topology data, geometry data and property data. Geometry data specify vertex locations and are usually represented by floating-point coordinates. While geometry data are usually compressed by quantization, prediction and entropy coding, the present invention uses no prediction. A floating-point number consists of mantissa and exponent, and normally the exponent, sign and mantissa are compressed separately. A method for encoding floating-point formatted data comprises determining if a current floating-point value was previously stored in a memory, storing the current value in the memory if it was not previously stored in the memory, and encoding it. Otherwise, if the current floating-point value was previously stored in a memory, the storage position of the value within the memory is determined and a reference pointing to the storage position is encoded.

Abstract translation: 公开了一种用于有效压缩3D网格中的浮点数据的算法。 3D网格由拓扑数据，几何数据和属性数据表示。 几何数据指定顶点位置，通常由浮点坐标表示。 虽然几何数据通常通过量化，预测和熵编码进行压缩，但是本发明不使用预测。 浮点数由尾数和指数组成，通常分别压缩指数，符号和尾数。 用于对浮点格式化数据进行编码的方法包括确定当前浮点值是否预先存储在存储器中，如果当前值未预先存储在存储器中并将其编码，则将当前值存储在存储器中。 否则，如果当前浮点值预先存储在存储器中，则确定存储器内的值的存储位置并编码指向存储位置的引用。

公开(公告)号：WO2008128381A1

公开(公告)日：2008-10-30

申请号：PCT/CN2007/001298

申请日：2007-04-20

Applicant: THOMSON LICENSING ,  CHEN, Quqing ,  CHEN, Zhibo ,  GU, Xiadong

Inventor： CHEN, Quqing ,  CHEN, Zhibo ,  GU, Xiadong

IPC: H04N7/26

CPC classification number: G06F17/30858 ,  H04N19/00 ,  H04N19/70 ,  H04N21/23892 ,  H04N21/44008 ,  H04N21/84 ,  H04N21/8451

Abstract: The invention concerns a method for embedding video annotation data into a coded video stream. The method comprises the step of - encapsulating said video annotation data into a unit, so-called video annotation unit, of the coded video data stream which format corresponds to at least one format used for sending the associated video data, - inserting an identifiable synchronizing code enabling the identification of said video annotation unit into the video data stream.

Abstract translation: 本发明涉及一种将视频注释数据嵌入到编码视频流中的方法。 该方法包括以下步骤：将所述视频注释数据封装到编码视频数据流的单元（称为视频注释单元）中，该格式对应于用于发送相关视频数据的至少一种格式， - 插入可识别的同步 能够将所述视频注释单元识别为视频数据流的代码。

公开(公告)号：WO2008043204A1

公开(公告)日：2008-04-17

申请号：PCT/CN2006/002643

申请日：2006-10-10

Applicant: THOMSON BROADBAND R & D (BEIJING) CO., LTD. ,  GU, Xiaodong ,  QIU, Guoping ,  CHEN, Zhibo ,  CHEN, Quqing ,  WANG, Chuanming

Inventor： GU, Xiaodong ,  QIU, Guoping ,  CHEN, Zhibo ,  CHEN, Quqing ,  WANG, Chuanming

IPC: G06T7/00

CPC classification number: G06K9/4642 ,  G06T7/174

Abstract: The invention relates to a method for generating a saliency map for a picture of a sequence of pictures, the picture being divided in blocks of pixels. The method comprises a step for computing a saliency value for each block of the picture. According to the invention, the saliency value equals the self information of the block, the self information depending on the spatial and temporal contexts of the block.

Abstract translation: 本发明涉及一种用于生成图像序列的图像的显着图的方法，该图像被划分为像素块。 该方法包括用于计算图像的每个块的显着值的步骤。 根据本发明，显着性值等于块的自身信息，取决于块的空间和时间上下文的自身信息。