Patent application number | Description | Published |
20130103365 | METHOD AND APPARATUS FOR DETECTING REPETITIVE STRUCTURES IN 3D MESH MODELS - Discovering repetitive structures in 3D models is a challenging task. A method for detecting repetitive structures in 3D models comprises sampling the 3D model using a current sampling step size, detecting repetitive structures and remaining potions of the model, determining a representative for each of the one or more repetitive structures, and as long as the detecting step yields one or more repetitive structures, reducing the current sampling step size and repeating the steps of sampling and detecting for each detected representative of a detected repetitive structure and for the remaining portions of the model, wherein the reduced sampling step size is used. The described method and device can e.g. be used for 3D model compression, 3D model repairing, or geometry synthesis. | 04-25-2013 |
20130182960 | METHOD AND APPARATUS FOR ENCODING GEOMETRY PATTERNS, AND METHOD FOR APPARATUS FOR DECODING GEOMETRY PATTERNS - 3D models often have a large number of small to medium sized connected components, with small numbers of large triangles, often with arbitrary connectivity. The efficiency of compact representation of large multi-component 3D models can be improved by detecting and representing similarities between components thereof, even if the components are not exactly equal. The invention uses displacement maps for encoding two or more different but similar geometry patterns differentially, based on clustering and a cluster representative surface. A method for encoding a plurality of geometry patterns comprises detecting and encoding identical copies of geometrical patterns, detecting and clustering similar geometry patterns, and detecting partial similarity. The detecting partial similarity comprises generating a cluster representative surface, generating for at least one clustered geometry pattern a displacement map, and encoding the common surface and the displacement maps. | 07-18-2013 |
20130235047 | METHOD FOR ANIMATING CHARACTERS, WITH COLLISION AVOIDANCE BASED ON TRACING INFORMATION - A method for determining a moving direction or moving velocity for a character in a group comprises reading tracing information from a cell in a terrain map on which the character is located, determining if collision avoidance is needed, and if a collision avoiding manoeuvre is necessary then updating the tracing information in the current terrain cell. | 09-12-2013 |
20130265304 | 3D MESH MODEL AND METHOD FOR CREATING THE 3D MESH MODEL - For improving the compression efficiency of 3D model processing, easier discovering of repetitive patterns is required. The invention enables simplified and improved compression of 3D models by using a pattern-instance record table, which provides the pattern-instance relationship for all instances of repetitive patterns within a 3D object. A 3D mesh model comprises data of a first reference 3D mesh model, an electronic pattern-instance record table comprising first and second instance data, wherein the first instance data points to the first reference 3D mesh model and the second instance data points to the first or a further reference 3D mesh model, and an instance record for third instance data of at least one secondary 3D mesh model instance, wherein the third instance data comprise said first and second instance data or references to said first and second instance data. | 10-10-2013 |
20130300751 | METHOD FOR GENERATING MOTION SYNTHESIS DATA AND DEVICE FOR GENERATING MOTION SYNTHESIS DATA - A method for generating motion synthesis data from two recorded motion clips comprises transforming the motion frames to standard coordinates, separating HF motion data of the motion frames from LF motion data, determining from different motion clips at least two motion frames whose frame distance is below a threshold, and defining a transition point between the at least two motion frames, interpolating motion data between said determined motion frames separately for HF and LF motion data, and generating a motion path from three segments: one segment is transformed motion data from a first motion clip up to the transition point, one segment is the interpolated motion data, and one segment is transformed motion data from a second motion clip, starting from the transition point. | 11-14-2013 |
20140040215 | METHOD FOR ENCODING A MESH MODEL, ENCODED MESH MODEL AND METHOD FOR DECODING A MESH MODEL - Many 3D mesh models have a large number of small connected components that are repeated in various positions, scales and orientations. The respective positions are defined by the position of at least one reference point per component. For an enhanced encoding of the positions of the respective reference points, a given space is divided into segments and the number of points lying in each particular segment is determined. When a cell with at least n points is subdivided into child cells, an indication is added indicating if all points of a parent are in only one child cell. If so, the index of the only non-empty child node is encoded, while otherwise the number of points in one of the two child cells is decremented and encoded. The invention avoids non-effective subdivisions of a cell, and therefore improves the compression efficiency. | 02-06-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 |
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 |
20140340393 | SYSTEM AND METHOD FOR ERROR CONTROLLABLE REPETITIVE STRUCTURE DISCOVERY BASED COMPRESSION - 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. | 11-20-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 |
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 |