Abstract:
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.
Abstract:
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 C 1,k, where C 1,k denotes the k th 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 /, 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 / and regenerating the three dimensional mesh model, if the lowest layer of non-empty-child-cells has been reached.
Abstract:
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 5 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 ⊂10 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.
Abstract:
In 3D mesh coding, the geometry data is compressed by spatial tree based approaches. Bitstreams that result from the traversal of a tree structure of spatial tree based approaches for encoding 3D mesh models have systematically special redundancies, which is exploited for further improving the mesh model compression. A method for encoding a bitstream comprises steps of defining (51) at least a first and a second symbol group of binary symbols, with S1 being a subset of S2, determining (52) within the bitstream first portions (J1,J2), second portions (K1) and third portions (N1,N2,N3), wherein first portions have Th1 or more consecutive S1 symbols and second portions have Th2 or more consecutive S2 symbols, encoding (54) the bitstream, wherein first portions, second portions and third portions are encoded (54A,54B,54C) using different codes, and encoding (55) values (C 1 ) indicating the boundary positions between the first, second and third portions in the bitstream.
Abstract:
A method for multi-level repetitive structure identification in a 3D model and methods for encoding and decoding 3D model based on such multi-level repetitive structures are described. Repetitive structures in the 3D model are identified to increase the compression ratio by reducing the redundancy among the instance components. Multi-level repetitive structures are extracted from a 3D model by first extracting a first-level repetitive structure, based on which second-level repetitive structures are extracted. "Pattern-instance" representation is used to represent the repetitive structure in an embodiment of the present invention. Connected components are examined in the first-level repetitive structure extraction. Parts of the connected components in the patterns and unique components of the first-level repetitive structures are examined to extract the second-level repetitive structure. Encoding of a 3D model is performed by encoding the multi-level repetitive structure, whereby stitching information is calculated for instance components to avoid misalignment at the boundary of components.
Abstract:
A 3D model can be modeled using "pattern-instance?representation. To describe the vertices and triangles, properties of the instance, for example, texture, color, and normal, are adjusted to correspond to the order in the pattern. The texture of an instance is encoded depending on its similarity with the texture of a corresponding pattern. When instance texture is identical or almost identical to the pattern texture, the instance texture is not encoded and the pattern texture will be used to reconstruct the instance texture. When the instance texture is similar to the pattern texture, the instance texture is predictively encoded from the pattern texture, that is, the difference between the instance texture and pattern texture is encoded, and the instance texture is determined as a combination of the pattern texture and the difference.
Abstract:
De-noising an image by Anisotropic Gradient Regulation commences by first choosing edge directions for the image. Thereafter, an anisotropic gradient norm is established for the image from anisotropic gradient norms along the selected edge directions. The image pixels undergo adjustment to minimize the anisotropic gradient norm for the image, thereby removing image noise.
Abstract:
The invention is made in the field of encoding and decoding of rotational data. In particular, the invention is concerned with encoding and decoding of rotational data for rotational transformation of a template of an object into an instance of the object. When quantizing such rotational data for encoding, precision of the quantized rotational data differently impacts quality of a reproduction. This is compensated by the proposed method which comprises using a processor for executing the steps of determining a size of the instance, and using the determined size for determining a quantization parameter for quantizing said rotational data, using the quantization parameter for quantizing the rotational data, and encoding the quantized rotational data and data referencing the template.
Abstract:
Typically, 3D meshes are represented by three types of data: connectivity data, geometry data and property data. An encoded 3D mesh model can be represented, transmitted and/or stored as a bitstream. While the bitstream embeds all the transformation data, it is efficient and may address several applications, where sometimes either bitstream size or decoding efficiency or error resilience matters the most. Therefore, two mode options are disclosed for how to put the transformation data of one instance, i.e. its position, orientation and scaling factor, in the bitstream. In the first mode, the position, orientation and possible scaling factor of one instance are packed together in the bitstream. In the second mode, transformation data types, for example, the positions, orientations or possible scaling factors of all instances are packed together according to the data type in the bitstream.
Abstract:
Methods and apparatuses for image abstraction are described. Image regularization is employed to address the image abstraction by minimizing a function of the input image under various constraints. A selective structure preservation constraint can be employed to preserve the important structure of the input image. A rescale multiplier can be further added to maintain or even exaggerate the luminance transition across the real boundaries of objects in the image. A roughly abstracted image can also be introduced into the constraints to keep the number of luminance levels of the abstracted image low. The function of the image is built using the gradient image of the input image. The image abstraction can be extended and applied to video abstraction.