In-tree geometry quantization of point clouds
An example method includes receiving a plurality of points that represent a point cloud; representing a position of the point in each dimension of a three-dimensional space as a sequence of bits, where the position of the point is encoded according to a tree data structure; partitioning at least one of the sequences of bits into a first portion of bits and a second portion of bits; quantizing each of the second portions of bits according to a quantization step size, where the quantization step size is determined according to an exponential function having a quantization parameter value as an input and the quantization step size as an output; and generating a data structure representing the point cloud and including the quantized second portions of bits.
1. A method comprising:
receiving, by a computer system, a plurality of points that represent a point cloud in three-dimensional space;
representing, by the computer system for each point, a position of the point in each dimension of the three-dimensional space as a sequence of bits, wherein the position of the point is represented according to a tree data structure, wherein the tree data structure is an octree;
partitioning, by the computer system, at least one of the sequences of bits into a first portion of bits and a second portion of bits;
quantizing, by the computer system, each of the second portions of bits according to a quantization step size, wherein the quantization step size is determined according to an exponential function having a quantization parameter value as an input and the quantization step size as an output;
generating, by the computer system, a data structure representing the point cloud in the three-dimensional space, the data structure including the quantized second portions of bits; and
at least one of transmitting or storing the data structure by the computer system.
2. The method of claim 1 , wherein partitioning at least one of the sequences of bits comprises:
partitioning at least one of the sequences of bits such that each of the first portions of bits includes the first d bits from a corresponding one of the sequences of bits, wherein d is a scaling depth of the tree data structure, and
partitioning at least one of the sequences of bits such that each of the second portions of bits includes a remainder of bits from the corresponding one of the sequences of bits.
3. The method of claim 1 , wherein quantizing each of the second portions of bits comprises dividing a numerical value indicated by each of the second portions of bits by the quantization step size.
4. The method of claim 1 , further comprising indicating at least one of the quantization step size or the quantization parameter value in the data structure.
5. The method of claim 1 , wherein the exponential function is selected such that, for positive integer quantization parameter values, a majority of the quantization step sizes outputted by the exponential function are integers.
6. The method of claim 1 , wherein the exponential function is selected such that, for positive integer quantization parameter values, N of the quantization step sizes outputted by the exponential function are non-integers, wherein N=(p×log 2 p)−d+1, and wherein p is the number of quantization parameters per doubling of the quantization step size.
7. The method of claim 1 , wherein the exponential function is QS=(1+0.125×mod [QP, 8])×2 └P/8┘ , wherein QS is the quantization step size, and QP is the quantization parameter value.
8. The method of claim 1 , further comprising approximating at least some of the quantized second portions of bits as integer values.
9. A device comprising:
one or more processors; and
memory storing instructions that when executed by the one or more processors, cause the one or more processors to perform operations comprising:
receiving a plurality of points that represent a point cloud in three-dimensional space;
representing a position of the point in each dimension of the three-dimensional space as a sequence of bits, wherein the position of the point is encoded according to a tree data structure, wherein the tree data structure is an octree;
partitioning at least one of the sequences of bits into a first portion of bits and a second portion of bits;
quantizing each of the second portions of bits according to a quantization step size, wherein the quantization step size is determined according to an exponential function having a quantization parameter value as an input and the quantization step size as an output;
generating a data structure representing the point cloud in the three-dimensional space, the data structure including the quantized second portions of bits; and
at least one of transmitting or storing the data structure by the device.
10. The device of claim 9 , wherein partitioning at least one of the sequences of bits comprises:
partitioning at least one of the sequences of bits such that each of the first portions of bits includes the first d bits from a corresponding one of the sequences of bits, wherein d is a scaling depth of the tree data structure, and
partitioning at least one of the sequences of bits such that each of the second portions of bits includes a remainder of bits from the corresponding one of the sequences of bits.
11. The device of claim 9 , wherein quantizing each of the second portions of bits comprises dividing a numerical value indicated by each of the second portions of bits by the quantization step size.
12. The device of claim 9 , the operations further comprising indicating at least one of the quantization step size or the quantization parameter value in the data structure.
13. The device of claim 9 , wherein the exponential function is selected such that, for positive integer quantization parameter values within a range of values, a majority of the quantization step sizes outputted by the exponential function are integers.
14. The device of claim 9 , wherein the exponential function is selected such that, for positive integer quantization parameter values, N of the quantization step sizes outputted by the exponential function are non-integers, wherein N=(p×log 2 p)−p+1, and wherein p is the number of quantization parameters per doubling of the quantization step size.
15. The device of claim 9 , wherein the exponential function is QS=(1+0.125×mod [QP, 8])×2 └QP/8┘ , wherein QS is the quantization step size, and QP is the quantization parameter value.
16. The device of claim 9 , wherein the operations further comprise approximating at least some of the second portions of bits as integer values.
17. A non-transitory, computer-readable storage medium having instructions stored thereon, that when executed by one or more processors, cause the one or more processors to perform operations comprising:
receiving a plurality of points that represent a point cloud in three-dimensional space;
representing a position of the point in each dimension of the three-dimensional space as a sequence of bits, wherein the position of the point is encoded according to a tree data structure, wherein the tree data structure is an octree;
partitioning at least one of the sequences of bits into a first portion of bits and a second portion of bits;
quantizing each of the second portions of bits according to a quantization step size, wherein the quantization step size is determined according to an exponential function having a quantization parameter value as an input and the quantization step size as an output;
generating a data structure representing the point cloud in the three-dimensional space, the data structure including the quantized second portions of bits; and
at least one of transmitting or storing the data structure by a computer system.