3D mesh coding/decoding method
First Claim
1. A progressive coding method of three dimensional (3D) mesh information comprising the steps of:
- (a) dividing a 3D triangle mesh of a model into one or more connected components;
(b) generating a vertex graph and a triangle graph for each of the connected components;
(c) partitioning the vertex graph and triangle graph constituting the connected components into data partitions each capable of being independently decoded for the respective connected components and then coding the same;
(d) coding geometry containing positions of vertices of triangles constituting each partition, and photometry containing color, normal and texture coordinate information, for the respective data partitions.
1 Assignment
0 Petitions
Accused Products
Abstract
A progressive coding and decoding method of three-dimensional (3D) mesh data used in the fields of motion picture experts group-4 synthetic and natural hybrid coding (MPEG-4 SNHC), virtual reality modelling language (VRML) and the like. In transmitting 3D objects composed of 3D mesh data, it is very important to progressively restore transmitted data as well as to effectively code the 3D mesh data. In the progressive restoration, in the event that a transmission data error is generated, partial restoration of the transmitted data is allowed. Thus, it is possible to minimize the amount of mesh data to be transmitted again. The progressive restoration method which is resistant to such transmission errors can be effectively applied in wireless communications or low transmission rate communications. In the progressive coding and decoding method, connectivity, geometry and photometry necessary for progressively coding 3D mesh data are constructed and then coded/decoded, thereby providing data resilience against errors.
62 Citations
33 Claims
-
1. A progressive coding method of three dimensional (3D) mesh information comprising the steps of:
-
(a) dividing a 3D triangle mesh of a model into one or more connected components;
(b) generating a vertex graph and a triangle graph for each of the connected components;
(c) partitioning the vertex graph and triangle graph constituting the connected components into data partitions each capable of being independently decoded for the respective connected components and then coding the same;
(d) coding geometry containing positions of vertices of triangles constituting each partition, and photometry containing color, normal and texture coordinate information, for the respective data partitions. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28)
-
-
29. A progressive decoding method for receiving bitstreams coded by a progressive coding method comprising the steps of:
-
(a) dividing input bitstreams into units of data partitions;
(b) identifying the partition type of each of the data partitions;
(c) if the data partitions contain vertex graphs, decoding the vertex graphs to generate bounding loops;
(d) if the data partitions contain triangle graphs, decoding the triangle graphs to generate a 3D mesh; and
(e) repeating the steps (a) through (d) to progressively generate 3D meshes. - View Dependent Claims (30, 31, 32, 33)
-
Specification