Dual-Degree Mesh Coding for Dynamic 3D Connectivity Compression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing mesh compression standards do not effectively handle dynamic meshes with time varying connectivity and attribute maps, particularly under real-time constraints, which are crucial for applications like real-time communications, storage, and immersive experiences in AR and VR.
Innovation Solution
A method involving dual degree connectivity coding with adaptive multiple parallelogram prediction is employed to efficiently compress mesh data, utilizing a processor to partition vertices into groups and decode based on traversal orders, with binary flags indicating traversal paths and using interleave coding for face and pivot traversal.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If existing mesh compression standards are used, then compression is achieved for static meshes, but they fail to handle dynamic meshes with time-varying connectivity information and attribute maps
Solution Approach 1:
The patent applies dynamics by making the mesh compression system adaptive to changing connectivity structures. The encoder dynamically determines traversal orders and prediction modes based on current mesh connectivity, allowing the system to handle time-varying connectivity information effectively while maintaining compression efficiency for dynamic meshes.
Solution Approach 2:
The patent changes parameters dynamically by adjusting traversal orders, prediction modes, and reference vertex selections based on the current mesh state. These parameter changes enable the compression system to adapt to time-varying connectivity and attribute maps, resolving the contradiction between adaptability and compression effectiveness.
2Loss of information
If comprehensive connectivity and attribute information is encoded, then complete mesh representation is achieved, but bit rate requirements increase significantly
Solution Approach 1:
The patent extracts only the essential connectivity information needed for mesh representation by using optimized traversal orders. Instead of encoding all connectivity data, it extracts minimal sufficient information through intelligent vertex grouping and traversal sequences, reducing bit rate while maintaining complete mesh representation.
Solution Approach 2:
The patent performs preliminary organization of vertices into groups and determines optimal traversal orders before actual encoding. This preliminary action enables more efficient subsequent encoding by pre-structuring the data in a compression-friendly format, reducing the bit rate required for complete mesh representation.
3Productivity
If traditional separate encoding of connectivity and position is used, then encoding simplicity is maintained, but compression efficiency for dynamic meshes is insufficient
Solution Approach 1:
The patent merges the encoding of connectivity and position attributes into a unified dual-degree scheme. By combining these previously separate encoding processes, the system achieves improved compression efficiency for dynamic meshes while the integrated nature of the merged scheme manages the complexity through systematic organization.
Solution Approach 2:
The patent creates a universal encoding scheme that handles both connectivity and position information within a single framework. This multi-functional approach improves compression efficiency for dynamic meshes by treating different attribute types uniformly, while the standardized universal process manages complexity through consistency.
Data Source
AI summary
A method and apparatus comprising computer code configured to cause a processor or processors to obtain, from a bitstream, a mesh representing an encoded volumetric data of at least one three-dimensional (3D) visual content; partition a plurality of vertices of the mesh into a plurality of groups; and decode the encoded volumetric data by predicting the vertices in each group of the plurality of groups based on a plurality of traversal orders depending on an adaptive reference vertex of the vertices, and the plurality of traversal orders includes a first order from the adaptive reference vertex to a first alternative reference vertex of the vertices, and wherein the plurality of traversal orders includes a second order from the adaptive reference vertices to a second alternative reference vertex of the vertices.