Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device
AssigneePanasonic Intellectual Property Corporation of America
InventorsChi WANG, Pongsak LASANG, Chung Dean HAN, Toshiyasu SUGIO
Life of this patent
Estimating the term…
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.
Claims19
1-16. (canceled)
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.
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.
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.
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.
Dependencies are inferred from the claim text.