摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
A 3D model can be modeled using pattern-instance representation, wherein an instance component may be represented as transformation (for example, rotation, translation, and scaling) of a pattern. Quantization errors may be introduced when encoding rotation information, causing different vertex coordinate errors at different vertices of an instance. To efficiently compensate the vertex coordinate errors, an upper bound can be estimated for the vertex coordinate error of a vertex. Based on the upper bound, the codec decides whether the vertex coordinate error of the vertex needs to be compensated, and decides a quantization parameter for compensating the vertex coordinate error if compensation is needed. The upper bound can be estimated at both the encoder and decoder, and thus, no explicit signaling is needed to indicate whether vertex coordinate error compensation is used or to indicate the quantization parameter for the vertex coordinate error.