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-12464112-B2
Application number	US-202418442365-A
Country	US
Kind code	B2
Filing date	Feb 15, 2024
Priority date	Jun 15, 2018
Publication date	Nov 4, 2025
Grant date	Nov 4, 2025

Abstract

A three-dimensional data encoding method includes: encoding a first flag indicating whether a node having a parent node different from a parent node of a current node is to be referred to in encoding of the current node included in an n-ary tree structure of three-dimensional points included in three-dimensional data; selecting a coding table from N coding tables according to occupancy states of neighboring nodes of the current node, and performing arithmetic encoding on information of the current node using the coding table selected, when the first flag indicates that the node is to be referred to; and selecting a coding table from M coding tables according to the occupancy states of the neighboring nodes of the current node, and performing arithmetic encoding on information of the current node using the coding table selected, when the first flag indicates that the node is not to be referred to.

First claim

What is claimed is:

1 . A three-dimensional data encoding method, comprising:
generating a tree structure of three-dimensional points included in three-dimensional data; determining, from plural neighbor occupancy patterns, a neighbor occupancy pattern according to occupancy states of neighboring nodes of a current node; determining, from plural grouped patterns, a grouped pattern corresponding to the determined neighbor occupancy pattern; and encoding the current node using information of the determined grouped pattern, wherein each of the plural grouped patterns corresponds to one or more neighbor occupancy patterns, the plural grouped patterns include a first grouped pattern and a second grouped pattern, the plural neighbor occupancy patterns include first neighbor occupancy patterns corresponding to the first grouped pattern and second neighbor occupancy patterns corresponding to the second grouped pattern, each of the first neighbor occupancy patterns corresponding to the first grouped pattern contains N child node, each of the second neighbor occupancy patterns corresponding to the second grouped pattern contains M child node, M being greater than N, and the number of the first neighbor occupancy patterns corresponding to the first grouped pattern is smaller than the number of the second neighbor occupancy patterns corresponding to the second grouped pattern.

2 . The three-dimensional data encoding method according to claim 1 ,
the number of the first neighbor occupancy patterns corresponding to the first grouped pattern is different from the number of the second neighbor occupancy patterns corresponding to the second grouped pattern.

3 . The three-dimensional data encoding method according to claim 1 ,
wherein each of neighbor occupancy patterns corresponding to a same grouped pattern contains a same number of child nodes.

4 . The three-dimensional data encoding method according to claim 1 ,
wherein the number of the plural neighbor occupancy patterns is 64.

5 . The three-dimensional data encoding method according to claim 1 ,
wherein the current node has six neighboring nodes including three sibling neighboring nodes.

6 . A three-dimensional data decoding method, comprising:
obtaining a tree structure of three-dimensional points included in three-dimensional data; determining, from plural neighbor occupancy patterns, a neighbor occupancy pattern according to occupancy states of neighboring nodes of a current node; determining, from plural grouped patterns, a grouped pattern corresponding to the determined neighbor occupancy pattern; and decoding the current node using information of the determined grouped pattern, wherein each of the plural grouped patterns corresponds to one or more neighbor occupancy patterns, the plural grouped patterns include a first grouped pattern and a second grouped pattern, the plural neighbor occupancy patterns include first neighbor occupancy patterns corresponding to the first grouped pattern and second neighbor occupancy patterns corresponding to the second grouped pattern, each of the first neighbor occupancy patterns corresponding to the first grouped pattern contains N child node, each of the second neighbor occupancy patterns corresponding to the second grouped pattern contains M child node, M being greater than N, and the number of the first neighbor occupancy patterns corresponding to the first grouped pattern is smaller than the number of the second neighbor occupancy patterns corresponding to the second grouped pattern.

7 . The three-dimensional data decoding method according to claim 6 ,
wherein the number of the first neighbor occupancy patterns corresponding to the first grouped pattern is different from the number of the second neighbor occupancy patterns corresponding to the second grouped pattern.

8 . The three-dimensional data decoding method according to claim 6 ,
wherein each of neighbor occupancy patterns corresponding to a same grouped pattern contains a same number of child nodes.

9 . The three-dimensional data decoding method according to claim 6 ,
wherein the number of the plural neighbor occupancy patterns is 64.

10 . The three-dimensional data decoding method according to claim 6 ,
wherein the current node has six neighboring nodes including three sibling neighboring nodes.

11 . A three-dimensional data encoding device, comprising:
a processor; and memory, wherein using the memory, the processor:
generates a tree structure of three-dimensional points included in three-dimensional data;
determines, from plural neighbor occupancy patterns, a neighbor occupancy pattern according to occupancy states of neighboring nodes of a current node;
determines, from plural grouped patterns, a grouped pattern corresponding to the determined neighbor occupancy pattern; and
encodes the current node using information of the determined grouped pattern,
each of the plural grouped patterns corresponds to one or more neighbor occupancy patterns, the plural grouped patterns include a first grouped pattern and a second grouped pattern, the plural neighbor occupancy patterns include first neighbor occupancy patterns corresponding to the first grouped pattern and second neighbor occupancy patterns corresponding to the second grouped pattern, each of the first neighbor occupancy patterns corresponding to the first grouped pattern contains N child node, each of the second neighbor occupancy patterns corresponding to the second grouped pattern contains M child node, M being greater than N, and the number of the first neighbor occupancy patterns corresponding to the first grouped pattern is smaller than the number of the second neighbor occupancy patterns corresponding to the second grouped pattern.

12 . A three-dimensional data decoding device, comprising
a processor; and memory, wherein using the memory, the processor:
obtains a tree structure of three-dimensional points included in three-dimensional data;
determines, from plural neighbor occupancy patterns, a neighbor occupancy pattern according to occupancy states of neighboring nodes of a current node;
determines, from plural grouped patterns, a grouped pattern corresponding to the determined neighbor occupancy pattern; and
decodes the current node using information of the determined grouped pattern,
each of the plural grouped patterns corresponds to one or more neighbor occupancy patterns, the plural grouped patterns include a first grouped pattern and a second grouped pattern, the plural neighbor occupancy patterns include first neighbor occupancy patterns corresponding to the first grouped pattern and second neighbor occupancy patterns corresponding to the second grouped pattern, each of the first neighbor occupancy patterns corresponding to the first grouped pattern contains N child node, each of the second neighbor occupancy patterns corresponding to the second grouped pattern contains M child node, M being greater than N, and the number of the first neighbor occupancy patterns corresponding to the first grouped pattern is smaller than the number of the second neighbor occupancy patterns corresponding to the second grouped pattern.

Assignees

• Panasonic Ip Corp America

Inventors

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

Classifications

• H04N19/597 Primary

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

• H04N19/44

  Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder · CPC title

• H04N19/184

  the unit being bits, e.g. of the compressed video stream · 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