Duplicate Vertex Grouping for Dynamic Mesh Position Compression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing mesh compression standards fail to efficiently handle dynamic meshes with time-varying attribute maps and connectivity information, particularly under real-time constraints, and do not support volumetric acquisition techniques.
Innovation Solution
A method for identifying and signaling non-skippable duplicate vertices in dynamic meshes, using a mapping function to determine duplicate vertices and their positions, and encoding these vertices efficiently through grouping, prediction, and residue coding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If existing mesh compression standards are used for dynamic meshes with time-varying attribute maps and connectivity information, then compression is not efficient and data volume remains large, but these standards do not support volumetric acquisition techniques and real-time constraints
Solution Approach 1:
The patent segments the mesh data processing by identifying and separating duplicate vertices from unique vertices. It divides the vertex set into duplicate vertices (which can be referenced from previous frames) and non-skippable duplicate vertices (which require full encoding), allowing differential compression strategies for different vertex types based on their temporal redundancy characteristics
Solution Approach 2:
The patent performs preliminary identification of duplicate vertices using a mapping function before compression encoding. By pre-classifying vertices into duplicate and non-skippable categories based on their mapping relationships with reference frames, the system prepares the data structure in advance to enable efficient compression without requiring complex real-time processing during encoding
2Quantity of substance
If all vertices are encoded completely without identifying duplicates, then compression efficiency is low and data volume is large, but identifying and signaling duplicate vertices increases processing complexity
Solution Approach 1:
The patent extracts and separates duplicate vertices from the complete vertex set using a mapping function that identifies vertices with identical positions and attributes in reference frames. By taking out only the duplicate vertices that can be referenced from previous frames, the system reduces the amount of data requiring full encoding while maintaining reconstruction accuracy
Solution Approach 2:
The patent applies different encoding qualities to different vertex types: duplicate vertices receive reference-based encoding (lower quality requirement) while non-skippable duplicate vertices receive full encoding (higher quality requirement). This local differentiation of encoding strategies optimizes the balance between compression efficiency and reconstruction fidelity for each vertex category
3Productivity
If duplicate vertices are identified and grouped, then data volume for transmission is reduced, but the complexity of determining and signaling non-skippable duplicate vertices increases
Solution Approach 1:
The patent performs preliminary determination of non-skippable duplicate vertices by checking whether duplicate vertices have identical positions in both the current frame and reference frame. This pre-classification creates a simplified data structure where only non-skippable duplicates require explicit signaling, reducing the complexity of the encoding process
Solution Approach 2:
Instead of signaling all duplicate vertices, the patent inverts the approach by signaling only the non-skippable duplicate vertices that require full encoding. By identifying what needs to be encoded rather than what can be referenced, the system simplifies the signaling process while maintaining compression efficiency
Data Source
AI summary
Method, apparatus, and system for video encoding are provided. The process may include receiving volumetric data of at least one three-dimensional (3D) content. The process may also include determining a first collection of one or more duplicate vertices in a first frame of the volumetric data using a mapping function and then determining a second collection one or more non-skippable duplicate vertices among the first collection. In some embodiments, the one or more duplicate vertices comprises vertex indices of vertices in the first frame may have same mapping as respective vertices in a reference frame. In some embodiments, the second collection may include indices of the one or more non-skippable duplicate vertices with respect to positions of the respective vertices in the first collection. The process may include signaling the second collection and a number of vertices in the second collection.