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 new hash Supplemental Enhancement Information (SEI) message for the V3C/V-PCC atlas frame is described herein. The message is used to signal the hash values that are computed for the syntax elements associated with each patch. The hash SEI message is able to be used for the V3C/V-PCC tile level and optionally for atlas level conformance testing. The hash is able to be used to confirm that the decoded values by the decoder are the same as the original values that were encoded by the encoder.

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: The color coding approach adopted by the Anchor Point Cloud Compression (PCC) leads to a significant color distortion, even at very low compression ratios. This color distortion is also referred to as color leaking. Two approaches are able to mitigate the color leaking. Both approaches reduce the color leaking significantly, while one of them (e.g., 1D subsampling) is more robust and preferred in most cases. A more general approach is an adaptive selection between these two approaches.

Abstract: An image-processing apparatus to compress digital image data, includes a memory that stores a digital image in a first storage space. The image-processing apparatus further includes one or more image-processing circuits that selects a block from a plurality of blocks of the digital image. A plurality of encoded blocks is generated by application of a plurality of sequential encoding schemes on the selected block. One encoded block is detected from the generated plurality of encoded blocks that has a maximum bit-coverage value. A sequential encoding scheme is selected from the plurality of sequential encoding schemes as an optimal sequential encoding scheme. The selected sequential encoding scheme is associated with the detected encoded block with the maximum bit-coverage value. The selected block of the digital image is converted to a compressed bit stream storable in a reduced second storage space in the memory, by use of the sequential encoding scheme.

Abstract: A new hash Supplemental Enhancement Information (SEI) message for the V3C/V-PCC atlas frame is described herein. The message is used to signal the hash values that are computed for the syntax elements associated with each patch. The hash SEI message is able to be used for the V3C/V-PCC tile level and optionally for atlas level conformance testing. The hash is able to be used to confirm that the decoded values by the decoder are the same as the original values that were encoded by the encoder.

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 point cloud coding structure defines a “key” point cloud frame, where all references used for predicting point cloud patches are limited to the current point cloud frame. A point cloud patch buffer is described, where the list of reference patches and their respective bounding boxes from a point cloud frame are stored to be used for prediction of patches in another frame. The list of reference patches may contain patches from the past and patches from the future, in case the coding order of point cloud frames is allowed to be different from the presentation order, and bi-directional prediction is used. A similar reference buffer list concept is able to be applied to the layers of the point cloud. A signaling method that correlates the blocks of V-PCC by signaling within the payload the reference to the ID of the block containing the higher-level information is also described.

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 of compression of the color data of point clouds is described herein. A palette of colors that best represent the colors existing in the cloud is generated. Clustering is utilized for generating the palette. Once the palette is generated, an index to the palette is found for each point in the cloud. The indexes are coded using an entropy coder afterwards. A decoding process is then able to be used to reconstruct the point clouds.

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: An embedded codec (EBC) circuitry includes a memory to store a plurality of one dimensional (1D) sub-blocks of quantized-transformed residual levels for a 1D image block and encoder circuitry to determine a sub-block category from a set of sub-block categories for each 1D sub-block of the plurality of 1D sub-blocks. The encoder circuitry encodes the plurality of 1D sub-blocks by application of an entropy coding scheme to generate a plurality of encoded 1D sub-blocks. The encoder circuitry allocates a plurality of refinement bits at bit-positions in bit-planes corresponding to encoded quantized-transformed residual levels in an encoded 1D sub-block of the plurality of encoded 1D sub-blocks, based on the determined sub-block category of a corresponding 1D sub-block.

Abstract: A media device includes a processor to calculate a value of an objective function for each sequence of modes of a plurality of sequences of modes, based on at least statistical data of a plurality of modes. The plurality of sequences of modes corresponds to different combinations of modes from the plurality of modes. The plurality of modes corresponds to a plurality of encoding operations executed. The processor selects a sequence of modes from the plurality of sequences of modes based on a value of the objective function associated with the sequence of modes. The modes in the selected sequence of modes are less than the plurality of modes and represents an optimal encoding scheme executable to encode an input image block.

Abstract: Embedded Codec (EBC) circuitry for image block coding based on pixel-domain pre-processing operations on image block is provided. The EBC circuitry includes memory that stores a first image block and encoder circuitry that computes a first sum of absolute differences (SAD) from a first prediction block of row-wise residual values and a second SAD from a second prediction block of column-wise residual values in pixel-domain. The encoder circuitry selects a residual prediction type from a set of residual prediction types as an optimal residual prediction type and a set of quantization parameters as optimal quantization parameters for each of a first encoding mode and a second encoding mode. The encoder circuitry generates a set of bit-streams of encoded first image block in the first encoding mode and the second encoding mode, respectively, based on the selected residual prediction type and the selected set of quantization parameters.

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

Abstract: To improve encoding efficiency, residual values are mapped so that only non-negative values are utilized when performing the encoding process.

Abstract: An embedded codec (EBC) circuitry includes encoder circuitry that determines a value of a selection parameter for each image block of a plurality of image blocks. A first image block is selected from the plurality of image blocks, based on the value of the selection parameter of the first image block that is greater than a threshold value. A gamma corrected image block is generated by application of a gamma correction scheme on the selected first image block. The application of the gamma correction scheme increases a number of bits required to encode the plurality of input pixel values in the selected first image block. A bit-stream of the gamma corrected image block is generated by application of an encoding scheme on the gamma corrected image block.