Textured Mesh Encoding via Regular Tile Grids
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for encoding and decoding 3D objects represented as textured meshes face challenges such as high bandwidth requirements, artifacts, and inefficient compression due to the variability of UV coordinates and mesh topology.
Innovation Solution
The method involves encoding a textured mesh by projecting its texture map onto a regular grid of tiles, where each tile contains texture data associated with a patch from the mesh's surface. This approach allows for the regeneration of UV coordinates at the decoder side, optimizing tile arrangement based on inter-tile transitions or distortion costs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If the textured mesh is encoded using traditional UV coordinate mapping, then the texture can be mapped to the mesh surface, but the bandwidth requirements are high and compression efficiency is low due to variability of UV coordinates and mesh topology
Solution Approach 1:
The mesh surface is divided into multiple patches, and each patch is mapped to a separate tile in the texture map. This segmentation allows independent encoding of each tile, reducing the overall complexity and improving compression efficiency by eliminating the need to encode entire large-scale UV coordinate systems.
Solution Approach 2:
The patent transforms the traditional 2D UV coordinate system into a 3D hierarchical structure by introducing the patch dimension. Each patch has its own local UV coordinates within a tile, creating a (patch_id, u, v) triplets system that better represents the mesh topology and enables more efficient compression.
2Productivity
If the texture map is projected onto a regular grid of tiles with optimized arrangement, then compression efficiency is improved, but the complexity of encoding and decoding increases
Solution Approach 1:
The patches are pre-sorted and arranged in a canonical order based on their spatial relationships and distortion costs before encoding. This preliminary arrangement simplifies the decoding process, as the decoder can reconstruct the texture map by following the same predetermined sorting criteria without requiring complex optimization algorithms.
Solution Approach 2:
The patent introduces distortion cost as a parameter to guide the sorting and arrangement of tiles. By optimizing the arrangement based on distortion cost metrics, the encoding process achieves better compression efficiency while the decoder can replicate this arrangement using the same parameter-based sorting rules.
3Loss of energy
If UV coordinates are regenerated at the decoder side, then bandwidth is reduced, but the precision and accuracy of texture mapping may be affected
Solution Approach 1:
The decoder regenerates UV coordinates autonomously by receiving only the essential patch identification information and applying the same canonical sorting and coordinate generation algorithms used during encoding. This self-service approach eliminates the need to transmit UV coordinates while maintaining mapping accuracy through deterministic regeneration.
Data Source
AI summary
Methods and apparatuses for encoding or decoding animated textured meshes are provided wherein a texture map is encoded that comprises a regular grid of tiles, wherein each tile comprises texture data associated to a patch projected onto the tile, said patch belonging to partitioning of a surface of the texture mesh. According to an embodiment, the partitioning of the surface of the textured mesh is obtained by subdividing the surface of the mesh into a set of regular patches. According to an embodiment, encoding the texture map comprises arranging the tiles of the texture map based on an inter-tile transition cost. According to another embodiment, encoding the texture map comprises arranging the tiles of the texture map based on a distortion cost between the texture map of a reference frame and the texture map of the current frame.