Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device
View Patent ↗A three-dimensional data encoding method includes: generating a bit sequence including N-bit information that is information of a current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data and that indicates whether a three-dimensional point is present in each of child nodes belonging to the current node, where N is an integer greater than or equal to 2; generating (i) position information indicating a head position that is a position at which a predetermined code appears first in the bit sequence when the bit sequence is scanned in a predetermined scan order, and (ii) a remaining bit that is part of the bit sequence after the head position in the predetermined scan order; and encoding the position information and the remaining bit as information of the current node.
1. A three-dimensional data encoding method, comprising:
generating an N-ary tree structure of three-dimensional points including a plurality of nodes, where N is an integer greater than or equal to 2;
selecting an encoding mode for each of the plurality of nodes;
when a first mode is selected as an encoding mode for a current node having N child nodes being occupied or unoccupied, encoding position information indicating a position of single occupied child node out of the N child nodes;
when a second mode is selected as an encoding mode for the current node, encoding occupancy information including each occupancy state for the N child nodes; and
generating a bitstream including the position information or the occupancy information.
2. The three-dimensional data encoding method according to claim 1 ,
wherein the first mode is selected when a total number of neighboring nodes each including a three-dimensional point among neighboring nodes of the current node or a proportion of the neighboring nodes each including a three-dimensional point to the neighboring nodes of the current node is less than a predetermined threshold value, and
the second mode is selected when the total number of the neighboring nodes or the proportion of the neighboring nodes is greater than the predetermined threshold value.
3. The three-dimensional data encoding method according to claim 1 ,
wherein one of the first mode and the second mode is selected based on a bit sequence of a parent node of the current node.
4. The three-dimensional data encoding method according to claim 3 ,
wherein the first mode is selected when a total number of child nodes each including a three-dimensional point among child nodes belonging to the parent node is less than a predetermined threshold value, the total number of the child nodes being indicated by the bit sequence of the parent node, and
the second mode is selected when the total number of the child nodes is greater than the predetermined threshold value.
5. A three-dimensional data decoding method, comprising:
obtaining, from a bitstream, an N-ary tree structure of three-dimensional points including a plurality of nodes, where N is an integer greater than or equal to 2;
selecting a decoding mode for each of the plurality of nodes;
when a first mode is selected as a decoding mode for a current node having N child nodes being occupied or unoccupied, decoding position information indicating a position of single occupied child node out of the N child nodes;
when a second mode is selected as a decoding mode for the current node, decoding occupancy information including each occupancy state for the N child nodes; and
restoring the N-ary tree structure using the position information or the occupancy information.
6. The three-dimensional data decoding method according to claim 5 ,
wherein the first mode is selected when a total number of neighboring nodes each including a three-dimensional point among neighboring nodes of the current node or a proportion of the neighboring nodes each including a three-dimensional point to the neighboring nodes of the current node is less than a predetermined threshold value, and
the second mode is selected when the total number of the neighboring nodes or the proportion of the neighboring nodes is greater than the predetermined threshold value.
7. The three-dimensional data decoding method according to claim 5 ,
wherein one of the first mode and the second mode is selected based on a bit sequence of a parent node of the current node.
8. The three-dimensional data decoding method according to claim 7 ,
wherein the first mode is selected when a total number of child nodes each including a three-dimensional point among child nodes belonging to the parent node is less than a predetermined threshold value, the total number of the child nodes being indicated by the bit sequence of the parent node, and
the second mode is selected when the total number of the child nodes is greater than the predetermined threshold value.
9. A three-dimensional data encoding device, comprising:
a processor; and
memory,
wherein using the memory, the processor:
generates an N-ary tree structure of three-dimensional points including a plurality of nodes, where N is an integer greater than or equal to 2;
selects an encoding mode for each of the plurality of nodes;
when a first mode is selected as an encoding mode for a current node having N child nodes being occupied or unoccupied, encodes position information indicating a position of single occupied child node out of the N child nodes;
when a second mode is selected as an encoding mode for the current node, encodes occupancy information including each occupancy state for the N child nodes; and
generates a bitstream including the position information or the occupancy information.
10. A three-dimensional data decoding device, comprising:
a processor; and
memory,
wherein using the memory, the processor:
obtains, from a bitstream, an N-ary tree structure of three-dimensional points including a plurality of nodes, where N is an integer greater than or equal to 2;
selects a decoding mode for each of the plurality of nodes;
when a first mode is selected as a decoding mode for a current node having N child nodes being occupied or unoccupied, decodes position information indicating a position of single occupied child node out of the N child nodes;
when a second mode is selected as a decoding mode for the current node, decodes occupancy information including each occupancy state for the N child nodes; and
restores the N-ary tree structure using the position information or the occupancy information.
11. The three-dimensional data encoding method according to claim 1 ,
wherein the first mode is selected when the current node has a single occupied child node and N−1 unoccupied child nodes.
12. The three-dimensional data encoding method according to claim 1 ,
wherein the second mode is selected when the current node has multiple occupied child nodes.
13. The three-dimensional data encoding method according to claim 1 , further comprising
when the current node is encoded in the first mode, further selecting an encoding mode for the single occupied child node.
14. The three-dimensional data encoding method according to claim 1 , further comprising
when the current node is encoded in the second mode, further determining an encoding mode for each of occupied child nodes.
15. The three-dimensional data encoding method according to claim 1 , further comprising
generating a bit sequence including N bits of information,
wherein the position of the single occupied child node included in the position information corresponds to the least significant bit of the N bits of information each corresponding to the N child nodes.
16. The three-dimensional data decoding method according to claim 5 ,
wherein the first mode is selected when the current node has a single occupied child node and N−1 unoccupied child nodes.
17. The three-dimensional data decoding method according to claim 5 ,
wherein the second mode is selected when the current node has multiple occupied child nodes.
18. The three-dimensional data decoding method according to claim 5 , further comprising
when the current node is decoded in the first mode, further selecting an encoding mode for the single occupied child node.
19. The three-dimensional data decoding method according to claim 5 , further comprising
when the current node is decoded in the second mode, further determining an encoding mode for each of occupied child nodes.
20. The three-dimensional data decoding method according to claim 5 , further comprising
obtaining a bit sequence including N bits of information,
wherein the position of the single occupied child node included in the position information corresponds to the least significant bit of the N bits of information each corresponding to the N child nodes.