METHODS AND APPARATUS FOR REFLECTIVE SYMMETRY BASED 3D MODEL COMPRESSION
    1.
    发明申请
    METHODS AND APPARATUS FOR REFLECTIVE SYMMETRY BASED 3D MODEL COMPRESSION 审中-公开
    基于反射对称的3D模型压缩的方法和装置

    公开(公告)号:US20140320492A1

    公开(公告)日:2014-10-30

    申请号:US14356668

    申请日:2011-11-25

    IPC分类号: G06T17/10 G06T15/00

    摘要: Encoders and decoders, and methods of encoding and decoding, are provided for rendering 3D images. The 3D images are decomposed by analyzing components of the 3D images to match reflections of patterns in the 3D images, and to restore the components for further rendering of the 3D image. The encoders and decoders utilize principles of reflective symmetry to effectively match symmetrical points in an image so that the symmetrical points can be characterized by a rotation and translation matrix, thereby reducing the requirement of coding and decoding all of the points in 3D image and increasing computational efficiency.

    摘要翻译: 编码器和解码器以及编码和解码方法被提供用于渲染3D图像。 3D图像通过分析3D图像的组件来分解,以匹配3D图像中图案的反射,并恢复组件以进一步渲染3D图像。 编码器和解码器利用反射对称的原理来有效地匹配图像中的对称点,使得对称点可以通过旋转和平移矩阵来表征,从而减少对3D图像中的所有点的编码和解码的需求,并增加计算 效率。

    METHOD FOR SETTING AND DETERMINING DIRECTIONS OF PRINCIPAL AXES OF 3D OBJECT
    2.
    发明申请
    METHOD FOR SETTING AND DETERMINING DIRECTIONS OF PRINCIPAL AXES OF 3D OBJECT 审中-公开
    用于设置和确定3D对象主轴方向的方法

    公开(公告)号:US20150009211A1

    公开(公告)日:2015-01-08

    申请号:US14376156

    申请日:2012-02-03

    IPC分类号: G06T15/00

    CPC分类号: G06T15/00 G06T7/70 G06T19/00

    摘要: The invention provides a method for setting the directions of principal axes of a 3D object is provided. The method comprises: for each of any two principal axes, setting the direction of the principal axis according to at least one predefined function, with which the result calculated of the 3D object for the vertices in the positive half space of the principal axis is smaller than or equal to the result for the vertices in the negative half space of the principal axis, wherein a vertex in the positive half space of the principal axis means the one with a coordinate of the principal axis larger than 0, and a vertex in the negative half space of the principal axis means the one with a coordinate of the axis smaller than 0; setting the direction of the third principal axis of to follow the right-hand rule with said two principal axes, wherein the vector for the third axis is the cross product of the vectors for said two principal axes; and displaying a signal of the 3D object with the directions of the principal axes set according to the above steps.

    摘要翻译: 本发明提供了一种设置3D对象主轴方向的方法。 该方法包括:对于任何两个主轴中的每一个,根据至少一个预定义的功能来设定主轴的方向,利用该预定义函数计算主轴的正半空间中顶点的3D对象的结果较小 大于或等于主轴的负半空间中的顶点的结果,其中主轴的正半空间中的顶点是指主轴的坐标大于0的顶点,以及 主轴的负半空间是指轴小于0的坐标轴; 将所述第三主轴的方向设置为与所述两个主轴遵循右手规则,其中所述第三轴的向量是所述两个主轴的向量的交叉乘积; 以及根据上述步骤,按照主轴的方向显示3D对象的信号。

    POSITION CODING BASED ON SPATIAL TREE WITH DUPLICATE POINTS
    3.
    发明申请
    POSITION CODING BASED ON SPATIAL TREE WITH DUPLICATE POINTS 审中-公开
    基于具有双重点的空间树的位置编码

    公开(公告)号:US20140324914A1

    公开(公告)日:2014-10-30

    申请号:US14356748

    申请日:2011-11-25

    IPC分类号: G06F17/30

    摘要: A method and an apparatus for constructing a spatial tree data structure corresponding to a region. According to the present principles, a cell may include therein a point or a set of points that are determined to be duplicate points. In an embodiment the duplicate points are determined based on the size of the points included within the cell The inclusion of duplicate points within a particular cell, rather than further subdividing the cell, provides coding efficiency. The present principles are particularly advantageous in the context of quadtree or octree type partitioning, and may be used in 3D mesh coding.

    摘要翻译: 一种用于构建对应于区域的空间树数据结构的方法和装置。 根据本原理,单元格可以包括确定为重复点的点或一组点。 在一个实施例中,根据包含在小区内的点的大小来确定重复点。在特定小区内包括重复点,而不是进一步细分小区,提供编码效率。 本原理在四叉树或八叉树类型分割的上下文中是特别有利的,并且可以用于3D网格编码。

    Position coding based on spatial tree with duplicate points

    公开(公告)号:US10592490B2

    公开(公告)日:2020-03-17

    申请号:US14356748

    申请日:2011-11-25

    摘要: A method and an apparatus for constructing a spatial tree data structure corresponding to a region. According to the present principles, a cell may include therein a point or a set of points that are determined to be duplicate points. In an embodiment the duplicate points are determined based on the size of the points included within the cell. The inclusion of duplicate points within a particular cell, rather than further subdividing the cell, provides coding efficiency. The present principles are particularly advantageous in the context of quadtree or octree type partitioning, and may be used in 3D mesh coding.

    SYSTEM AND METHOD FOR ERROR CONTROLLABLE REPETITIVE STRUCTURE DISCOVERY BASED COMPRESSION
    5.
    发明申请
    SYSTEM AND METHOD FOR ERROR CONTROLLABLE REPETITIVE STRUCTURE DISCOVERY BASED COMPRESSION 审中-公开
    基于错误可控重复结构发现的系统和方法的压缩

    公开(公告)号:US20140340393A1

    公开(公告)日:2014-11-20

    申请号:US14374949

    申请日:2012-02-03

    IPC分类号: G06T9/00

    摘要: A method and an apparatus for 3D model compression are described. Repetitive structures in the 3D model are identified to increase the compression ratio by reducing the redundancy among the instance components. The instance components can be expressed in a “pattern-instance” representation and a decision is made as to whether to compress the “pattern-instance” representation for the 3D model. For those instance components that are determined to be encoded in “pattern-instance” representation, a verification process is employed to examine the decoding error of the instance components. If the decoding error is below a threshold value, the instance components are compressed in the “pattern-instance” representation. Otherwise, a different encoding mode is used to compress the instance components.

    摘要翻译: 描述了用于3D模型压缩的方法和装置。 识别3D模型中的重复结构,通过减少实例组件之间的冗余来增加压缩比。 实例组件可以用“模式实例”表示来表示,并且决定是否压缩3D模型的“模式实例”表示。 对于被确定为以“模式实例”表示形式编码的那些实例组件,采用验证过程来检查实例组件的解码错误。 如果解码错误低于阈值,则在“模式实例”表示中压缩实例组件。 否则,使用不同的编码模式来压缩实例组件。

    METHODS FOR COMPENSATING DECODING ERROR IN THREE-DIMENSIONAL MODELS
    6.
    发明申请
    METHODS FOR COMPENSATING DECODING ERROR IN THREE-DIMENSIONAL MODELS 审中-公开
    用于在三维模型中补偿解码错误的方法

    公开(公告)号:US20150016742A1

    公开(公告)日:2015-01-15

    申请号:US14378334

    申请日:2012-02-20

    IPC分类号: G06T9/00

    摘要: Encoders compress 3D images and compensate for decoding error using instance component decoders which decode instance components of the 3D image to generate decoded instance components, error calculation units which compare the decoded instance components with corresponding uncompressed instance components to calculate decoding errors, and determination units which determine if the encoded components pass a verification according to a threshold based on the decoding errors.

    摘要翻译: 编码器压缩3D图像并使用解码3D图像的实例组件的实例组件解码器来补偿解码错误,以生成解码的实例组件,将解码的实例组件与相应的未压缩实例组件进行比较以计算解码错误的误差计算单元,以及确定单元 基于解码错误,确定编码的组件是否根据阈值通过验证。

    Method and apparatus for generating a bitstream of repetitive structure discovery based 3D model compression

    公开(公告)号:US09898834B2

    公开(公告)日:2018-02-20

    申请号:US14356737

    申请日:2011-11-25

    IPC分类号: G06T9/00 H04N19/70

    CPC分类号: G06T9/001 H04N19/70

    摘要: A method and apparatus for generating a bitstream representative of a 3D model, and a method and an apparatus for processing the same. A 3D model is modeled by using a using a ‘pattern-instance’ representation, wherein a pattern is a representative geometry of a repetitive structure, and the connected components belonging to the repetitive structure is call an instance of the corresponding pattern. After discovery of the repetitive structures and their transformations and properties, the present embodiments provide for generating a bitstream in either a first format or a second format. In the first format, the pattern ID and its associated transformation and property information are grouped together in the bitstream, and in the second format the pattern ID, transformation property and property information are grouped together according to information type.

    Hierarchical entropy encoding and decoding
    8.
    发明授权
    Hierarchical entropy encoding and decoding 有权
    分层熵编码和解码

    公开(公告)号:US09035807B2

    公开(公告)日:2015-05-19

    申请号:US14240066

    申请日:2011-08-25

    摘要: A particular implementation receives geometry data of a 3D mesh, and represents the geometry data with an octree. The particular implementation partitions the octree into three parts, wherein the symbols corresponding to the middle part of the octree are hierarchical entropy encoded. To partition the octree into three parts, different thresholds are used. Depending on whether a symbol associated with a node is an S1 symbol, the child node of the node is included in the middle part or the upper part of the octree. In hierarchical entropy encoding, a non-S1 symbol is first encoded as a pre-determined symbol ‘X’ using symbol set S2={S1, ‘X’} and the non-S1 symbol itself is then encoded using symbol set S0 (S2⊂S0), and an S1 symbol is encoded using symbol set S2. Another implementation defines corresponding hierarchical entropy decoding. A further implementation reconstructs the octree and restores the geometry data of a 3D mesh from the octree representation.

    摘要翻译: 特定实现接收3D网格的几何数据,并且表示具有八叉树的几何数据。 特定实现将八叉树分割成三部分,其中对应于八叉树的中间部分的符号是分层熵编码的。 为了将八叉树分为三个部分,使用不同的阈值。 根据与节点相关联的符号是否为S1符号,节点的子节点包含在八叉树的中间部分或上部。 在分层熵编码中,首先使用符号集S2 = {S1,'X')将非S1符号编码为预定符号“X”,然后使用符号集S0(S2 ⊂S0),并且使用符号集S2对S1符号进行编码。 另一个实现定义了相应的分层熵解码。 另一个实现重建八叉树,并从八叉树表示恢复3D网格的几何数据。

    Predictive position decoding
    9.
    发明授权

    公开(公告)号:US10032309B2

    公开(公告)日:2018-07-24

    申请号:US14356311

    申请日:2011-11-07

    IPC分类号: G06T17/20 G06T9/00 G06T9/40

    摘要: A method and apparatus for position decoding of three dimensional mesh models are described including predicting a symbol probability of a non-empty-child-cell Cl,k, where Cl,k denotes the kth cell at layer l, wherein the symbol probability is estimated based on an accuracy of a fitted plane P, decoding the non-empty-child-cell responsive to the received predicted probability of the non-empty-child-cell, subdividing the non-empty-child-cell, if the non-empty-child-cell has more than one vertex, determining if there are more unprocessed non-empty-child-cells at layer l, determining if a lowest layer of non-empty-child-cells has been reached, if there are no more unprocessed non-empty-child-cells at layer l and regenerating the three dimensional mesh model, if the lowest layer of non-empty-child-cells has been reached.