Uniform Bitdepth Scaling for Dynamic Mesh Compression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current mesh compression standards struggle with dynamic meshes that have time-varying connectivity information and attribute maps, lacking support for real-time constraints and efficient data reduction in 3D vertex and texture coordinate compression.
Innovation Solution
The implementation of a new mesh compression standard that includes uniform bitdepth scaling, using a bitdepth scaling function to convert vertex positions into integers, allowing for efficient compression and decompression of mesh data while handling dynamic meshes with time-varying connectivity and attribute maps.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If mesh data is compressed using current standards, then data transmission and storage efficiency is improved, but support for dynamic meshes with time-varying connectivity and attribute maps is lost
Solution Approach 1:
The patent implements dynamic mesh compression by introducing time-varying connectivity information and attribute maps that can change across frames. The system uses motion vectors and reference picture lists to handle dynamic mesh transformations, allowing the compression algorithm to adapt to changing mesh configurations while maintaining efficient data representation.
Solution Approach 2:
The patent changes key parameters including bitdepth scaling for vertex positions and texture coordinates, motion vector precision, and reference picture indexing. These parameter changes enable the compression system to handle dynamic meshes by adjusting the representation based on temporal and spatial variations in the mesh data.
2Quantity of substance
If vertex positions are quantized to reduce precision, then compression ratio is improved, but reconstruction accuracy deteriorates
Solution Approach 1:
The patent applies bitdepth scaling functions that dynamically adjust the quantization precision based on the position range and importance. Vertex positions are scaled using functions that map floating-point coordinates to integer representations with adaptive precision, maintaining accuracy for critical regions while reducing precision for less important areas.
Solution Approach 2:
The patent implements differential precision where different regions of the mesh use different quantization levels. Important geometric features and high-curvature regions maintain higher precision while flat or low-importance regions use coarser quantization, optimizing the balance between compression and reconstruction quality.
3Quantity of substance
If motion compensation is applied to improve compression, then temporal redundancy is reduced, but computational complexity increases
Solution Approach 1:
The patent divides the mesh into multiple regions or blocks that can be independently processed with motion compensation. Each block uses its own motion vector and prediction parameters, allowing selective application of complex operations only where needed while simplifying processing in static regions.
Solution Approach 2:
The patent applies motion compensation selectively rather than uniformly across all mesh data. Reference picture lists and motion vector prediction are used only when temporal redundancy is significant, reducing computational overhead for frames or regions where simple copying suffices.
Data Source
AI summary
A bitstream that includes base mesh information of a base mesh is received. The base mesh includes a subset of a plurality of vertices of a mesh in a current mesh frame. A position of a current vertex of the base mesh is determined based on a quantized position of the current vertex of the base mesh that is generated according to a bitdepth scaling function. The bitdepth scaling function is configured to convert a first subset of positions of the vertices of the base mesh into a first integer and a second subset of the positions of the vertices of the base mesh into a second integer. A total number of the first subset of the positions is equal to a total number of the second subset of the positions. The current vertex is reconstructed based on the determined position of the current vertex of the base mesh.