US2026067499A1PendingUtilityA1
Base-mesh handle coding
Est. expiryAug 27, 2044(~18.1 yrs left)· nominal 20-yr term from priority
H04N 19/70H04N 19/597H04N 19/91
65
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
An apparatus includes a communication interface configured to receive a compressed bitstream comprising a base mesh sub-bitstream including mesh handle information and a processor operably coupled to the communication interface. The processor is configured to modify at least one coded value to reduce an amount of unused codewords. The at least one coded value is modified based on adding an offset to a fixed length decoded value to generate a final decoded value. The processor is also configured to reconstruct a base mesh using the final decoded value.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . An apparatus comprising:
a communication interface configured to receive a compressed bitstream comprising a base mesh sub-bitstream including mesh handle information; and a processor operably coupled to the communication interface, wherein the processor is configured to:
decode at least a portion of the compressed bitstream;
modify at least one coded value to reduce an amount of unused codewords, wherein the at least one coded value is modified based on adding an offset to a fixed length decoded value to generate a final decoded value; and
reconstruct a base mesh using the final decoded value.
2 . The apparatus of claim 1 , wherein the mesh handle information includes a variable having a length value defining a number of bits for codewords and a value range for the fixed length decoded value used to generate the final decoded value.
3 . The apparatus of claim 2 , wherein the number of bits is a multiple of three.
4 . The apparatus of claim 2 , wherein the variable further specifies a number of groups of N bits used to represent a mesh handle variable delta.
5 . The apparatus of claim 1 , wherein only arithmetic coding is utilized to code the mesh handle information, wherein a minimum amount of handles is set to zero.
6 . The apparatus of claim 1 , wherein the processor is further configured to generate a plurality of final decoded values using a plurality of fixed length decoded values by adding one of a plurality of offsets to one of the plurality of fixed length decoded values.
7 . The apparatus of claim 6 , wherein a limit is imposed on a determined number of the plurality of offsets to prevent processing of iterations beyond the determined number.
8 . The apparatus of claim 7 , wherein the processor is further configured to:
determine that an iteration meets or exceeds the limit; and process at least one of the plurality of fixed length decoded values without adding an offset.
9 . A method comprising:
receiving a compressed bitstream comprising a base mesh sub-bitstream including mesh handle information; and modifying at least one coded value to reduce an amount of unused codewords, wherein the at least one coded value is modified based on adding an offset to a fixed length decoded value to generate a final decoded value; and reconstructing a base mesh using the final decoded value.
10 . The method of claim 9 , wherein the mesh handle information includes a variable having a length value defining a number of bits for codewords and a value range for the fixed length decoded value used to generate the final decoded value.
11 . The method of claim 10 , wherein the number of bits is a multiple of three.
12 . The method of claim 10 , wherein the variable further specifies a number of groups of N bits used to represent a mesh handle variable delta.
13 . The method of claim 9 , wherein only arithmetic coding is utilized to code the mesh handle information, wherein a minimum amount of handles is set to zero.
14 . The method of claim 9 , further comprising generating a plurality of final decoded values using a plurality of fixed length decoded values by adding one of a plurality of offsets to one of the plurality of fixed length decoded values.
15 . The method of claim 14 , wherein a limit is imposed on a determined number of the plurality of offsets to prevent processing of iterations beyond the determined number.
16 . The method of claim 15 , further comprising:
determining that an iteration meets or exceeds the limit; and processing at least one of the plurality of fixed length decoded values without adding an offset.
17 . An apparatus comprising:
a communication interface; and a processor operably coupled to the communication interface, the processor configured to:
obtain a value associated with a mesh handle of a base mesh;
subtract an offset from the value to generate a coded value; and
create a compressed bitstream comprising mesh handle information including the coded value.
18 . The apparatus of claim 17 , wherein, to create the compressed bitstream, the processor is further configured to include, in the mesh handle information, a variable having a length value defining a number of bits for codewords and a value range for the coded value in the compressed bitstream.
19 . The apparatus of claim 18 , wherein the number of bits is a multiple of three.
20 . The apparatus of claim 17 , wherein the processor is further configured to generate a plurality of coded values using a plurality of offsets, and wherein a limit is imposed on a determined number of the plurality of offsets to prevent processing of iterations beyond the determined number.Join the waitlist — get patent alerts
Track US2026067499A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.