Point-Cloud Patch Coding With Flexible Ordering and Skip Inheritance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing point cloud coding technologies are inefficient in handling the flexible ordering and inheritance of patches, leading to suboptimal coding efficiency and user experience in processing and rendering point clouds.
Innovation Solution
The proposed method allows for flexible ordering of patches in the patch frame data unit, enabling inheritance of parameters from reference patches, eliminating the need to signal the total number of patches, and replacing traditional PCM patches with PCM patch type indications, supporting skip and additional patches at various positions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional point cloud coding methods are used with fixed patch ordering, then the coding structure is simple, but the coding efficiency is suboptimal and flexibility in handling patches is limited
Solution Approach 1:
The patent implements dynamic patch ordering where patches can be arranged in any sequence within the patch frame data unit based on their patch mode types. The decoder uses a termination patch type to dynamically determine when to stop decoding patches, replacing fixed ordering constraints with flexible dynamic control. This allows the system to adapt patch ordering to optimize coding efficiency for different point cloud content while maintaining manageable complexity through the termination mechanism.
2Loss of information
If the total number of patches is signaled in the bitstream, then the decoder knows how many patches to process, but the signaling overhead increases and coding efficiency decreases
Solution Approach 1:
The patent extracts the explicit patch count signaling from the bitstream by using a termination patch type mechanism. Instead of signaling the total number of patches upfront, the system processes patches sequentially until encountering a termination patch type, which implicitly indicates the end of the patch list. This removes the redundant patch count information while preserving the necessary control for decoding, thereby improving coding efficiency without losing essential patch processing information.
3Adaptability or versatility
If PCM patches are located at the end of the patch frame data unit, then the structure is simple, but the flexibility to insert patches at various positions is limited
Solution Approach 1:
The patent implements dynamic patch positioning by allowing patches of different modes (intra, inter, PCM) to be placed in any order within the patch frame data unit. The decoder determines patch positions dynamically based on the sequence of patch mode types encountered during decoding, with the termination patch type marking the end. This dynamic approach enables flexible insertion of PCM patches at various positions rather than requiring them to be fixed at the end, improving adaptability while managing complexity through the termination mechanism.
4Productivity
If skip patch data unit type is not used, then all patch parameters must be explicitly coded, but the coding redundancy increases and efficiency decreases
Solution Approach 1:
The patent implements the skip patch data unit type that allows certain patches to copy parameters from reference patches instead of encoding them explicitly. When a skip patch is encountered, the decoder inherits parameters from a previously decoded reference patch, effectively creating a copy of the parameter set. This reduces coding redundancy for patches with identical or similar parameters to their references, improving coding efficiency while managing complexity through the inheritance mechanism.
Data Source
AI summary
A method of point cloud coding (PCC) including receiving encoded patch information data; obtaining a patch corresponding to the encoded patch information data, the patch having a patch type; determining whether the patch type for the patch is a last patch type; and terminating a reconstruction process corresponding to the encoded patch information data when the patch type is the last patch type. Another method includes the same receiving and obtaining steps, but determining whether the patch type for the patch is a skip patch type; decoding a reference patch index corresponding to the patch when the patch type is the skip patch type; determining a reference index for the patch based on a reference frame index corresponding to the patch and the reference patch index as decoded when the patch type is the skip patch type; and reconstructing a volumetric representation of the patch.