Abstract: A quantization scheme substitutes the division operation by forward and inverse quantization look-up tables to improve efficiency.

Abstract: A method of compressing meshes using a projection-based approach, and leveraging the tools and syntax already generated for projection-based point cloud compression is described herein. Similar to the V-PCC approach, the mesh is segmented into surface patches, only the difference is that the segments follow the connectivity of the mesh. Each surface patch (or 3D patch) is then projected to a 2D patch, whereby in the case of the mesh, the triangle surface sampling is similar to a common rasterization approach used in computer graphics. For each patch, the position of the projected vertices is kept in a list, along with the connectivity of those vertices. The sampled surface now resembles a point cloud, and is coded with the same approach used for point cloud compression. Additionally, the list of vertices and connectivity is encoded per patch, and this data is sent along with the coded point cloud data.

Abstract: A method of compression of 3D mesh data using projections of mesh surface data and video representation of connectivity data is described herein. The method utilizes 3D surface patches to represent a set of connected triangles on a mesh surface. The projected surface data is stored in patches (a mesh patch) that is encoded in atlas data. The connectivity of the mesh, that is, the vertices and the triangles of the surface patch, are encoded using video-based compression techniques. The data is encapsulated in a new video component named vertex video data, and the disclosed structure allows for progressive mesh coding by separating sets of vertices in layers, and creating levels of detail for the mesh connectivity. This approach extends the functionality of the V3C (volumetric video-based) standard, currently being used for coding of point cloud and multiview plus depth content.

Abstract: Trisoup node size per slice enables flexibility when encoding a point cloud. Instead of each block/node being the same size, a user or machine is able to indicate block/node sizes such that regions of interest are able to have smaller node sizes for more specificity in that region.

Abstract: A method of compressing untracked and tracked meshes using a projection-based approach, and leveraging the tools and syntax already generated for projection-based point cloud compression is described herein. Similar to the V-PCC approach, the mesh is segmented into surface patches, where a difference is that the segments follow the connectivity of the mesh. Each surface patch (or 3D patch) is then projected to a 2D patch, whereby in the case of the mesh, the triangle surface sampling is similar to a common rasterization approach used in computer graphics. For each patch, the position of the projected vertices is kept in a list, along with the connectivity of those vertices. The sampled surface resembles a point cloud and is coded with the same approach used for point cloud compression. Additionally, the list of vertices and connectivity is encoded per patch, and the data is sent along with the coded point cloud data.

Abstract: A technique to parameterize the quantization scheme of the attribute coding of point cloud compression algorithms is described herein. Based on fixed-point arithmetic, the algorithm calculates the quantization step size (QS) in fixed-point notation, given a user-input quantization parameter (QP).

Abstract: A method of compressing meshes using a projection-based approach, and leveraging the tools and syntax already generated for projection-based point cloud compression is described herein. Similar to the V-PCC approach, the mesh is segmented into surface patches, only the difference is that the segments follow the connectivity of the mesh. Each surface patch (or 3D patch) is then projected to a 2D patch, whereby in the case of the mesh, the triangle surface sampling is similar to a common rasterization approach used in computer graphics. For each patch, the position of the projected vertices is kept in a list, along with the connectivity of those vertices. The sampled surface now resembles a point cloud, and is coded with the same approach used for point cloud compression. Additionally, the list of vertices and connectivity is encoded per patch, and this data is sent along with the coded point cloud data.

Abstract: A method and Video-Based Point Cloud Compression (V-PCC) decoder for synchronization of decoded frames before point cloud reconstruction is provided. A V-PCC bit-stream which includes encoded frames associated with a point cloud sequence is received. Sub-streams of the received V-PCC bit-stream are decoded by a group of video decoders of the V-PCC decoder to generate V-PCC components, such as an attribute component, a geometry component, an occupancy map component, and an atlas component. A release of the attribute component, the geometry component, the occupancy map component, and the atlas component to the reconstruction unit is delayed based on a first output delay, a second output delay, a third output delay, and a fourth output delay, respectively. The delayed release synchronizes the attribute component, the geometry component, the occupancy map component, and the atlas component with each other before the reconstruction unit reconstructs a point cloud based on the V-PCC components.

Abstract: A quantization scheme substitutes the division operation by forward and inverse quantization look-up tables to improve efficiency.

Abstract: A technique to parameterize the quantization scheme of the attribute coding of point cloud compression algorithms is described herein. Based on fixed-point arithmetic, the algorithm calculates the quantization step size (QS) in fixed-point notation, given a user-input quantization parameter (QP).