US2025024057A1PendingUtilityA1

Optimized position and connectivity coding for dual degree mesh compression

Assignee: Tencent America LLCPriority: Jul 12, 2023Filed: Jul 11, 2024Published: Jan 16, 2025
Est. expiryJul 12, 2043(~16.9 yrs left)· nominal 20-yr term from priority
H04N 19/119H04N 19/129H04N 19/597H04N 19/44
53
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

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.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
         1 . A method for video decoding, the method performed by at least one processor and comprising:
 obtaining, from a bitstream, a mesh representing an encoded volumetric data of at least one three-dimensional (3D) visual content;   partitioning a plurality of vertices of the mesh into a plurality of groups; and   decoding 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,   wherein the plurality of traversal orders comprises a first order from the adaptive reference vertex to a first alternative reference vertex of the vertices, and   wherein the plurality of traversal orders comprises a second order from the adaptive reference vertices to a second alternative reference vertex of the vertices.   
     
     
         2 . The method according to  claim 1 ,
 wherein a binary flag is included in the bitstream and indicates either the first order or the second order.   
     
     
         3 . The method according to  claim 1 ,
 wherein decoding the encoded volumetric data is based on determining at least one of the plurality of traversal orders based on a number of faces of the mesh and without any binary flag included in the bitstream and indicating any of the first order and the second order.   
     
     
         4 . The method according to  claim 1 ,
 wherein content of the bitstream is based on a rate estimated from a sum of absolute differences (SAD) of a residual vector.   
     
     
         5 . The method according to  claim 4 ,
 wherein the content of the bitstream represents a replacement vertex of the adaptive vertex and is determined based on determining a plurality of fractions of a line segment of a face of the mesh.   
     
     
         6 . The method according to  claim 1 ,
 wherein decoding the encoded volumetric data is based on interleave coding indicating at least one of face traversal and pivot traversal of the mesh.   
     
     
         7 . The method according to  claim 1 ,
 wherein the mesh comprises a parallelogram.   
     
     
         8 . An apparatus for video decoding, the apparatus comprising:
 at least one memory configured to store computer program code;   at least one processor configured to access the computer program code and operate as instructed by the computer program code, the computer program code including:
 obtaining code configured to cause the at least one processor to obtain, from a bitstream, a mesh representing an encoded volumetric data of at least one three-dimensional (3D) visual content; 
 partitioning code configured to cause the at least one processor to partition a plurality of vertices of the mesh into a plurality of groups; and 
 decoding code configured to cause the at least one processor to 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, 
   wherein the plurality of traversal orders comprises a first order from the adaptive reference vertex to a first alternative reference vertex of the vertices, and   wherein the plurality of traversal orders comprises a second order from the adaptive reference vertices to a second alternative reference vertex of the vertices.   
     
     
         9 . The apparatus according to  claim 8 ,
 wherein a binary flag is included in the bitstream and indicates either the first order or the second order.   
     
     
         10 . The apparatus according to  claim 8 ,
 wherein decoding the encoded volumetric data is based on determining at least one of the plurality of traversal orders based on a number of faces of the mesh and without any binary flag included in the bitstream and indicating any of the first order and the second order.   
     
     
         11 . The apparatus according to  claim 8 ,
 wherein content of the bitstream is based on a rate estimated from a sum of absolute differences (SAD) of a residual vector.   
     
     
         12 . The apparatus according to  claim 11 ,
 wherein the content of the bitstream represents a replacement vertex of the adaptive vertex and is determined based on determining a plurality of fractions of a line segment of a face of the mesh.   
     
     
         13 . The apparatus according to  claim 8 ,
 wherein decoding the encoded volumetric data is based on interleave coding indicating at least one of face traversal and pivot traversal of the mesh.   
     
     
         14 . The apparatus according to  claim 8 ,
 wherein the mesh comprises a parallelogram.   
     
     
         15 . A non-transitory computer readable medium storing a program causing a computer to:
 obtaining, from a bitstream, a mesh representing an encoded volumetric data of at least one three-dimensional (3D) visual content;   partitioning a plurality of vertices of the mesh into a plurality of groups; and   decoding 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,   wherein the plurality of traversal orders comprises a first order from the adaptive reference vertex to a first alternative reference vertex of the vertices, and   wherein the plurality of traversal orders comprises a second order from the adaptive reference vertices to a second alternative reference vertex of the vertices.   
     
     
         16 . The non-transitory computer readable medium according to  claim 15 ,
 wherein a binary flag is included in the bitstream and indicates either the first order or the second order.   
     
     
         17 . The non-transitory computer readable medium according to  claim 15 ,
 wherein decoding the encoded volumetric data is based on determining at least one of the plurality of traversal orders based on a number of faces of the mesh and without any binary flag included in the bitstream and indicating any of the first order and the second order.   
     
     
         18 . The non-transitory computer readable medium according to  claim 15 ,
 wherein content of the bitstream is based on a rate estimated from a sum of absolute differences (SAD) of a residual vector.   
     
     
         19 . The non-transitory computer readable medium according to  claim 18 ,
 wherein the content of the bitstream represents a replacement vertex of the adaptive vertex and is determined based on determining a plurality of fractions of a line segment of a face of the mesh.   
     
     
         20 . The non-transitory computer readable medium according to  claim 15 ,
 wherein decoding the encoded volumetric data is based on interleave coding indicating at least one of face traversal and pivot traversal of the mesh.

Join the waitlist — get patent alerts

Track US2025024057A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.