US2025054198A1PendingUtilityA1
Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device
Est. expiryFeb 26, 2039(~12.6 yrs left)· nominal 20-yr term from priority
G06F 7/76G06T 7/75G06T 9/001G06T 9/40H04N 19/597
76
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
A three-dimensional data encoding method of encoding three-dimensional points includes: re-ordering, in a re-ordered data order, pieces of attribute information of the three-dimensional points arranged in a predetermined order; encoding the pieces of attribute information re-ordered in the re-ordering, in accordance with the re-ordered data order; and generating a bitstream including (i) order information indicating the predetermined order and (ii) the pieces of attribute information encoded in the encoding.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . An encoding method comprising:
obtaining a first data series including data of points arranged in a first order; generating a second data series including the data of points arranged in a second order, the second order being different from the first order; encoding the second data series to generate encoded data; and generating a bitstream including the encoded data; wherein the second data series is generated by:
determining a reference point from among the points, and
arranging the data of a first point at a position next to the data of the reference point; and
wherein the first point is the nearest point to the reference point.
2 . The encoding method according to claim 1 , wherein the first order is a Moton order.
3 . A decoding method comprising:
decoding a bitstream to obtain positions of points and a second data series including data of points arranged in a second order; and generating a first data series from the second data series based on the positions of points, the first data series including the data of points arranged in a first order; wherein the second data series includes data of a reference point and data of a first point arranged at a position next to the data of the reference point, and the first point is the nearest point to the reference point.
4 . The decoding method according to claim 3 , wherein the first order is a Moton order.
5 . An encoder comprising:
a processor; and memory; wherein using the memory, the processor:
obtains a first data series including data of points arranged in a first order,
generates a second data series including the data of points arranged in a second order, the second order being different from the first order,
encodes the second data series to generate encoded data, and
generates a bitstream including the encoded data;
wherein the second data series is generated by:
determining a reference point from among the points, and
arranging the data of a first point at a position next to the data of the reference point; and
wherein the first point is the nearest point to the reference point.
6 . The encoder according to claim 5 , wherein the first order is a Moton order.
7 . A decoder comprising:
a processor; and memory; wherein using the memory, the processor:
decodes a bitstream to obtain positions of points and a second data series including data of points arranged in a second order, and
generates a first data series from the second data series based on the positions of points, the first data series including the data of points arranged in a first order; and
wherein the second data series includes data of a reference point and data of a first point arranged at a position next to the data of the reference point, and the first point is the nearest point to the reference point.
8 . The decoder according to claim 7 , wherein the first order is a Moton order.Join the waitlist — get patent alerts
Track US2025054198A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.