Boundary-Aware Triangulation for Dynamic Mesh 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, which are crucial for real-time communications and immersive 3D content delivery.
Innovation Solution
A method involving triangulation of vertices on the boundary and interior of a mesh to infer connectivity information and reconstruct boundary UV coordinates, using techniques that can be lossless or lossy, to efficiently compress dynamic meshes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If existing mesh compression standards (MPEG-4, MESHGRID, FAMC) are used, then constant connectivity dynamic meshes can be compressed, but time varying attribute maps and connectivity information cannot be handled
Solution Approach 1:
The patent applies dynamics by transitioning from static mesh compression models to dynamic models that can handle time-varying connectivity. The system uses temporal coherence to predict connectivity changes between frames, allowing the compression standard to adapt to dynamic mesh topologies while maintaining compression efficiency. This resolves the contradiction by enabling support for time varying connectivity without sacrificing compression accuracy.
Solution Approach 2:
The patent changes the parameters of mesh representation by introducing time-varying connectivity information and attribute maps as compressible elements. By parameterizing the mesh with temporal coherence models and using predictive coding for connectivity changes, the system transforms the compression problem into a parameter estimation task that can be handled efficiently while maintaining accuracy.
2Productivity
If dynamic meshes with time varying connectivity are compressed, then real-time communications and immersive content delivery are enabled, but data volume reduction is challenging
Solution Approach 1:
The patent applies preliminary action by pre-computing temporal coherence models and connectivity predictions before actual compression. The system builds up temporal information across frames and uses this pre-computed data to predict future connectivity states, allowing for more efficient compression of dynamic meshes while reducing the actual data that needs to be transmitted.
Solution Approach 2:
The patent uses feedback mechanisms where decoded mesh data from previous frames is fed back into the compression process to inform predictions about current frame connectivity. This feedback loop allows the system to adapt its compression strategy based on actual temporal patterns, improving compression efficiency while maintaining manageable data volumes.
3Loss of information
If triangulation methods with boundary information are applied, then connectivity information can be inferred, but processing complexity increases
Solution Approach 1:
The patent applies segmentation by dividing the mesh into boundary vertices and interior vertices, and further segmenting the connectivity inference process into separate stages. Boundary vertices are processed separately from interior vertices, and connectivity is inferred in a structured manner that reduces overall processing complexity while preserving information accuracy.
Solution Approach 2:
The patent introduces UV coordinates as an intermediary representation that bridges the gap between mesh geometry and connectivity information. By inferring connectivity through UV coordinate relationships rather than directly processing complex 3D mesh topology, the system reduces processing complexity while maintaining connectivity information preservation.
Data Source
AI summary
A method and apparatus that receives a coded video bitstream from an encoder; retrieves, from the coded video bitstream, a mesh including a plurality of polygons that describe a surface of a volumetric object; triangulates one or more vertices of the mesh, the one or more vertices are located on a boundary of the mesh or interior of the mesh; infers connectivity information between the one or more vertices using the triangulation of the one or more vertices; and reconstructs one or more boundary UV coordinates based on the connectivity information.