Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device

US12356007B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12356007-B2
Application numberUS-202318140983-A
CountryUS
Kind codeB2
Filing dateApr 28, 2023
Priority dateJul 13, 2018
Publication dateJul 8, 2025
Grant dateJul 8, 2025

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A three-dimensional data encoding method includes: generating a bitstream by encoding subspaces included in a current space in which three-dimensional points are included. The bitstream includes encoded data respectively corresponding to the subspaces. In the generating of the bitstream, a list of information about the subspaces is stored in first control information included in the bitstream. The subspaces are respectively associated with identifiers assigned to the subspaces, and the first control information is common to the encoded data. Each of the identifiers assigned to the subspaces respectively corresponding to the encoded data is stored in a header of a corresponding one of the encoded data.

First claim

Opening claim text (preview).

What is claimed is: 1. A three-dimensional data encoding method, comprising: generating first control information common to a plurality of subspaces; encoding the plurality of subspaces included in a current space in which a plurality of three-dimensional points are included; and generating a bitstream including the first control information and a plurality of encoded data respectively corresponding to the plurality of subspaces, wherein the first control information includes information about the plurality of subspaces respectively associated with a plurality of identifiers, each of headers of the plurality of encoded data includes information identifying a corresponding subspace, and the headers are provided in the plurality of encoded data in one-to-one correspondence. 2. The three-dimensional data encoding method according to claim 1 , wherein the plurality of identifiers are included in the first control information. 3. The three-dimensional data encoding method according to claim 1 , wherein the first control information is disposed ahead of the plurality of encoded data in the bitstream. 4. The three-dimensional data encoding method according to claim 1 , wherein the first control information includes position information of each of the plurality of subspaces. 5. The three-dimensional data encoding method according to claim 1 , wherein the first control information includes size information of each of the plurality of subspaces. 6. A three-dimensional data decoding method, comprising: obtaining, from a bitstream, first control information common to a plurality of subspaces; and decoding, from the bitstream, at least one of a plurality of encoded data, the plurality of encoded data respectively corresponding to the plurality of subspaces included in a current space in which a plurality of three-dimensional points are included, wherein the first control information includes information about the plurality of subspaces respectively associated with a plurality of identifiers, each of headers of the plurality of encoded data includes information identifying a corresponding subspace, and the headers are provided in the plurality of encoded data in one-to-one correspondence. 7. The three-dimensional data decoding method according to claim 6 , wherein the plurality of identifiers are included in the first control information. 8. The three-dimensional data decoding method according to claim 6 , wherein the first control information is disposed ahead of the plurality of encoded data in the bitstream. 9. The three-dimensional data decoding method according to claim 6 , wherein the first control information includes position information of each of the plurality of subspaces. 10. The three-dimensional data decoding method according to claim 6 , wherein the first control information includes size information of each of the plurality of subspaces. 11. A three-dimensional data encoder, comprising: processor; and memory, wherein, using the memory, the processor: generates first control information common to a plurality of subspaces; encodes the plurality of subspaces included in a current space in which a plurality of three-dimensional points are included; and generates a bitstream including the first control information and a plurality of encoded data respectively corresponding to the plurality of subspaces, wherein the first control information includes information about the plurality of subspaces respectively associated with a plurality of identifiers, each of headers of the plurality of encoded data includes information identifying a corresponding subspace, and the headers are provided in the plurality of encoded data in one-to-one correspondence. 12. A three-dimensional data decoder, comprising: processor; and memory, wherein, using the memory, the processor: obtains, from a bitstream, first control information common to a plurality of subspaces; and decodes, from the bitstream, at least one of a plurality of encoded data, the plurality of encoded data respectively corresponding to the plurality of subspaces included in a current space in which a plurality of three-dimensional points are included, wherein the first control information includes information about the plurality of subspaces respectively associated with a plurality of identifiers, each of headers of the plurality of encoded data includes information identifying a corresponding subspace, and the headers are provided in the plurality of encoded data in one-to-one correspondence.

Assignees

Inventors

Classifications

  • characterised by syntax aspects related to video coding, e.g. related to compression standards · CPC title

  • Image coding (bandwidth or redundancy reduction for static pictures H04N1/41; coding or decoding of static colour picture signals H04N1/64; methods or arrangements for coding, decoding, compressing or decompressing digital video signals H04N19/00) · CPC title

  • the region being a block, e.g. a macroblock · CPC title

  • the unit being bits, e.g. of the compressed video stream · CPC title

  • Model-based coding, e.g. wire frame · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US12356007B2 cover?
A three-dimensional data encoding method includes: generating a bitstream by encoding subspaces included in a current space in which three-dimensional points are included. The bitstream includes encoded data respectively corresponding to the subspaces. In the generating of the bitstream, a list of information about the subspaces is stored in first control information included in the bitstream. …
Who is the assignee on this patent?
Panasonic Ip Corp America
What technology area does this patent fall under?
Primary CPC classification H04N19/597. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Jul 08 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 3 related publications on this page (citations in our corpus or others sharing the same primary CPC).