EP1431919A1 - Procédé et appareil pour le codage et le décodage d'objets tridimensionnels au moyen d'octrees - Google Patents

Procédé et appareil pour le codage et le décodage d'objets tridimensionnels au moyen d'octrees Download PDF

Info

Publication number
EP1431919A1
EP1431919A1 EP03257599A EP03257599A EP1431919A1 EP 1431919 A1 EP1431919 A1 EP 1431919A1 EP 03257599 A EP03257599 A EP 03257599A EP 03257599 A EP03257599 A EP 03257599A EP 1431919 A1 EP1431919 A1 EP 1431919A1
Authority
EP
European Patent Office
Prior art keywords
node
nodes
dimensional object
object data
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP03257599A
Other languages
German (de)
English (en)
Other versions
EP1431919B1 (fr
Inventor
In-Kyu Park
Shin-Jun Lee
In-Wook Song
Chang-Su Kim
Sang-Uk Lee
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Samsung Electronics Co Ltd
Seoul National University Industry Foundation
Original Assignee
Samsung Electronics Co Ltd
Seoul National University Industry Foundation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from KR10-2003-0083778A external-priority patent/KR100513732B1/ko
Application filed by Samsung Electronics Co Ltd, Seoul National University Industry Foundation filed Critical Samsung Electronics Co Ltd
Publication of EP1431919A1 publication Critical patent/EP1431919A1/fr
Application granted granted Critical
Publication of EP1431919B1 publication Critical patent/EP1431919B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding
    • G06T9/40—Tree coding, e.g. quadtree, octree
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/005—Tree description, e.g. octree, quadtree
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/96—Tree coding, e.g. quad-tree coding

Definitions

  • the present invention relates to a method and apparatus for encoding and decoding data, and more particularly, to a method and apparatus for encoding and decoding three-dimensional object data comprised of one of point texture data, voxel data, and octree data.
  • An application program needs a considerable number of polygons to represent three-dimensional objects.
  • a model for representing the human body in detail needs several millions of triangles, which is too many to deal with.
  • three-dimensional measurement technology such as three-dimensional scanning
  • it makes it possible to obtain sophisticated three-dimensional data whose errors are within an allowable bound, it is still very difficult and very expensive to obtain a polygonal model that perfectly matches with objects.
  • a rendering algorithm for providing as realistic image representations as photographs is too complicated to support real-time rendering.
  • DIBR depth image-based representation
  • AFX MPEG-4 Animation Framework extension
  • DIBR includes SimpleTexture, PointTexture, and Octreelmage.
  • PointTexture represents an object with PointTexture pixels seen from a predetermined camera position.
  • Each of the PointTexture pixels is represented by its color and depth (a distance between each of the PointTexture pixels and the predetermined camera position) and other properties that help PointTexture rendering.
  • a plurality of pixels may possibly be provided along lines of sight.
  • a PointTexture image is generally comprised of a plurality of layers.
  • FIG. 1 illustrates a simple example of a one-dimensional PointTexture image.
  • FIG. 2 illustrates node specifications of PointTexture.
  • 'depth' and 'color' fields are the ones to be compressed.
  • PointTexture-based methods a layered depth image (LDI) compression method which has been disclosed by Dual and Li in "Compression of the Layered Depth Image", IEEE Trans. Image Processing, Vol. 12, No. 3, pp. 365-372, March 2003.
  • LPI layered depth image
  • JPEG-LS algorithms have been adopted to compress depth information.
  • color information is compressed using existing coding standards.
  • JPEG-LS algorithms do not support progressive data compression and progressive data transmission.
  • the present invention provides a method and apparatus for encoding and decoding three-dimensional object data comprised of point texture data, voxel data, and octree data, which can compress depth image information while guaranteeing more effective estimation encoding, higher data encoding efficiency, and more effective data lossly compression.
  • a method of encoding three-dimensional object data which is comprised of point texture data, voxel data, or octree structure data.
  • the method involves generating three-dimensional object data having a tree structure in which nodes are attached labels indicating their types; encoding nodes of the three-dimensional object data; and generating the three-dimensional object data whose nodes are encoded into a bitstream.
  • voxels are differentiated from one another by converting the three-dimensional object data into voxel data using three-dimensional bounding volume and differently labeling the voxels depending on whether or not they are located at places where objects exist.
  • a node having sub-nodes is labeled 'S'
  • a node whose voxels do not contain objects is labeled 'W'
  • a node whose voxels all contain objects is labeled 'B'
  • a node whose voxels are encoded using a prediction-by-partial-matching (PPM) algorithm is labeled 'P'.
  • PPM prediction-by-partial-matching
  • encoding the nodes of the three-dimensional object data involves encoding node information which indicates whether or not a current node is an 'S' node or a 'P' node; and encoding detailed information bit (DIB) data of an 'S' node if the node information indicates that the current node is an 'S' node and encoding DIB data of a 'P' node if the node information indicates that the current node is a 'P' node.
  • DIB detailed information bit
  • a method of encoding three-dimensional object data which is comprised of point texture data, voxel data, or octree structure data.
  • the method involves (a) generating three-dimensional object data having a tree structure in which nodes are attached labels indicating their types; (b) merging the nodes of the three-dimensional object data by referring to their labels; (c) encoding merged nodes; (d) generating the three-dimensional object data whose merged nodes are encoded into a bitstream; and (e) repeatedly carrying out steps (a) through (d) until an uppermost node of the tree structure representing the three-dimensional object data is encoded.
  • a node having sub-nodes is labeled 'S'
  • a node whose voxels do not contain objects is labeled 'W'
  • a node whose voxels all contain objects is labeled 'B'
  • a node whose voxels are encoded using a PPM algorithm is labeled 'P'.
  • step (b) involves selecting 'S' nodes whose sub-nodes are labeled 'W' and 'B' and 'P' nodes as candidate nodes to be merged; selecting, from among the candidate nodes as an optimal node, a node which can minimize a ratio of a difference ⁇ D between the number of distorted bits before merging the candidate nodes and the number of distorted bits after merging the candidate nodes with respect to a difference ⁇ R between the number of bits before merging the candidate bits and the number of bits after merging the candidate bits; labeling the selected node 'B'; and updating all the candidate nodes except the node selected as an optimal node.
  • ⁇ D is calculated in the following equation using a Hamming distance between an original model V and its approximation V and as distortion measurement: where X ⁇ Y ⁇ Z represents the resolution of the original model.
  • step (c) involves encoding a continue flag which is information indicating whether or not the candidate nodes exist in a queue; encoding node position information which indicates position of each of the candidate nodes in the queue; encoding node type information which indicates whether or not a current node is an 'S' node or a 'P' node; and encoding DIB data of an 'S' node if the node information indicates that the current node is an 'S' node and encoding DIB data of a 'P' node if the node information indicates that the current node is a 'P' node.
  • a continue flag which is information indicating whether or not the candidate nodes exist in a queue
  • encoding node position information which indicates position of each of the candidate nodes in the queue
  • encoding node type information which indicates whether or not a current node is an 'S' node or a 'P' node
  • DIB data of an 'S' node
  • encoding the DIB data of the 'S' node involves encoding an average of color information; and encoding labels of eight sub-nodes of the current node.
  • encoding the DIB data of the 'P' node involves encoding depth information; and encoding the color information.
  • all nodes below a predetermined node in the tree structure representing the three-dimensional object data are PPM-encoded according to a raster scanning order.
  • red (R), green (G), and blue (B) values of 'B' voxels of the current node are encoded by carrying out differential pulse code modulation (DPCM) and adaptive arithmetic coding (AAC).
  • DPCM differential pulse code modulation
  • AAC adaptive arithmetic coding
  • an apparatus for encoding three-dimensional object data which is comprised of point texture data, voxel data, or octree structure data.
  • the apparatus includes a tree structure generator which generates three-dimensional object data having a tree structure in which nodes are attached labels indicating their types; a merging order selector which merges the nodes of the three-dimensional object data by referring to their labels; a node encoder which encodes merged nodes; and a bitstream generator which generates the three-dimensional object data whose merged nodes are encoded into a bitstream.
  • the merging order selector includes a candidate node selector which selects 'P' nodes and 'S' nodes whose sub-nodes are labeled 'W' and 'B' as candidate nodes to be merged; an optimal node selector which selects, from among the candidate nodes as an optimal node, a node which can minimize a ratio of a difference ⁇ D between the number of distorted bits before merging the candidate nodes and the number of distorted bits after merging the candidate nodes with respect to a difference ⁇ R between the number of bits before merging the candidate bits and the number of bits after merging the candidate bits and labels the selected node 'B'; and a candidate node updater which updates all the candidate nodes except the node selected as an optimal node.
  • the node encoder includes a continue flag encoder which encodes a continue flag which is information indicating whether or not a current node is the end of a compressed bitstream; a node position encoder which encodes node position information indicating position of each of the candidate nodes in the queue; a node 'S'-or-'P' (SOP) selector which encodes node type information indicating whether or not the current node is an 'S' node or a 'P' node; an S node encoder which encodes DIB data of an 'S' node if the node information indicates that the current node is an 'S' node; and a P node encoder which encodes DIB data of a 'P' node if the node information indicates that the current node is a 'P' node.
  • a continue flag encoder which encodes a continue flag which is information indicating whether or not a current node is the end of a compressed bitstream
  • a method of decoding three-dimensional object data involves reading continue flag information from a bitstream of encoded three-dimensional object data and decoding the continue flag information; decoding note type information of the bitstream; decoding an 'S' node if the note type information indicates that a current node is an 'S' node and decoding a PPM node if the note type information indicates that the current node is a PPM node; and restoring the three-dimensional object data whose nodes are encoded to a tree structure.
  • a method of decoding three-dimensional object data involves decoding nodes of a bitstream of encoded three-dimensional object data; and restoring the three-dimensional object data whose nodes are encoded to a tree structure.
  • decoding the nodes of the bitstream of the encoded three-dimensional object data involves reading continue flag information from a bitstream of encoded three-dimensional object data and decoding the continue flag information; reading node position information indicating which candidate node in a queue is a current node and decoding the node position information; decoding note type information of the bitstream; decoding an 'S' node if the note type information indicates that a current node is an 'S' node; and decoding a PPM node if the note type information indicates that the current node is a PPM node.
  • an average color of eight sub-nodes of the current node is decoded as DIB data, and the eight sub-nodes are sequentially decoded into black nodes ('B' nodes) or white nodes ('W' nodes).
  • the current node is PPM-decoded using DIB data bits (DIB) data, and R, G, and B values of 'B' voxels of the current node are decoded by carrying out inverse AAC and inverse DPCM.
  • DIB DIB data bits
  • an apparatus for decoding a bitstream of encoded three-dimensional object data includes a bitstream reader which receives a bitstream of encoded three-dimensional object data; a node decoder which decodes the bitstream; and a tree structure restorer which restores decoded nodes to a tree structure.
  • the node decoder includes a continue flag decoder which decodes a continue flag indicating whether or not a current node is the end of the bitstream; a node position information decoder which reads node position information indicating which candidate node in a queue is a current node and decoding the node position information; a node type selector which decodes note type information of the bitstream; an S node decoder which decodes an average color of eight sub-nodes of the current node as DIB data and then sequentially decodes the eight sub-nodes into 'B' nodes or 'W' nodes; and a P node decoder which PPM-decodes DIB data of the current node and then decodes R, G, and B values of 'B' voxels of the current node by carrying out inverse AAC and inverse DPCM decoding an 'S' node, if the note type information indicates that a current node is a PPM no
  • a computer-readable recording medium on which a program enabling any of the above-mentioned methods is recorded.
  • FIG. 11 is a block diagram of an apparatus for encoding three-dimensional object data according to a preferred embodiment of the present invention.
  • the apparatus includes a tree structure generator 1100, a merging order selector 1110, a node encoder 1120, and a bitstream generator 1130.
  • the tree structure generator 1100 receives point texture data, voxel data, or tree-structured data, which represents three-dimensional object data, and generates three-dimensional object data having a tree structure in which each node is labeled to be differentiated from others.
  • the tree structure is an octree structure.
  • a PointTexture image is converted into volume data, and the volume data is alternately represented by an octree. Then, leaf nodes of the octree are effectively encoded by using a prediction-by-partial-matching (PPM) method. Accordingly, a method of encoding and decoding a three-dimensional object according to a preferred embodiment of the present invention is equivalent to a method of compressing a PointTexture model and an octree model.
  • PPM prediction-by-partial-matching
  • bounding volume In order to convert depth information of a three-dimensional object into volume data, bounding volume is created first.
  • the bounding volume has the same resolution as PointTexture. For example, supposing that PointTexture represents an image with a resolution of X ⁇ Y and depth information of each pixel has a resolution of Z, bounding volume having a resolution of X ⁇ Y ⁇ Z is created.
  • the origin of a bounding box is located at the lower left front corner of the bounding box.
  • a right voxel has a value of x, which is larger than the value of a left voxel
  • an upper voxel has a value of y, which is larger than the value of a lower voxel
  • a rear voxel has a value of z, which is larger than the value of a front voxel.
  • Depth information can be immediately converted into binary volume data. All voxels of the volume data are initialized to W (white, '0'). Thereafter, the voxels of the volume data are set to B (black, '1') if there positions are referred to by pixels of the point texture. Black voxels represent dots on a three-dimensional object, and white voxels represent a transparent background.
  • the volume data is represented by an octree, and nodes of the octree are classified into four different categories. Labels respectively representing the four different categories are presented in Table 1 below. If bounding volume contains an object, a root node is labeled 'S', and the bounding volume is divided into eight identical sub-volumes. If a sub-volume only includes black voxels or white voxels, a corresponding node is labeled 'B' or 'W'. Otherwise, the node corresponding to the sub-volume is labeled 'S', and the sub-volume is further divided into eight identical smaller parts. This process is repeatedly carried out until it reaches a node at a predetermined depth of the octree.
  • a node at the predetermined depth of the octree includes black voxels as well as white voxels, the node is labeled 'P' and voxel values included in the node can be encoded by using a PPM method.
  • Labels Comments S Split Node is divided into 8 sub-nodes W
  • White Node is comprised of white voxels only
  • Fill Black Node is completely or mostly comprised of black voxels
  • P PPM Voxel values in node are encoded by PPM algorithm
  • FIGS. 3(a) through 3(d) are diagrams illustrating different octree structures for volume data in which each node is labelled.
  • FIGS. 3(a) through 3(d) two-dimensional binary images and their respective quadtree representations are illustrated. More specifically, FIG. 3(a) illustrates a parent-children relationship in a quadtree structure, and FIG. 3(b) illustrates a quadtree corresponding to a binary image, in which depth information of the binary image is set to 2.
  • the binary image can be recovered without any data loss by using PPM-encoded data for the quadtree and three P nodes.
  • FIG. 12 is a detailed block diagram of the merging order selector 1110 of FIG. 11.
  • the merging order selector 1110 merges nodes for three-dimensional object data represented by a tree structure, by referring to labels of the nodes.
  • the merging order selector 1110 includes a candidate node selector 1200, an optimal node selector 1210, and a candidate node updater 1220.
  • the candidate node selector 1200 selects a node labelled 'P' and a node labelled 'S' as candidates to be merged.
  • the optimal node selector 1210 selects, as an optimal node, a node for which a ratio of a difference ⁇ D between the number of distorted bits before a node merging process and the number of distorted bits after the node merging process with respect to a difference ⁇ R between the total number of bits before the node merging process and the total number of bits after the node merging process reaches its minimum. Thereafter, the optimal node selector 1210 labels the selected node 'B'.
  • the candidate node updater 1220 updates all the candidate nodes except for the node selected as an optimal node.
  • FIG. 3 illustrates a labelled octree representation and tree merging.
  • Nodes of an initial tree are repeatedly merged to approximate original depth information to a few refinement levels.
  • mergeable nodes are 'P'-labelled nodes or 'nodes whose children nodes are all B nodes or W nodes.
  • FIG. 3(b) there are four mergeable nodes marked by a thicker-lined circle. Let us assume that among the four mergeable nodes, the one corresponding to a region marked by a square on a binary image is merged into a B node.
  • FIG. 3(c) A resulting binary image and a resulting tree are illustrated in FIG. 3(c).
  • FIG. 3(c) there are three mergeable nodes left.
  • one of the three mergeable nodes i.e., a P node in the far-left of the tree illustrated in FIG. 3(c)
  • a B node a node which corresponds to an upper left quadrant of the approximated model of FIG. 3(d) and whose children nodes are all 'B' nodes or 'W' nodes becomes mergeable.
  • This tree merging process is continuously carried out until all nodes of the tree are merged together under one root node.
  • FIG. 13 is a flowchart illustrating the operation of the candidate node selector 1200. Supposing that 'i' represents a serial number of each node and 'count' represents the number of candidate nodes, 'i' and 'count' are initialised to 0 in step 1300. If a node is labelled 'S' or 'P' in step 1310, it is selected as a candidate node and then is stored in a queue, and 'count' is increased by 1 in step 1330.
  • 'S' nodes only the ones whose children nodes are all 'W' nodes or 'B' nodes, or 'W' nodes and 'B' nodes can be selected as candidate nodes.
  • step 1310 is carried out on a next node in step 1320.
  • Steps 1310 through 1330 are repeatedly carried out until 'i' indicates a final node (in step 1340).
  • Nodes to be merged together are selected from among a set of mergeable nodes, and the ratio of ⁇ D to ⁇ R is minimized at a predetermined rate, which is shown in Equation (1) below.
  • ⁇ R represents a difference between the total number (R a ) of bits before a node merging process and the total number (R b ) of bits after the node merging process
  • ⁇ D represents a difference between the number (D a ) of distorted bits before the node merging process and the number (D b ) of distorted bits after the node merging process.
  • ⁇ D a Hamming distance between an original model V and a corresponding approximation is used as distortion measurement.
  • X ⁇ Y ⁇ Z represents the resolution of a model.
  • ⁇ D In order to calculate ⁇ D, it is necessary to calculate the number of bits required (i.e., a required bit rate) for representing an octree and its PPM nodes. However, it is very complicated to calculate such a required bit rate. Therefore, the required bit rate is calculated by applying typical tree bits and PPM bits to several test models.
  • FIG. 14 is a flowchart illustrating the operation of the merging order selector 1210.
  • a node for which a minimum value can be obtained from Equation (1) is selected as an optimal node from among nodes that are selected by the candidate node selector 1200 as candidate nodes, in step 1410.
  • the selected optimal node is labelled 'B'.
  • the 'B'-labelled node is removed from a queue.
  • the queue is updated. Steps 1410 through 1440 are repeatedly carried out until all nodes are merged together (in step 1450).
  • the node encoder 1120 encodes a merged node.
  • FIG. 15 is a detailed block diagram of the node encoder 1120. Referring to FIG. 15, the node encoder 1120 includes a continue flag encoder 1500, a node position encoder 1510, a node S-or-P (SOP) selector 1520, an S node encoder 1530, and a P node encoder 1540.
  • SOP node S-or-P
  • the continue flag encoder 1500 encodes a continue flag which indicates whether or not a current node is the end of a compressed bitstream. If the current node is not the end of the compressed bitstream, the continue flag is set as 'true'. Otherwise, the continue flag is set as 'false'.
  • the node position encoder 1510 which includes a candidate node queue in which nodes that are selected by the candidate node selector 1200 as candidate nodes are stored, encodes node position information which indicates the position of each of the candidate nodes in the candidate node queue.
  • the node SOP selector 1520 encodes node type information which indicates whether the current node is an S node or a P node.
  • the S node encoder 1530 encodes detailed information bit (DIB) data of a P node if the node type information indicates that the current node is a P node.
  • DIB detailed information bit
  • FIG. 16 is a flowchart illustrating the operation of the node encoder 1120.
  • a continue flag is encoded in step 1600.
  • the continue flag indicates whether or not a current node is the end of a compressed bitstream. If the current node is not the end of the compressed bitstream, the continue flag is set as 'true'. Otherwise, the continue flag is set as 'false'.
  • node position information is encoded.
  • step 1620 it is checked whether or not the merged node is a P node. If the merged node is a P node, P-node encoding is carried out in step 1630. Otherwise, S-node encoding is carried out. Steps 1600 through 1640 are repeatedly carried out until all nodes are encoded (in step 1650).
  • FIG. 17 is a flowchart illustrating the operation of the S node encoder 1520. Referring to FIG. 17, average color information is encoded in step 1700. In step 1710, labels of eight sub-nodes are encoded.
  • FIG. 18 is a flowchart illustrating the operation of the P node encoder 1530.
  • depth information is PPM-encoded in step 1800.
  • color information is differential pulse code modulation (DPCM)-encoded.
  • DPCM differential pulse code modulation
  • nodes are merged in a predetermined order according to their priority levels determined using Equation (1), while bitstreams are encoded in the opposite order.
  • bitstreams are encoded in the opposite order.
  • a decoder may restore three-dimensional models ranging from the coarsest one to the most refined one from a compressed bitstream by parsing the compressed bitstream.
  • a bit rate-distortion curve obtained by using the above-mentioned node merging method is illustrated in FIG. 4.
  • a compressed bitstream is comprised of node data of an octree.
  • the order of nodes in the compressed bitstream is just the opposite of a node merging order, as described above.
  • FIG. 5 is a diagram illustrating the structure of a compressed bitstream of a predetermined node.
  • node information is comprised of a continue flag, position data, SOP data, and DIB data.
  • the continue flag indicates whether or not the predetermined node is the end of the compressed bitstream.
  • All the data constituting the node information of FIG. 5 is entropy-encoded using an adaptive arithmetic coder (AAC).
  • AAC adaptive arithmetic coder
  • the position data indicates whether or not a 'B' node is to be split or to be PPM-encoded.
  • a decoder restores the approximated model shown in FIG. 3(d) using all data that it has received.
  • the octree of FIG. 3(d) includes four 'B' nodes, which are candidate nodes to be merged. In order to obtain as much refined a model as the one shown in FIG.
  • an encoder informs the decoder that among the four 'B' nodes, a second one from the left of the octree should be PPM-encoded. If there are more than one candidate nodes to be merged, as shown in FIG. 3(d), in what order each of the candidate nodes, i.e., 'B' nodes, should be PPM-encoded is encoded as position data. If there is only one candidate node ('B' node), the position data is not necessary, and thus there is no need to encode the position data.
  • the SOP data indicates whether the predetermined node should be split into eight children nodes or should be PPM-encoded.
  • the DIB data is comprised of eight flags indicating what an average color of the predetermined node is and whether or not the predetermined node's children nodes are 'W' nodes. Non-'W' nodes are temporarily considered as B nodes and thus are stored in a queue in which 'B' candidate nodes for a next bitstream are recorded.
  • FIG. 6 illustrates the structure of an 'S' node.
  • FIG. 7 illustrates the structure of a bitstream of a 'P' node.
  • PPM was originally proposed by Cleary and Witten to compress facsimile data without any data loss.
  • depth information is represented by binary voxel values.
  • 'W' voxels represent a transparent background
  • 'B' voxels represent a three-dimensional object.
  • Binary voxels in a 'P' node are PPM-encoded by using voxels adjacent to the binary voxels as contexts.
  • FIGS. 8(a) and 8(b) illustrate examples of contexts. Thirteen circular voxels are used as contexts to encode a rectangular voxel. According to raster scanning, 'W' voxels are set to '0', and 'B' voxels are set to '1'.
  • FIG. 8(b) A black square in FIG. 8(b) is encoded, while black circles in FIGS. 8(a) and 8(b) are used as contexts.
  • the voxels marked by 'X' are the ones that are removed away.
  • R, G, and B color values of a 'B' voxel in the predetermined node are DPCM-encoded according to a predetermined order defined by raster scanning. More specifically, the R, G, and B color values of the 'B' voxel are estimated based on R, G, and B color values of a previous 'B' voxel. Estimation residuals are encoded using an arithmetic coder.
  • the bitstream generator 1130 generates node-encoded data into a bitstream.
  • three-dimensional object data is encoded using a progressive encoding method.
  • the three-dimensional object may possibly be encoded using a lossless encoding method or a lossly encoding method.
  • a lossless encoding method or a lossly encoding method.
  • the way it is encoded could be lossless encoding.
  • only part of the bitstream ranging from a root node of a tree structure corresponding to the bitstream to a predetermined node in a lower level of the tree structure is encoded, the way it is encoded could be lossly encoding.
  • FIG. 19 is a block diagram of an apparatus for decoding three-dimensional object data according to a preferred embodiment of the present invention.
  • the apparatus includes a bitstream reader 1900, a node decoder 1910, and a tree structure restorer 1920.
  • the bitstream reader 1900 receives an encoded bitstream of three-dimensional object data
  • the node decoder 1910 decodes the encoded bitstream
  • the tree structure restorer 1920 restores decoded nodes into a tree structure.
  • FIG. 20 is a detailed block diagram of the node decoder 1910.
  • the node decoder 1910 includes a continue flag decoder 2000, a node position information decoder 2010, a node type selector 2020, an S node decoder 2030, and a P node decoder 2040.
  • the continue flag decoder 2000 reads continue flag information from an encoded bitstream of three-dimensional object data and decodes the encoded bitstream.
  • the node position information decoder 2010 reads node position information of the encoded bitstream and decodes the read node position information into position information indicating where a current node stands in a queue.
  • the node type selector 2020 decodes node type information. If the node type information indicates that the current node is an S node, the S node decoder 2030 decodes an average color of eight sub-nodes as DIB data and then sequentially decodes the eight sub-nodes into 'B' nodes or 'W' nodes.
  • the P node decoder 2040 PPM-decodes the DIB data of the current node.
  • the P node decoder 2040 decodes R, G, and B colors of 'B' voxels of the current node by carrying out inverse AAC and inverse DPCM.
  • FIG. 21 is a flowchart illustrating the operation of the node decoder 1910.
  • a continue flag is decoded in step 2100.
  • position data is decoded.
  • step 2120 it is checked whether or not a current node is a 'P' node. If the current node is a 'P' node, the current node is decoded using a 'P' node decoding method in step 2130. Otherwise, the current node is encoded using an 'S' decoding method. Steps 2100 through 2130 are repeatedly carried out until all nodes are decoded (in step 2150).
  • FIG. 22 is a flowchart illustrating the operation of the S node decoder 2020. Referring to FIG. 22, average color information is decoded in step 2200. In step 2210, labels of eight sub-nodes of a current node are decoded.
  • FIG. 23 is a flowchart illustrating the operation of the P node decoder 2030.
  • PPM depth information is decoded in step 2300.
  • color information is decoded by carrying out inverse DPCM. More specifically, a current node is PPM-decoded using DIB data, and R, G, and B values of black voxels of the current node are decoded by carrying out inverse AAC and inverse DPCM.
  • a decoder reads a continue flag of a bitstream and checks whether or not a current node is the end of the bitstream. Then, the decoder reads position data and SOP data and determines which nodes should be split or PPM-decoded based on the read position data and SOP data. If the current node is an 'S' node, color values of all voxels of the current node are temporarily set to an average of R, G, and B color values in DIB data.
  • the color values of the voxels of the current node are updated when data of the current node's children nodes is received. If the current node is a 'P' node, depth and color information of 'B' voxels of the current node are losslessly restored using the DIB data.
  • three-dimensional object data is decoded in a progressive manner.
  • nodes are decoded in a predetermined order in which bitstreams of image data are decoded. Therefore, if image data is displayed on a screen, decoded nodes are sequentially displayed on the screen in an order from an uppermost node to a lowermost node. Accordingly, as a decoding process reaches lower nodes in a tree structure representing three-dimensional object data, an image displayed on the screen becomes more refined and clearer. When the decoding process is over after decoding a final node, a most refined and clearest image is displayed on the screen.
  • three-dimensional object data is decoded in a progressive manner.
  • the three-dimensional object may possibly be decoded using a lossless decoding method or a lossly decoding method.
  • a lossless decoding method or a lossly decoding method.
  • the way it is decoded could be lossless decoding.
  • only part of the bitstream ranging from a root node of a tree structure corresponding to the bitstream to a predetermined node in a lower level of the tree structure is decoded, the way it is decoded could be lossly decoding.
  • test models illustrated in FIGS. 9(a) through 9(h) The performance of the methods of encoding and decoding three-dimensional object data according to the present invention was evaluated using test models illustrated in FIGS. 9(a) through 9(h).
  • the test models shown in FIGS. 9(a) through 9(e) have a resolution of 256 ⁇ 256 ⁇ 256, and the test models shown in FIGS. 9(f) through 9(h) have a resolution of 512 ⁇ 512 ⁇ 512.
  • FIGS. 10(a) and 10(b) are tables illustrating the data compression performance of the present invention with that of WinZip.
  • the present invention only requires 22 ⁇ 59 % of a file size that WinZip requires for processing depth information.
  • the present invention only requires 59 ⁇ 81 % of a file size that WinZip requires for processing color information.
  • WinZip shows better performance than the present invention because the 'plane' model only contains several colors and WinZip, which is a dictionary-based coder, is more suitable for dealing with the 'plane' model.
  • the present invention only requires 49 ⁇ 75% of a file size that WinZip requires for compressing depth information and color information.
  • the present invention supports progressive data transmission and progressive data decoding that WinZip does not, which is noteworthy.
  • Progressive data transmission and progressive data decoding are preferable because they facilitate adaptation of bitstreams to a bandwidth-limited environment and browsing of three-dimensional models.
  • the present invention suggests a progressive data compression method for PointTexture.
  • Pixels are closely related to one another in terms of color vectors and depth information.
  • depth information and color information can be effectively encoded by applying a PPM method to an octree structure.
  • Many simulation results show that the present invention provides a higher compression rate than a universal Lempel-Ziv coder, i.e., WinZip, does.
  • the present invention can be realized as computer-readable codes written on a computer-readable recording medium.
  • the computer-readable recording medium includes all types of recording devices on which data can be recorded in a computer-readable manner.
  • the computer-readable recording medium includes ROM, RAM, CD-ROM, a magnetic tape, a floppy disk, an optical data storage, and a carrier wave, such as data transmission through the Internet.
  • the computer-readable recording medium can be distributed over a plurality of computer systems that are connected to one another in a network sort of way, in which case data can be stored in the computer-readable recording medium in a decentralized manner.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Graphics (AREA)
  • Geometry (AREA)
  • Software Systems (AREA)
  • Processing Or Creating Images (AREA)
  • Image Generation (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
EP03257599A 2002-12-05 2003-12-03 Procédé et appareil pour le codage et le décodage d'objets tridimensionnels au moyen d'octrees Expired - Lifetime EP1431919B1 (fr)

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
US43097602P 2002-12-05 2002-12-05
US430976P 2002-12-05
US48726303P 2003-07-16 2003-07-16
US487263P 2003-07-16
KR10-2003-0083778A KR100513732B1 (ko) 2002-12-05 2003-11-24 3차원 객체 데이터 부호화 및 복호화 방법 및 장치
KR2003083778 2003-11-24

Publications (2)

Publication Number Publication Date
EP1431919A1 true EP1431919A1 (fr) 2004-06-23
EP1431919B1 EP1431919B1 (fr) 2010-03-03

Family

ID=32397772

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03257599A Expired - Lifetime EP1431919B1 (fr) 2002-12-05 2003-12-03 Procédé et appareil pour le codage et le décodage d'objets tridimensionnels au moyen d'octrees

Country Status (4)

Country Link
EP (1) EP1431919B1 (fr)
JP (1) JP4166679B2 (fr)
CN (1) CN1301493C (fr)
RU (1) RU2267161C2 (fr)

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1708142A1 (fr) * 2005-03-30 2006-10-04 Fujitsu Limited Contrôleur et processeur de données tridimensionnelles
EP1566769A3 (fr) * 2004-02-17 2007-02-21 Samsung Electronics Co., Ltd. Procédé et appareil de codage et décodage de données 3D
US8724730B2 (en) 2008-02-12 2014-05-13 Telefonaktiebolaget L M Ericsson (Publ) Method and arrangement in a wireless communication network
US9357218B2 (en) 2010-05-04 2016-05-31 Lg Electronics Inc. Method and apparatus for processing a video signal
US10097857B2 (en) 2013-04-08 2018-10-09 Dolby Laboratories Licensing Corporation Method for encoding and method for decoding a LUT and corresponding devices
EP3429207A1 (fr) * 2017-07-13 2019-01-16 Thomson Licensing Procédé et appareil de codage/décodage d'un nuage de points colorés représentant la géométrie et les couleurs d'un objet 3d
EP3429209A1 (fr) * 2017-07-13 2019-01-16 Thomson Licensing Procédé et appareil de codage/décodage d'un nuage de points représentant un objet 3d
EP3429212A1 (fr) * 2017-07-13 2019-01-16 Thomson Licensing Procédé et appareil de codage/décodage de la géométrie d'un nuage de points représentant un objet 3d
EP3467777A1 (fr) * 2017-10-06 2019-04-10 Thomson Licensing Procédé et appareil de codage/décodage des couleurs d'un nuage de points représentant un objet 3d
EP3467778A1 (fr) * 2017-10-06 2019-04-10 Thomson Licensing Procédé et appareil de codage/décodage de la géométrie d'un nuage de points représentant un objet 3d
CN111465964A (zh) * 2017-10-19 2020-07-28 交互数字Vc控股公司 编码/解码表示3d对象的点云的几何形状的方法和装置
CN112041889A (zh) * 2018-02-08 2020-12-04 松下电器（美国）知识产权公司 三维数据编码方法、三维数据解码方法、三维数据编码装置、以及三维数据解码装置
CN112313711A (zh) * 2018-06-27 2021-02-02 松下电器（美国）知识产权公司 三维数据编码方法、三维数据解码方法、三维数据编码装置、以及三维数据解码装置
US11443459B2 (en) * 2018-03-23 2022-09-13 Panasonic Intellectual Property Corporation Of America Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1946180B (zh) * 2006-10-27 2010-05-12 北京航空航天大学 一种基于Octree的三维模型压缩编码方法
CN101822068B (zh) * 2007-10-11 2012-05-30 皇家飞利浦电子股份有限公司 用于处理深度图的方法和设备
WO2009077929A1 (fr) * 2007-12-14 2009-06-25 Koninklijke Philips Electronics N.V. Mécanisme de sélection de mode 3d pour lecture vidéo
KR20110017719A (ko) 2009-08-14 2011-02-22 삼성전자주식회사 비디오 부호화 방법 및 장치, 비디오 복호화 방법 및 장치
BR112012007115A2 (pt) * 2009-10-02 2020-02-27 Koninklijke Philips Electronics N.V. Método de codificação de um sinal de dados de vídeo 3d, método de decodificação de um sinal de vídeo 3d, codificador para codificar um sinal de dados de vídeo 3d, decodificador para decodificar um sinal de dados de vídeo 3d, produto de programa de computador para codificar um sinal de dados de vídeo, produto de programa de computador para decodificar um sinal de vídeo, sinal de dados de vídeo 3d, e portador de dados digitais
IT1397591B1 (it) * 2009-12-21 2013-01-16 Sisvel Technology Srl Metodo per la generazione, trasmissione e ricezione di immagini stereoscopiche e relativi dispositivi.
EP2534844A2 (fr) * 2010-02-09 2012-12-19 Koninklijke Philips Electronics N.V. Détection de format vidéo 3D
RU2453922C2 (ru) 2010-02-12 2012-06-20 Георгий Русланович Вяхирев Способ представления исходной трехмерной сцены по результатам съемки изображений в двумерной проекции (варианты)
EP3703369B1 (fr) 2010-04-13 2024-07-24 GE Video Compression, LLC Fusion de régions d'échantillons
CN106231337B (zh) 2010-04-13 2020-06-19 Ge视频压缩有限责任公司 解码器、解码方法、编码器以及编码方法
CN106067983B (zh) 2010-04-13 2019-07-12 Ge视频压缩有限责任公司 解码数据流的方法、生成数据流的方法及解码器
BR122020008249B1 (pt) 2010-04-13 2021-02-17 Ge Video Compression, Llc herança em amostra de arranjo em subdivisão multitree
CN102437855B (zh) * 2011-11-02 2014-03-12 桂林理工大学 一种八叉树三维模型等级归并数据压缩方法
US20140340393A1 (en) * 2012-02-03 2014-11-20 Thomson Licensing System and method for error controllable repetitive structure discovery based compression
US9188433B2 (en) * 2012-05-24 2015-11-17 Qualcomm Incorporated Code in affine-invariant spatial mask
RU2602970C2 (ru) * 2014-12-01 2016-11-20 Общество С Ограниченной Ответственностью "Яндекс" Способ организации множества объектов, содержащихся в дереве квадрантов, в односвязный список и компьютер, используемый в нем
BR112020025049A2 (pt) * 2018-06-15 2021-03-23 Panasonic Intellectual Property Corporation Of America método de codificação de dados tridimensionais, método de decodificação de dados tridimensionais, dispositivo de codificação de dados tridimensionais e dispositivo de decodificação de dados tridimensionais
KR20210104055A (ko) * 2018-12-21 2021-08-24 파나소닉 인텔렉츄얼 프로퍼티 코포레이션 오브 아메리카 삼차원 데이터 부호화 방법, 삼차원 데이터 복호 방법, 삼차원 데이터 부호화 장치, 및 삼차원 데이터 복호 장치
CN113508422A (zh) * 2019-03-08 2021-10-15 松下电器（美国）知识产权公司 三维数据编码方法、三维数据解码方法、三维数据编码装置、以及三维数据解码装置
JP7448519B2 (ja) 2019-03-08 2024-03-12 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ 三次元データ符号化方法、三次元データ復号方法、三次元データ符号化装置、及び三次元データ復号装置
WO2020226605A1 (fr) * 2019-05-03 2020-11-12 Hewlett-Packard Development Company, L.P. Valeurs de température dans la fabrication additive
CN114342402A (zh) * 2019-09-11 2022-04-12 索尼集团公司 信息处理装置、信息处理方法、再现处理装置和再现处理方法

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AUPP366598A0 (en) * 1998-05-22 1998-06-18 Canon Kabushiki Kaisha Deriving polygonal boundaries from quadtree representation

Non-Patent Citations (7)

* Cited by examiner, † Cited by third party
Title
BAYAKOVSKI Y ET AL: "Depth image-based representations for static and animated 3D objects", PROCEEDINGS 2002 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING. ICIP 2002. ROCHESTER, NY, SEPT. 22 - 25, 2002, INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, NEW YORK, NY: IEEE, US, vol. 2 OF 3, 22 September 2002 (2002-09-22), pages 25 - 28, XP010607501, ISBN: 0-7803-7622-6 *
C. S. KIM; S. U. LEE: "Compact Encoding of 3D Voxel Surface Based on Pattern Code Representation", IEEE TRANS. IMAGE PROCESSING, vol. 11, no. 8, 2002, pages 932 - 943, XP001179726, DOI: doi:10.1109/TIP.2002.800891
CLEARY J G ET AL: "DATA COMPRESSION USING ADAPTIVE CODING AND PARTIAL STRING MATCHING", IEEE TRANSACTIONS ON COMMUNICATIONS, IEEE INC. NEW YORK, US, vol. COM-32, no. 4, April 1984 (1984-04-01), pages 396 - 403, XP000938651, ISSN: 0090-6778 *
DUAL; LI: "Compression of the Layered Depth Image", IEEE TRANS. IMAGE PROCESSING, vol. 12, no. 3, March 2003 (2003-03-01), pages 365 - 372
SAMET H ET AL: "Octree approximation and compression methods", PROCEEDINGS FIRST INTERNATIONAL SYMPOSIUM ON 3D DATA PROCESSING VISUALIZATION AND TRANSMISSION, PADOVA, ITALY, 19-21 JUNE 2002, 19 June 2002 (2002-06-19) - 21 June 2002 (2002-06-21), Los Alamitos, CA, USA, IEEE Comput. Soc, pages 460 - 469, XP010596692, ISBN: 0-7695-1521-5 *
Y. BAYAKOVSKI, A. IGNATENKO, A. ZHIRKOV, D. TIMASOV, A. KONUSHIN, L. LEVKOVICH-MASLYUK, MAHNJIN HAN, IN KYU PARK: "Depth image-based representations for static and animated 3D objects", LABORATORY OF COMPUTER GRAPHICS AT DEP OF CS MSU, 25 July 2002 (2002-07-25), pages 1 - 27, XP002271294, Retrieved from the Internet <URL:http://graphics.cs.msu.su/en/publications/text/dibr_csvt2002.pdf> [retrieved on 20040224] *
ZHIRKOV A: "Binary Volumetric Octree Representation for Image-Based Rendering", PROC. OF GRAPHICON'01, September 2001 (2001-09-01), XP002271295, Retrieved from the Internet <URL:http://citeseer.nj.nec.com/rd/0%2C524803%2C1%2C0.25%2CDownload/http://citeseer.nj.nec.com/cache/papers/cs/26287/http://www.graphicon.ru:8100/en/publications/../../en/publications/text/Zhirkov_2001.pdf/zhirkov01binary.pdf> [retrieved on 20040224] *

Cited By (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1566769A3 (fr) * 2004-02-17 2007-02-21 Samsung Electronics Co., Ltd. Procédé et appareil de codage et décodage de données 3D
EP1708142A1 (fr) * 2005-03-30 2006-10-04 Fujitsu Limited Contrôleur et processeur de données tridimensionnelles
US7528833B2 (en) 2005-03-30 2009-05-05 Fujitsu Limited Three-dimensional data controller and three-dimensional data processor
US8724730B2 (en) 2008-02-12 2014-05-13 Telefonaktiebolaget L M Ericsson (Publ) Method and arrangement in a wireless communication network
US9113452B2 (en) 2008-02-12 2015-08-18 Telefonaktiebolaget L M Ericsson (Publ) Method and arrangement in a wireless communication network
US9357218B2 (en) 2010-05-04 2016-05-31 Lg Electronics Inc. Method and apparatus for processing a video signal
US9363520B2 (en) 2010-05-04 2016-06-07 Lg Electronics Inc. Method and apparatus for processing a video signal
US9936202B2 (en) 2010-05-04 2018-04-03 Lg Electronics Inc. Method and apparatus for processing a video signal
US10666947B2 (en) 2010-05-04 2020-05-26 Lg Electronics Inc. Method and apparatus for processing a video signal
US10397580B2 (en) 2010-05-04 2019-08-27 Lg Electronics Inc. Method and apparatus for processing a video signal
US11006123B2 (en) 2010-05-04 2021-05-11 Lg Electronics Inc. Method and apparatus for processing a video signal
US12034971B2 (en) 2013-04-08 2024-07-09 Dolby Laboratories Licensing Corporation Method for encoding and method for decoding a LUT and corresponding devices
US10694209B2 (en) 2013-04-08 2020-06-23 Dolby Laboratories Licensing Corporation Method for encoding and method for decoding a LUT and corresponding devices
US11153605B2 (en) 2013-04-08 2021-10-19 Dolby Laboratories Licensing Corporation Method for encoding and method for decoding a LUT and corresponding devices
US10097857B2 (en) 2013-04-08 2018-10-09 Dolby Laboratories Licensing Corporation Method for encoding and method for decoding a LUT and corresponding devices
WO2019011636A1 (fr) * 2017-07-13 2019-01-17 Interdigital Vc Holdings, Inc. Procédé et appareil de codage/décodage de la géométrie d'un nuage de points représentant un objet 3d
WO2019011740A1 (fr) * 2017-07-13 2019-01-17 Interdigital Vc Holdings, Inc. Procédé et appareil de codage/décodage d'un nuage de points représentant un objet 3d
WO2019011637A1 (fr) * 2017-07-13 2019-01-17 Interdigital Vc Holdings, Inc. Procédé et appareil de codage/décodage d'un nuage de points colorés représentant la géométrie et les couleurs d'un objet 3d
EP3429212A1 (fr) * 2017-07-13 2019-01-16 Thomson Licensing Procédé et appareil de codage/décodage de la géométrie d'un nuage de points représentant un objet 3d
EP3429209A1 (fr) * 2017-07-13 2019-01-16 Thomson Licensing Procédé et appareil de codage/décodage d'un nuage de points représentant un objet 3d
EP3429207A1 (fr) * 2017-07-13 2019-01-16 Thomson Licensing Procédé et appareil de codage/décodage d'un nuage de points colorés représentant la géométrie et les couleurs d'un objet 3d
CN110870318A (zh) * 2017-07-13 2020-03-06 交互数字Vc控股公司 一种用于对表示3d物体的几何形状和颜色的彩色点云进行编码/解码的方法和装置
CN110892726A (zh) * 2017-07-13 2020-03-17 交互数字Vc控股公司 用于编码/解码表示3d对象的点云的几何形状的方法和装置
EP3467778A1 (fr) * 2017-10-06 2019-04-10 Thomson Licensing Procédé et appareil de codage/décodage de la géométrie d'un nuage de points représentant un objet 3d
CN111417985A (zh) * 2017-10-06 2020-07-14 交互数字Vc控股公司 用于编码/解码表示3d对象的点云的几何形状的方法和设备
WO2019070830A1 (fr) * 2017-10-06 2019-04-11 Interdigital Vc Holdings, Inc. Procédé et appareil de codage/décodage des couleurs d'un nuage de points représentant un objet 3d
WO2019070952A1 (fr) * 2017-10-06 2019-04-11 Interdigital Vc Holdings, Inc. Procédé et appareil de codage/décodage de la géométrie d'un nuage de points représentant un objet 3d
US11765397B2 (en) 2017-10-06 2023-09-19 Interdigital Vc Holdings, Inc. Method and apparatus for encoding/decoding the colors of a point cloud representing a 3D object
EP3467777A1 (fr) * 2017-10-06 2019-04-10 Thomson Licensing Procédé et appareil de codage/décodage des couleurs d'un nuage de points représentant un objet 3d
CN111465964A (zh) * 2017-10-19 2020-07-28 交互数字Vc控股公司 编码/解码表示3d对象的点云的几何形状的方法和装置
CN112041889A (zh) * 2018-02-08 2020-12-04 松下电器（美国）知识产权公司 三维数据编码方法、三维数据解码方法、三维数据编码装置、以及三维数据解码装置
US11443459B2 (en) * 2018-03-23 2022-09-13 Panasonic Intellectual Property Corporation Of America Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device
CN112313711A (zh) * 2018-06-27 2021-02-02 松下电器（美国）知识产权公司 三维数据编码方法、三维数据解码方法、三维数据编码装置、以及三维数据解码装置

Also Published As

Publication number Publication date
RU2003135434A (ru) 2005-05-27
CN1549206A (zh) 2004-11-24
EP1431919B1 (fr) 2010-03-03
RU2267161C2 (ru) 2005-12-27
JP4166679B2 (ja) 2008-10-15
JP2004185628A (ja) 2004-07-02
CN1301493C (zh) 2007-02-21

Similar Documents

Publication Publication Date Title
EP1431919B1 (fr) Procédé et appareil pour le codage et le décodage d&#39;objets tridimensionnels au moyen d&#39;octrees
US7263236B2 (en) Method and apparatus for encoding and decoding three-dimensional object data
KR100519780B1 (ko) 3차원 체적 데이터 부호화/복호화 방법 및 장치
JP4832975B2 (ja) 深さイメージに基づく３次元客体を表現するためのノード構造を記憶させた、コンピュータで読み出し可能な記録媒体
US7925103B2 (en) Adaptive 2n-ary tree generating method, and method and apparatus for encoding and decoding 3D volume data using it
JP3957620B2 (ja) 深さイメージ基盤３次元客体を表現するための装置及び方法
KR100450823B1 (ko) 깊이 이미지 기반 3차원 물체의 표현을 위한 노드 구조
JP4759291B2 (ja) 適応的２ｎ進ツリーの生成方法、ならびにそれを利用して３次元体積データを符号化／復号化する方法および装置
US6556207B1 (en) Graphic scene animation data signal with quantization object, corresponding method and device
US20240233192A1 (en) Adaptive Region-based Resolution for Dynamic Mesh Coding
CN117157671A (zh) 用于编码及解码3d点云的方法、编码器及解码器
CN117795554A (zh) 用于解码及编码3d点云的方法
CN118648024A (zh) 用于编码和解码3d点云的方法、编码器及解码器
Song et al. Progressive compression and transmission of PointTexture images
Nordland Compression of 3D media for internet transmission
Song et al. Progressive Transmission Of Pointtexture 3-D Images

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20031222

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

AKX Designation fees paid

Designated state(s): DE FR GB NL

17Q First examination report despatched

Effective date: 20070228

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB NL

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 60331514

Country of ref document: DE

Date of ref document: 20100415

Kind code of ref document: P

REG Reference to a national code

Ref country code: NL

Ref legal event code: T3

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20101206

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20151125

Year of fee payment: 13

Ref country code: GB

Payment date: 20151202

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 20151210

Year of fee payment: 13

Ref country code: FR

Payment date: 20151123

Year of fee payment: 13

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 60331514

Country of ref document: DE

REG Reference to a national code

Ref country code: NL

Ref legal event code: MM

Effective date: 20170101

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20161203

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170101

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20170831

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170102

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20161203

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170701