Patent application number | Description | Published |
20140037223 | METHOD AND DEVICE FOR LOSSY COMPRESS-ENCODING DATA AND CORRESPONDING METHOD AND DEVICE FOR RECONSTRUCTING DATA - The invention proposes modification of quantized coefficients for signalling of a post-processing method. Therefore, it is proposed a method for lossy compress-encoding data comprising at least one of image data and audio data. Said method comprises determining quantized coefficients using a quantization of a discrete cosine transformed residual of a prediction of said data. Said method further comprises modifying said quantized coefficients for minimizing rate-distortion cost wherein distortion is determined using a post-processed reconstruction of the data, the post-processed reconstruction being post-processed according to a post | 02-06-2014 |
20140140636 | Anisotropic Gradient Regularization for Image Denoising, Compression, and Interpolation - 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. | 05-22-2014 |
20140146043 | METHOD AND DEVICE FOR ENCODING AN ORIENTATION VECTOR OF A CONNECTED COMPONENT, CORRESPONDING DECODING METHOD AND DEVICE AND STORAGE MEDIUM CARRYING SUCH ENCODED DATA - The invention is made in the field of encoding and decoding at least one orientation vector of a connected component. When quantizing vector components for encoding, an acceptable quantization deviation of encoded vector components sometimes leads to unacceptable deviations of calculated vector components. Therefore, a method is proposed which comprises quantizing and de-quantizing a first and a second component of the vector, and encoding the quantized first and second component and a bit signalling the sign of a third component of said vector, using the pre-determined length and the de-quantized first and second component for determining whether a calculated absolute of an approximation of the third component of said vector is smaller than a first threshold, and, if the calculated absolute is smaller than the first threshold, determining, quantizing and encoding a residual between the calculated absolute of the third component and the absolute of the third component. | 05-29-2014 |
20140160241 | SYSTEM AND METHOD FOR ENCODING AND DECODING A BITSTREAM FOR A 3D MODEL HAVING REPETITIVE STRUCTURE - 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. | 06-12-2014 |
20140184430 | HIERARCHICAL ENTROPY ENCODING AND DECODING - 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. | 07-03-2014 |
20140185668 | METHOD FOR ADAPTIVE ENTROPY CODING OF TREE STRUCTURES - 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 at least a first and a second symbol group of binary symbols, with S1 being a subset of S2, determining within the bitstream first portions, second portions and third portions, wherein first portions have Th1 or more consecutive S1 symbols and second portions have Th2 or more consecutive S2 symbols, encoding the bitstream, wherein first portions, second portions and third portions are encoded using different codes, and encoding values indicating the boundary positions between the first, second and third portions in the bitstream. | 07-03-2014 |
20140285487 | Method and Apparatus for Generating a Bitstream of Repetitive Structure Discovery Based 3D Model Compression - 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. | 09-25-2014 |
20140301649 | TEXTURE MASKING FOR VIDEO QUALITY MEASUREMENT - A particular implementation decomposes an image into a structure component and a texture component. An edge strength map is calculated for the structure component, and a texture strength map is calculated for the texture component. Using the edge strength and the texture strength, texture masking weights are calculated. The stronger the texture strength is, or the weaker the edge strength is, the more distortion can be tolerated by human eyes, and thus, the smaller the texture masking weight is. The local distortions are then weighted by the texture masking weights to generate an overall distortion level or an overall quality metric. | 10-09-2014 |
20140303944 | PREDICTIVE POSITION DECODING - 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 | 10-09-2014 |
20140307770 | TERMINABLE SPATIAL TREE-BASED POSITION CODING AND DECODING - The invention provides a method of terminable spatial tree-based position coding and decoding, and corresponding coding and decoding apparatus. The encoding method comprises: constructing a cell around the input spatial points; recursively dividing the cell into sub-cells at different layers; and assigning a symbol for each sub-cell indicating whether or not there is a spatial point within each sub-cell. The method further comprising: terminating further division of a sub-cell, if the sub-cell contains only one point and the distance between the center point of the sub-cell and the point contained in the sub-cell is smaller than the allowed maximal error. | 10-16-2014 |
20140320492 | METHODS AND APPARATUS FOR REFLECTIVE SYMMETRY BASED 3D MODEL COMPRESSION - 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. | 10-30-2014 |
20140324914 | POSITION CODING BASED ON SPATIAL TREE WITH DUPLICATE POINTS - 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. | 10-30-2014 |
20140334717 | METHOD AND APPARATUS FOR COMPRESSING TEXTURE INFORMATION OF THREE-DIMENSIONAL (3D) MODELS - 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. | 11-13-2014 |
20140376827 | PREDICTIVE POSITION ENCODING - A method and apparatus for position coding of three dimensional mesh models are described including estimating a symbol probability of a non-empty-child-cell C | 12-25-2014 |
20150009211 | METHOD FOR SETTING AND DETERMINING DIRECTIONS OF PRINCIPAL AXES OF 3D OBJECT - 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. | 01-08-2015 |
20150016742 | METHODS FOR COMPENSATING DECODING ERROR IN THREE-DIMENSIONAL MODELS - 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. | 01-15-2015 |
20150055882 | VEXTEX CORRECTION METHOD AND APPARATUS FOR ROTATED THREE-DIMENSIONAL (3D) COMPONENTS - 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. | 02-26-2015 |
20150078674 | COMPONENT SORTING BASED ENCODING FOR 3D MESH COMPRESSION - A method and an apparatus for 3D model compression are described. Correlation among the components of the 3D model are explored and utilized to increase the compression ratio. A principal parameter is selected and examined for determining a sorting dimension. Components are then sorted according to the sorting dimension. The principal parameter values of the sorted components are incrementally encoded. Other parameters are encoded as usual. The corresponding decoder decodes the principal parameter values of the components incrementally and decodes other parameter values as usual. Further an adaptive bit determination algorithm is disclosed to adaptively determine the number of bits assigned to each parameter value based on the value range thereof and the distortion requirements. | 03-19-2015 |
20150084953 | METHOD AND APPARATUS FOR ESTIMATING ERROR METRICS FOR MULTI-COMPONENT 3D MODELS - To calculate an error metric between two 3D multi-components models, the facets of 3D components of the first 3D model are uniformly sampled. Between each sampling point in the first 3D model and the surface of the second 3D model, a point-to-surface error is calculated. The point-to-surface errors are then processed to generate the error metric between the first and second 3D models. To speed up computation, the second 3D model can be partitioned into cells, and only the closet cell to a particular sampling point in the first 3D model is used to calculate the point-to-surface error, when computing error or metrics for individual 3D components in the 3D models, the same uniform sampling and cell partition are employed. Consequently, the error of the whole 3D model is substantially a weighted average of the errors computed for the individual components. | 03-26-2015 |
20150084954 | METHOD AND APPARATUS FOR REPETITIVE STRUCTURE DISCOVERY BASED 3D MODEL COMPRESSION - 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. To improve compression efficiency, the quantization parameters for the rotation part and translation part for transformation of an instance can be determined based on the quantization parameter used for encoding a corresponding pattern. Specifically, the quantization parameter for the rotation part may depend on the size of the instance, and the quantization parameter for the translation part may depend on the scale of translation. That is, a larger instance may use a finer quantization parameter for the rotation part. The quantization parameters are so determined that quantization errors caused by compressing the patterns, the translation part of transformation, and the rotation part of transformation are at similar levels. | 03-26-2015 |