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

Patent metadata

Field	Value
Publication number	US-11936910-B2
Application number	US-202218091554-A
Country	US
Kind code	B2
Filing date	Dec 30, 2022
Priority date	Apr 10, 2018
Publication date	Mar 19, 2024
Grant date	Mar 19, 2024

Abstract

A three-dimensional data encoding method includes encoding information of a current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, where N is an integer greater than or equal to 2. In the encoding, first information is encoded, the first information indicating a range for one or more referable neighboring nodes among neighboring nodes spatially neighboring the current node, and the current node is encoded with reference to a neighboring node within the range.

First claim

What is claimed is:

1. A three-dimensional data encoding method, comprising:
encoding information of a current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, where N is an integer greater than or equal to 2; and
generating a bitstream including first information,
wherein in the encoding, the first information is encoded, the first information indicating a range for one or more available nodes being referable during the encoding,
wherein in the encoding, the current node is encoded with reference to a neighboring node corresponding to one of the one or more available nodes within the range, and
wherein in the encoding, whether the neighboring node includes a three-dimensional point is determined.

2. The three-dimensional data encoding method according to claim 1 ,
wherein in the encoding, a set of contexts is selected based on whether the neighboring node includes a three-dimensional point, and the information of the current node is entropy encoded using the selected set of contexts.

3. The three-dimensional data encoding method according to claim 1 ,
wherein in the encoding, a search is performed for information of the one or more available nodes, and
the first information indicates a range for the search.

4. The three-dimensional data encoding method according to claim 3 ,
wherein in the search, information of nodes is searched for in a predetermined order, and
the first information indicates a total number of nodes on which the search is to be performed.

5. The three-dimensional data encoding method according to claim 4 ,
wherein in the search, indexes of Morton codes are used.

6. The three-dimensional data encoding method according to claim 1 ,
wherein in the encoding,
second information is encoded, the second information indicating whether the range for the one or more available nodes is to be limited, and
the first information is encoded when the second information indicates that the range for the one or more available nodes is to be limited.

7. The three-dimensional data encoding method according to claim 1 ,
wherein the range for the one or more available nodes changes according to a layer to which the current node belongs in the N-ary tree structure.

8. The three-dimensional data encoding method according to claim 1 ,
wherein the first information indicates a total number of available nodes.

9. A three-dimensional data decoding method, comprising:
obtaining a bitstream; and
decoding information of a current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, where N is an integer greater than or equal to 2,
wherein in the decoding, first information is decoded from the bitstream,
wherein in the decoding, a range for one or more available nodes is determined based on the first information, the one or more available nodes being referable during the decoding,
wherein in the decoding, the current node is decoded with reference to a neighboring node corresponding to one of the one or more available nodes within the range, and
wherein in the decoding, whether the neighboring node includes a three-dimensional point is determined.

10. The three-dimensional data decoding method according to claim 9 ,
wherein in the decoding, a set of contexts is selected based on whether the neighboring node includes a three-dimensional point, and the information of the current node is entropy decoded using the selected set of contexts.

11. The three-dimensional data decoding method according to claim 9 ,
wherein in the decoding, a search is performed for information of the one or more available nodes, and
the first information indicates a range for the search.

12. The three-dimensional data decoding method according to claim 11 ,
wherein in the search, information of nodes is searched for in a predetermined order, and the first information indicates a total number of nodes on which the search is to be performed.

13. The three-dimensional data decoding method according to claim 12 ,
wherein in the search, indexes of Morton codes are used.

14. The three-dimensional data decoding method according to claim 9 ,
wherein in the decoding,
second information is decoded,
whether the range for the one or more available nodes is to be limited is determined based on the second information, and
the first information is decoded when the second information indicates that the range for the one or more available nodes is to be limited.

15. The three-dimensional data decoding method according to claim 9 ,
wherein the range for the one or more available nodes changes according to a layer to which the current node belongs in the N-ary tree structure.

16. The three-dimensional data decoding method according to claim 9 ,
wherein the first information indicates a total number of available nodes.

17. A three-dimensional data encoding device, comprising:
a processor; and
memory,
wherein using the memory, the processor:
encodes information of a current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, where N is an integer greater than or equal to 2; and
generates a bitstream including first information,
wherein in the encoding, the first information is encoded, the first information indicating a range for one or more available nodes being referable during the encoding,
wherein in the encoding, the current node is encoded with reference to a neighboring node corresponding to one of the one or more available nodes within the range, and
wherein in the encoding, whether the neighboring node includes a three-dimensional point is determined.

18. A three-dimensional data decoding device, comprising:
a processor; and
memory,
wherein using the memory, the processor:
obtains a bitstream; and
decodes information of a current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, where N is an integer greater than or equal to 2,
wherein in the decoding, first information is decoded from the bitstream,
wherein in the decoding, a range for one or more available nodes is determined based on the first information, the one or more available nodes being referable during the decoding,
wherein in the decoding, the current node is decoded with reference to a neighboring node corresponding to one of the one or more available nodes within the range, and
wherein in the decoding, whether the neighboring node includes a three-dimensional point is determined.

Assignees

• Panasonic Ip Corp America

Inventors

• Wang Chi
• Lasang Pongsak
• Han Chung Dean
• Sugio Toshiyasu

Classifications

• H04N19/597 Primary

  specially adapted for multi-view video sequence encoding · CPC title

• H04N19/103

  Selection of coding mode or of prediction mode · CPC title

• H04N19/136

  Incoming video signal characteristics or properties · CPC title

• H04N19/91

  Entropy coding, e.g. variable length coding [VLC] or arithmetic coding · CPC title

• H04N19/96

  Tree coding, e.g. quad-tree coding · CPC title