Inter prediction in point cloud compression

By adopting inter prediction method and context selection optimization technology in point cloud encoding, the problem of low point cloud encoding efficiency in the prior art is solved, and more efficient point cloud data compression and decoding are achieved.

CN119096539APending Publication Date: 2024-12-06QUALCOMM INC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202380034017.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2023-04-20
Filing Date
2023-04-21
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

The prior art fails to effectively utilize inter prediction in point cloud encoding and decoding, resulting in insolable decoding efficiency, especially in the storage and transmission of point cloud data, and fails to fully optimize the compression efficiency of point cloud.

Method used

Using the inter prediction method, through the cooperation of memory and processor, the radius residual symbol of the point cloud is determined, and the appropriate selection is based on whether the previous decoding point is inter-decoding and whether the current point is inter-decoding. The context is entropy encoded and decoded, and the prediction buffer is updated to generate more accurate predictors, thereby improving decoding efficiency.

Benefits of technology

It improves the efficiency of point cloud encoding and decoding, reduces the amount of data required for data storage and transmission, and enhances the compression performance of point cloud data.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119096539A_ABST
    Figure CN119096539A_ABST
Patent Text Reader

Abstract

An apparatus for encoding a point cloud includes: a memory configured to store point cloud data regarding the point cloud; and one or more processors configured to: determine a residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; determining a context for entropy encoding the residual value based on whether the current point is coded with intra prediction or inter prediction; and entropy encoding the residual value using the determined context.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] This application claims priority to U.S. patent application No. 18 / 304,268, filed on April 20, 2023, which claims the benefit of U.S. Provisional Patent Application No. 63 / 363,550, filed on April 25, 2022, U.S. Provisional Patent Application No. 63 / 363,468, filed on April 22, 2022, and U.S. Provisional Patent Application No. 63 / 363,473, filed on April 22, 2022, the entire contents of each of which are incorporated herein by reference. Technical Field

[0002] The present disclosure relates to point cloud encoding and decoding. Background Art

[0003] A point cloud is a collection of points in a three-dimensional space. These points can correspond to points on an object in the three-dimensional space. Therefore, a point cloud can be used to represent the physical content of the three-dimensional space. Point clouds can have utility in a wide variety of situations. For example, a point cloud can be used in the context of an autonomous vehicle to represent the location of an object on a road. In another example, a point cloud can be used in the context of representing the physical content of an environment in order to locate virtual objects in an augmented reality (AR) or mixed reality (MR) application. Point cloud compression is a process for encoding and decoding point clouds. Encoding a point cloud can reduce the amount of data required to store and send the point cloud. Summary of the invention

[0004] In general, the present disclosure describes techniques for an inter-prediction method for point cloud compression. The position of a point may be defined by a radius component, an azimuth component, and a laser identifier (ID) component. As part of encoding a point cloud, an encoder may determine a predictor of a point using intra-prediction or inter-prediction. The encoder may determine a residual component value of a current point as the difference between the position of the current point and the corresponding component of the predictor of the current point. The encoder may perform entropy encoding on a residual value, such as a value indicating a radius residual sign value or a value representing a radius or azimuth residual. As part of entropy encoding the residual value, the encoder selects a context. Previously, the context selection process did not consider whether the current point or a previously decoded point was inter-coded. Considering whether the current point or a previously decoded point is inter-coded may improve the context selection process, which may increase decoding efficiency. The decoder may select a context for decoding the residual value in the same manner.

[0005] Additionally, in some examples, the encoder may use a prediction buffer to store information used to generate a predictor. Previously, the process of updating the prediction buffer when a new point is decoded did not depend on whether the previous point was inter-coded. The present disclosure describes a technique in which the process of updating the prediction buffer depends on whether the previous point was inter-coded. This may allow a more accurate predictor to be generated, which may result in an increase in decoding efficiency.

[0006] In one example, the present disclosure describes a device for encoding a point cloud, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in a circuit and coupled to the memory, the one or more processors configured to: determine a sign of a radius residual of a current point of the point cloud; determine a context for entropy encoding a radius residual sign flag indicating the sign of the radius residual of the current point based on whether a previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded; and entropy encode the radius residual sign flag using the determined context.

[0007] In another example, the present disclosure describes a device for decoding point cloud data, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in a circuit and coupled to the memory, the one or more processors configured to: obtain an entropy-encoded radius residual symbol flag indicating a sign of a radius residual of a current point of the point cloud; determine a context for entropy decoding the radius residual symbol flag based on whether a previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded; entropy decode the radius residual symbol flag using the determined context; and reconstruct the position of the current point based on the radius residual symbol flag.

[0008] In another example, the present disclosure describes a method for encoding a point cloud, the method comprising: determining a sign of a radius residual of a current point of the point cloud; determining a context for entropy encoding a radius residual symbol flag indicating the sign of the radius residual of the current point, wherein determining the context for entropy encoding the radius residual symbol flag comprises: determining the context for entropy encoding the radius residual symbol flag based on whether a previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded; and entropy encoding the radius residual symbol flag using the determined context.

[0009] In another example, the present disclosure describes a method for decoding a point cloud, the method comprising: obtaining an entropy-encoded radius residual symbol flag indicating a symbol of a radius residual of a current point of the point cloud; determining a context for entropy decoding the radius residual symbol flag, wherein determining the context for entropy decoding the radius residual symbol flag comprises: determining the context for entropy decoding the radius residual symbol flag based on whether a previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded; entropy decoding the radius residual symbol flag using the determined context; and reconstructing the position of the current point based on the radius residual symbol flag.

[0010] In another example, the present disclosure describes a device for encoding a point cloud, the device comprising: a component for determining a sign of a radius residual of a current point of the point cloud; a component for determining a context for entropy encoding a radius residual symbol flag indicating the sign of the radius residual of the current point, wherein determining the context for entropy encoding the radius residual symbol flag comprises: determining the context for entropy encoding the radius residual symbol flag based on whether a previously decoded point is inter-coded and whether the current point is inter-coded; and a component for entropy encoding the radius residual symbol flag using the determined context.

[0011] In another example, the present disclosure describes a device for decoding a point cloud, the device comprising: a component for obtaining an entropy-encoded radius residual symbol flag indicating a sign of a radius residual of a current point of the point cloud; a component for determining a context for entropy decoding the radius residual symbol flag, wherein determining the context for entropy decoding the radius residual symbol flag comprises: determining the context for entropy decoding the radius residual symbol flag based on whether a previously decoded point is inter-coded and whether the current point is inter-coded; a component for entropy decoding the radius residual symbol flag using the determined context; and a component for reconstructing the position of the current point based on the radius residual symbol flag.

[0012] In another example, the present disclosure describes a device for encoding a point cloud, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in a circuit and coupled to the memory, the one or more processors configured to: determine a residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; determine a context for entropy encoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; and entropy encode the residual value using the determined context.

[0013] In another example, the present disclosure describes a device for decoding point cloud data, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors configured to: obtain an entropy-encoded residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; determine a context for entropy decoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; entropy decode the residual value using the determined context; and reconstruct the position of the current point based on the radius residual or the azimuth residual.

[0014] In another example, the present disclosure describes a method for encoding a point cloud, the method comprising: determining a residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; determining a context for entropy encoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; and entropy encoding the residual value using the determined context.

[0015] In another example, the present disclosure describes a method for decoding a point cloud, the method comprising: obtaining an entropy-encoded residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; determining a context for entropy decoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; entropy decoding the residual value using the determined context; and reconstructing the position of the current point based on the radius residual or the azimuth residual.

[0016] In another example, the present disclosure describes a device for decoding a point cloud, the device comprising: a component for determining a residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; a component for determining a context for entropy encoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; and a component for entropy encoding the residual value using the determined context.

[0017] In another example, the present disclosure describes a device for encoding a point cloud, the device comprising: a component for determining a residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; a component for determining a context for entropy encoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; and a component for entropy encoding the residual value using the determined context.

[0018] In another example, the present disclosure describes a device for encoding a point cloud, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in a circuit and coupled to the memory, the one or more processors configured to: after encoding a first point of the point cloud, update a prediction buffer comprising one or more coordinate pairs, each corresponding coordinate pair of the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein the one or more processors are configured as part of updating the prediction buffer: based on the first point being inter-frame predicted, setting a variable to an estimated radius residual value equal to a difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer; based on the variable The absolute value of the variable is greater than a threshold, a new coordinate pair is inserted into the prediction buffer, wherein the radius of the new coordinate pair is the reconstruction radius of the first point, and the azimuth of the new predictor is equal to the reconstruction azimuth of the first point; and based on the absolute value of the variable being not greater than the threshold, a specific coordinate pair in the prediction buffer is moved to the front of the prediction buffer, and the specific coordinate pair is updated with the reconstruction radius of the first point and the reconstruction azimuth of the first point, wherein based on the first point being inter-frame predicted, the specific coordinate pair is the first coordinate pair in the prediction buffer; based on the coordinate pair in the prediction buffer, one or more predictors for a second point of the point cloud are derived; a predictor for the second point is determined from the derived predictors; and a residual value for the second point is determined based on the determined predictor.

[0019] In another example, the present disclosure describes a device for decoding point cloud data, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in a circuit and coupled to the memory, the one or more processors configured to: after decoding a first point of the point cloud, update a prediction buffer comprising one or more coordinate pairs, each corresponding coordinate pair of the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein the one or more processors are configured as part of updating the prediction buffer: based on the first point being inter-predicted, setting a variable to an estimated radius residual value equal to a difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer; based on the The absolute value of the variable is greater than a threshold, a new coordinate pair is inserted into the prediction buffer, wherein the radius of the new coordinate pair is the reconstruction radius of the first point, and the azimuth of the new predictor is equal to the reconstruction azimuth of the first point; and based on the absolute value of the variable being not greater than the threshold, a specific coordinate pair in the prediction buffer is moved to the front of the prediction buffer, and the specific coordinate pair is updated with the reconstruction radius of the first point and the reconstruction azimuth of the first point, wherein based on the first point being inter-frame predicted, the specific coordinate pair is the first coordinate pair in the prediction buffer; based on the coordinate pair in the prediction buffer, one or more predictors for a second point of the point cloud are derived; a predictor for the second point is determined from among the derived predictors; and a position of the second point is reconstructed based on the determined predictor.

[0020] In another example, the present disclosure describes a method for encoding a point cloud, the method comprising: after encoding a first point of the point cloud, updating a prediction buffer comprising one or more coordinate pairs, each corresponding coordinate pair in the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein updating the prediction buffer comprises: based on the first point being inter-frame predicted, setting a variable to an estimated radius residual value equal to the difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer; and one of the following: based on the absolute value of the variable being greater than a threshold, inserting a new coordinate pair into the prediction buffer, wherein the radius of the new coordinate pair is the radius of the first point The method comprises the steps of: determining a reconstruction radius of the first point and an azimuth angle of the new predictor being equal to the reconstruction azimuth angle of the first point; or based on the absolute value of the variable being not greater than the threshold value, moving the specific coordinate pair in the prediction buffer to the front of the prediction buffer, and updating the specific coordinate pair with the reconstruction radius of the first point and the reconstruction azimuth angle of the first point, wherein the specific coordinate pair is the first coordinate pair in the prediction buffer based on the first point being inter-frame predicted; deriving one or more predictors for a second point of the point cloud based on the coordinate pair in the prediction buffer; determining a predictor for the second point from among the derived predictors; and determining a residual value for the second point based on the determined predictor.

[0021] In another example, the present disclosure describes a method for decoding a point cloud, the method comprising: after decoding a first point of the point cloud, updating a prediction buffer comprising one or more coordinate pairs, each corresponding coordinate pair in the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein updating the prediction buffer comprises: based on the first point being inter-frame predicted, setting a variable to an estimated radius residual value equal to the difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer; and one of the following: based on the absolute value of the variable being greater than a threshold, inserting a new coordinate pair into the prediction buffer, wherein the radius of the new coordinate pair is the radius of the first point. The invention relates to a method for determining a reconstruction radius of a point cloud, and an azimuth angle of the new predictor is equal to the reconstruction azimuth angle of the first point; and based on the absolute value of the variable being not greater than the threshold value, moving the specific coordinate pair in the prediction buffer to the front of the prediction buffer, and updating the specific coordinate pair with the reconstruction radius of the first point and the reconstruction azimuth angle of the first point, wherein the specific coordinate pair is the first coordinate pair in the prediction buffer based on that the first point is inter-frame predicted; deriving one or more predictors for a second point of the point cloud based on the coordinate pair in the prediction buffer; determining the predictor for the second point from among the derived predictors; and reconstructing the position of the second point based on the determined predictor.

[0022] In another example, the present disclosure describes a device for encoding a point cloud, the device comprising: a component for updating a prediction buffer containing one or more coordinate pairs after encoding a first point of the point cloud, each corresponding coordinate pair of the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein the component for updating the prediction buffer comprises: a component for setting a variable equal to an estimated radius residual value of a difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer based on that the first point is inter-frame predicted; a component for inserting a new coordinate pair into the prediction buffer based on an absolute value of the variable being greater than a threshold, wherein the radius of the new coordinate pair is the reconstructed radius of the first point; a reconstruction radius of the first point, and the azimuth of the new predictor is equal to the reconstruction azimuth of the first point; or a component for moving the specific coordinate pair in the prediction buffer to the front of the prediction buffer based on the absolute value of the variable being not greater than the threshold, and updating the specific coordinate pair with the reconstruction radius of the first point and the reconstruction azimuth of the first point, wherein based on the first point being inter-frame predicted, the specific coordinate pair is the first coordinate pair in the prediction buffer; a component for deriving one or more predictors for a second point of the point cloud based on the coordinate pair in the prediction buffer; a component for determining a predictor for the second point from among the derived predictors; and a component for determining a residual value of the second point based on the determined predictor.

[0023] In another example, the present disclosure describes a device for decoding a point cloud, the device comprising: a component for updating a prediction buffer containing one or more coordinate pairs after decoding a first point of the point cloud, each corresponding coordinate pair of the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein the component for updating the prediction buffer comprises: a component for setting a variable equal to an estimated radius residual value of a difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer based on that the first point is inter-frame predicted; a component for inserting a new coordinate pair into the prediction buffer based on an absolute value of the variable being greater than a threshold, wherein the radius of the new coordinate pair is the reconstructed radius of the first point; a reconstruction radius of the first point, and the azimuth of the new predictor is equal to the reconstruction azimuth of the first point; and a component for moving the specific coordinate pair in the prediction buffer to the front of the prediction buffer based on the absolute value of the variable being not greater than the threshold and updating the specific coordinate pair with the reconstruction radius of the first point and the reconstruction azimuth of the first point, wherein the specific coordinate pair is the first coordinate pair in the prediction buffer based on the first point being inter-frame predicted; a component for deriving one or more predictors for a second point of the point cloud based on the coordinate pair in the prediction buffer; a component for determining a predictor for the second point from among the derived predictors; and a component for reconstructing the position of the second point based on the determined predictor.

[0024] In another example, the present disclosure describes a non-transitory computer-readable storage medium having stored thereon instructions that, when executed, cause one or more processors to perform any of the methods of the present disclosure.

[0025] The details of one or more examples are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description and drawings, and from the claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] Figure 1 is a block diagram illustrating an example encoding and decoding system that may perform the techniques of this disclosure.

[0027] Figure 2 is a block diagram illustrating an example Geometric Point Cloud Compression (G-PCC) encoder.

[0028] Figure 3 is a block diagram illustrating an example G-PCC decoder.

[0029] Figure 4 is a conceptual diagram illustrating an example octree splitting for geometry coding.

[0030] Figure 5 is a conceptual diagram illustrating an example of a prediction tree.

[0031] Fig. 6A and Figure 6B is a conceptual diagram illustrating an example rotating LIDAR acquisition model.

[0032] Figure 7 is a conceptual diagram illustrating an example of inter-frame prediction of a current point (curPoint) from a point (interPredPt) in a reference frame.

[0033] Figure 8 is an example decoder flow chart.

[0034] Fig. 9 is a conceptual diagram illustrating an example of additional inter prediction sub-points obtained from a first point having an azimuth angle greater than an inter prediction sub-point.

[0035] Fig.10 is a conceptual diagram illustrating sampling of azimuth and radius using uniform quantization as in G-PCC version 1.

[0036] Fig.11 is a conceptual diagram illustrating non-uniform quantization of azimuth angles resulting in uniform quantization arcs.

[0037] Fig.12 This is an example using Δφ arc Conceptual diagram of uniform quantization with circular arcs of quantization steps.

[0038] Fig.13 is a conceptual diagram illustrating an example process of entropy encoding a quantized residual azimuth using a bound B.

[0039] Fig.14 is a conceptual diagram illustrating an example of a laser detecting two different objects.

[0040] Fig.15 is a flow chart illustrating an example encoding method of the magnitude of the radius residual.

[0041] Fig.16 is a flow chart illustrating an example decoding method of the magnitude of the radius residual.

[0042] Fig.17 is a flow diagram illustrating example operation of an encoder that selects a context for entropy encoding a radius residual symbol based on whether a previous prediction point was encoded using inter-frame prediction, in accordance with one or more techniques of this disclosure.

[0043] Fig.18 is a flow diagram illustrating example operation of a decoder that selects a context for entropy decoding a radius residual symbol based on whether a previous prediction point was encoded using inter prediction, in accordance with one or more techniques of this disclosure.

[0044] Fig.19 is a flow diagram illustrating example operation of an encoder in accordance with one or more techniques of this disclosure, wherein the encoder determines a context for entropy encoding residual values.

[0045] Fig. 20 is a flow diagram illustrating example operation of a decoder in accordance with one or more techniques of this disclosure, wherein the decoder determines a context for entropy decoding residual values.

[0046] Fig.21 is a flow diagram illustrating example operation of an encoder in which the encoder updates a prediction buffer, in accordance with one or more techniques of this disclosure.

[0047] Fig. 22 is a flow diagram illustrating example operation of a decoder in which the decoder updates a prediction buffer, in accordance with one or more techniques of this disclosure.

[0048] Fig.23 is a conceptual diagram illustrating an example ranging system that may be used with one or more techniques of this disclosure.

[0049] Fig.24 is a conceptual diagram illustrating an example vehicle-based scenario in which one or more techniques of this disclosure may be used.

[0050] Fig.25is a conceptual diagram illustrating an example extended reality system in which one or more techniques of this disclosure may be used.

[0051] Fig.26 is a conceptual diagram illustrating an example mobile device system in which one or more techniques of this disclosure may be employed. DETAILED DESCRIPTION

[0052] In general, the present disclosure describes techniques for an inter-prediction method for point cloud compression. The position of a point may be defined by a radius component, an azimuth component, and a laser identifier (ID) component. As part of encoding a point cloud, an encoder may determine a predictor of a point using intra-prediction or inter-prediction. The encoder may determine a residual component value of the current point as the difference between the position of the current point and the corresponding component of the predictor of the current point. The encoder may perform entropy encoding on a residual value, such as a value indicating a radius residual sign value or a value representing a radius or azimuth residual. As part of entropy encoding the residual value, the encoder selects a context. Previously, the context selection process did not consider whether the current point or a previously decoded point was inter-coded. Considering whether the current point or a previously decoded point is inter-coded may improve the context selection process, which may increase decoding efficiency. The decoder may select a context for decoding the residual value in the same manner.

[0053] Thus, in some examples, the encoder may determine the sign of the radius residual of the current point of the point cloud. The encoder may also determine the context for entropy encoding the radius residual sign flag indicating the sign of the radius residual of the current point based on whether the previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded. The encoder may entropy encode the radius residual sign flag using the determined context. Similarly, the decoder may obtain the entropy encoded radius residual sign flag indicating the sign of the radius residual of the current point of the point cloud. The decoder may determine the context for entropy decoding the radius residual sign flag based on whether the previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded. The decoder may entropy decode the radius residual sign flag using the determined context. The decoder may reconstruct the position of the current point based on the radius residual sign flag.

[0054] In some examples, the encoder may determine a residual value associated with the current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual. The encoder may determine a context for entropy encoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction. In addition, the encoder may entropy encode the residual value using the determined context. Similarly, the decoder may obtain an entropy-encoded residual value associated with the current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual. The decoder may determine a context for entropy decoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction. The decoder may entropy decode the residual value using the determined context. The decoder may reconstruct the position of the current point based on the radius residual or the azimuth residual.

[0055] Additionally, in some examples, the encoder may use a prediction buffer to store information used to generate a predictor. Previously, the process of updating the prediction buffer when a new point is decoded did not depend on whether the previous point was inter-coded. The present disclosure describes a technique in which the process of updating the prediction buffer depends on whether the previous point was inter-coded. This may allow for more accurate predictors to be stored, which may result in an increase in decoding efficiency.

[0056] Thus, in some examples, after encoding the first point of the point cloud, the encoder may update a prediction buffer containing a list of one or more coordinate pairs. Each corresponding coordinate pair in the one or more coordinate pairs indicates a corresponding radius and a corresponding azimuth. As part of updating the prediction buffer, the encoder may set a variable equal to an estimated radius residual value of the difference between the reconstructed radius of the first point and the radius value currently in the prediction buffer based on the first point being inter-frame predicted. Based on the absolute value of the variable being greater than a threshold, the encoder may insert a new coordinate pair into the prediction buffer, wherein the radius of the new coordinate pair is the reconstructed radius of the first point, and the azimuth of the new predictor is equal to the reconstructed azimuth of the first point. The encoder may remove the last coordinate pair in the list of coordinates in the prediction buffer. In addition, the encoder may move all coordinate pairs with indexes 0 to N-2 to indexes 1 to N-1, respectively, where N is the number of coordinate pairs in the list. Based on the absolute value of the variable not greater than the threshold, the encoder may move a specific coordinate pair in the prediction buffer to the front of the prediction buffer, and may update the specific coordinate pair with the reconstructed radius of the first point and the reconstructed azimuth of the first point. In an instance where the first point is decoded using intra prediction, the updated particular coordinate pair is a coordinate pair used to predict the first point. In an instance where the first point is decoded using inter prediction, the updated particular coordinate pair is the first coordinate pair in the list. The encoder may derive one or more predictors for a second point of the point cloud based on the coordinate pairs in the prediction buffer. The encoder may determine a predictor for the second point from among the derived predictors. Additionally, the encoder may determine a residual value for the second point based on the determined predictor. The decoder may update the prediction buffer in the same or similar manner.

[0057] Figure 1 is a block diagram illustrating an example encoding and decoding system 100 that can perform the techniques of the present disclosure. The techniques of the present disclosure are generally related to decoding (encoding and / or decoding) point cloud data, that is, supporting point cloud compression. Generally speaking, point cloud data includes any data used to process point clouds. The decoding can be effective in compressing and / or decompressing point cloud data.

[0058] like Figure 1 As shown in FIG. 1 , system 100 includes a source device 102 and a destination device 116. Source device 102 provides encoded point cloud data to be decoded by destination device 116. Specifically, in FIG. Figure 1In the example of , source device 102 provides point cloud data to destination device 116 via computer-readable medium 110. Source device 102 and destination device 116 may include any of a wide range of devices, including desktop computers, notebook (i.e., laptop) computers, tablet computers, set-top boxes, telephone handsets (such as smartphones), televisions, cameras, display devices, digital media players, video game consoles, video streaming devices, ground or sea vehicles, spacecraft, aircraft, robots, LIDAR devices, satellites, etc. In some cases, source device 102 and destination device 116 may be equipped for wireless communication.

[0059] exist Figure 1 In the example of , the source device 102 includes a data source 104, a memory 106, a G-PCC encoder 200, and an output interface 108. The destination device 116 includes an input interface 122, a G-PCC decoder 300, a memory 120, and a data consumer 118. According to the present disclosure, the G-PCC encoder 200 of the source device 102 and the G-PCC decoder 300 of the destination device 116 can be configured to apply the techniques of the present disclosure related to the inter-frame prediction method for point cloud compression. Therefore, the source device 102 represents an example of an encoding device, and the destination device 116 represents an example of a decoding device. In other examples, the source device 102 and the destination device 116 may include other components or arrangements. For example, the source device 102 may receive data (e.g., point cloud data) from an internal source or an external source. Similarly, the destination device 116 can interface with an external data consumer without including the data consumer in the same device. The present disclosure may simply refer to the G-PCC encoder 200 as the encoder 200 and the G-PCC decoder 300 as the decoder 300 .

[0060] like Figure 1 The system 100 shown in is only an example. In general, other digital encoding and / or decoding devices can perform the techniques related to the inter-frame prediction method for point cloud compression disclosed in the present invention. The source device 102 and the destination device 116 are only examples of such devices, wherein the source device 102 generates decoded data for sending to the destination device 116. The present disclosure refers to a "decoding" device as a device that performs decoding (encoding and / or decoding) of data. Therefore, the G-PCC encoder 200 and the G-PCC decoder 300 represent examples of decoding devices, specifically, encoders and decoders, respectively. In some examples, the source device 102 and the destination device 116 can operate in a substantially symmetrical manner, so that each of the source device 102 and the destination device 116 includes an encoding component and a decoding component. Therefore, the system 100 can support one-way or two-way transmission between the source device 102 and the destination device 116, for example, for streaming, playback, broadcasting, telephone, navigation and other applications.

[0061] Generally speaking, the data source 104 represents the source of the data (i.e., the original, unencoded point cloud data), and can provide a series of sequential "frames" of data to the G-PCC encoder 200, which encodes the data of the frame. The data source 104 of the source device 102 can include any of a point cloud capture device, such as various cameras or sensors (e.g., a 3D scanner or a light detection and ranging (LIDAR) device), one or more cameras, an archive containing previously captured data, and / or a data feed interface receiving data from a data content provider. Alternatively or in addition, the point cloud data can be generated from a scanner, camera, sensor, or other data computer. For example, the data source 104 can generate computer graphics-based data as source data, or generate a combination of real-time data, archived data, and computer-generated data. In each case, the G-PCC encoder 200 encodes the captured data, pre-captured data, or computer-generated data. The G-PCC encoder 200 can rearrange the frames from the received order (sometimes referred to as "display order") to a decoding order for decoding. G-PCC encoder 200 may generate one or more bitstreams including the encoded data. Source device 102 may then output the encoded data onto computer-readable medium 110 via output interface 108 for receipt and / or retrieval by input interface 122 of destination device 116, for example.

[0062] The memory 106 of the source device 102 and the memory 120 of the destination device 116 can represent general purpose memory. In some examples, the memory 106 and the memory 120 can store original data, for example, original data from the data source 104 and original, decoded data from the G-PCC decoder 300. In addition or alternatively, the memory 106 and the memory 120 can store software instructions that can be executed by, for example, the G-PCC encoder 200 and the G-PCC decoder 300, respectively. Although the memory 106 and the memory 120 are shown as being separated from the G-PCC encoder 200 and the G-PCC decoder 300 in this example, it should be understood that the G-PCC encoder 200 and the G-PCC decoder 300 can also include internal memory for functionally similar or equivalent purposes. In addition, the memory 106 and the memory 120 can store encoded data, for example, output from the G-PCC encoder 200 and input to the G-PCC decoder 300. In some examples, portions of memory 106 and memory 120 may be allocated as one or more buffers, for example, to store raw, decoded, and / or encoded data.For example, memory 106 and memory 120 may store data representing a point cloud, such as point cloud data.

[0063] The computer-readable medium 110 may represent any type of medium or device capable of transmitting the encoded data from the source device 102 to the destination device 116. In one example, the computer-readable medium 110 represents a communication medium for enabling the source device 102 to transmit the encoded data directly to the destination device 116 in real time, for example, via a radio frequency network or a computer-based network. The output interface 108 may modulate a transmit signal including the encoded data, and the input interface 122 may demodulate the received transmit signal according to a communication standard (such as a wireless communication protocol). The communication medium may include any wireless or wired communication medium, such as a radio frequency (RF) spectrum or one or more physical transmission lines. The communication medium may form part of a packet-based network such as a local area network, a wide area network, or a global network such as the Internet. The communication medium may include a router, a switch, a base station, or any other equipment that may be useful for facilitating communication from the source device 102 to the destination device 116.

[0064] In some examples, source device 102 may output the encoded data from output interface 108 to storage device 112. Similarly, destination device 116 may access the encoded data from storage device 112 via input interface 122. Storage device 112 may include any of a variety of distributed or locally accessed data storage media, such as a hard drive, Blu-ray disc, DVD, CD-ROM, flash memory, volatile or non-volatile memory, or any other suitable digital storage medium for storing encoded data.

[0065] In some examples, source device 102 may output the encoded data to file server 114 or another intermediate storage device that may store the encoded data generated by source device 102. Destination device 116 may access the stored data from file server 114 via streaming or downloading. File server 114 may be any type of server device capable of storing encoded data and sending the encoded data to destination device 116. File server 114 may represent a web server (e.g., for a website), a file transfer protocol (FTP) server, a content delivery network device, or a network attached storage (NAS) device. Destination device 116 may access the encoded data from file server 114 via any standard data connection including an Internet connection. This may include a wireless channel (e.g., a Wi-Fi connection), a wired connection (e.g., a digital subscriber line (DSL), a cable modem, etc.), or a combination of the two suitable for accessing the encoded data stored on file server 114. File server 114 and input interface 122 may be configured to operate according to a streaming transmission protocol, a download transmission protocol, or a combination thereof.

[0066] Output interface 108 and input interface 122 may represent wireless transmitters / receivers, modems, wired networking components (e.g., Ethernet cards), wireless communication components that operate according to any of the various IEEE 802.11 standards, or other physical components. In examples where output interface 108 and input interface 122 include wireless components, output interface 108 and input interface 122 may be configured to transmit data (such as encoded data) according to a cellular communication standard (such as 4G, 4G-LTE (Long Term Evolution), Advanced LTE, 5G, etc.). In some examples where output interface 108 includes a wireless transmitter, output interface 108 and input interface 122 may be configured to transmit data (such as encoded data) according to other wireless standards (such as IEEE 802.11 specifications, IEEE 802.15 specifications (e.g., ZigBee TM ),Bluetooth TM Standards, etc.) to send data (such as encoded data). In some examples, source device 102 and / or destination device 116 may include corresponding system-on-chip (SoC) devices. For example, source device 102 may include a SoC device for performing functionality attributed to G-PCC encoder 200 and / or output interface 108, and destination device 116 may include a SoC device for performing functionality attributed to G-PCC decoder 300 and / or input interface 122.

[0067] The techniques of this disclosure may be applicable to encoding and decoding to support any of a variety of applications, such as communications between autonomous vehicles, communications between scanners, cameras, sensors and processing devices (such as local or remote servers), geographic mapping, or other applications.

[0068] The input interface 122 of the destination device 116 receives an encoded bitstream from the computer-readable medium 110 (e.g., a communication medium, a storage device 112, a file server 114, etc.). The encoded bitstream may include signaling information defined by the G-PCC encoder 200 and also used by the G-PCC decoder 300, such as syntax elements with values ​​describing characteristics and / or processing of a coding unit (e.g., a slice, a picture, a group of pictures, a sequence, etc.). The data consumer 118 uses the decoded data. For example, the data consumer 118 may use the decoded data to determine the location of a physical object. In some examples, the data consumer 118 may include a display for presenting an image based on a point cloud.

[0069] The G-PCC encoder 200 and the G-PCC decoder 300 can each be implemented as any of various suitable encoder and / or decoder circuits, such as one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), discrete logic, software, hardware, firmware, or any combination thereof. When the technology is partially implemented in software, the device can store instructions for the software in an appropriate non-transient computer-readable medium, and use one or more processors to execute the instructions in hardware to perform the technology of the present disclosure. Each of the G-PCC encoder 200 and the G-PCC decoder 300 may be included in one or more encoders or decoders, any of which may be integrated as part of a combined encoder / decoder (CODEC) in a corresponding device. The device including the G-PCC encoder 200 and / or the G-PCC decoder 300 may include one or more integrated circuits, microprocessors, and / or other types of devices.

[0070] The G-PCC encoder 200 and the G-PCC decoder 300 may operate in accordance with a coding standard such as the Video Point Cloud Compression (V-PCC) standard or the Geometric Point Cloud Compression (G-PCC) standard. The present disclosure may generally relate to the coding (e.g., encoding and decoding) of a picture, thereby including the process of encoding or decoding data. The coded bitstream typically includes a series of values ​​for syntax elements that represent coding decisions (e.g., decoding modes).

[0071] The present disclosure may generally involve "signaling" certain information (such as syntax elements). The term "signaling" may generally refer to the communication of values ​​for syntax elements and / or other data used to decode encoded data. That is, the G-PCC encoder 200 may signal values ​​for syntax elements in a bitstream. Generally speaking, signaling refers to generating a value in a bitstream. As noted above, the source device 102 may transmit the bitstream to the destination device 116 in substantially real time or in non-real time (such as may occur when storing syntax elements to the storage device 112 for subsequent retrieval by the destination device 116).

[0072] ISO / IEC MPEG (JTC 1 / SC 29 / WG 11) is investigating the potential need for standardization of point cloud coding technology with significantly greater compression capabilities than current approaches and will work to create such a standard. The group is working together in a collaboration called the 3D Graphics Group (3DG) to evaluate compression technology designs proposed by experts in the field.

[0073] Point cloud compression activities are categorized into two different approaches. The first approach is "Video Point Cloud Compression" (V-PCC), which segments 3D objects and projects these segments into multiple 2D planes (which are represented as "patches" in 2D frames), which are further decoded by legacy 2D video codecs such as the High Efficiency Video Coding (HEVC) (ITU-T H.265) codec. The second approach is "Geometry-based Point Cloud Compression" (G-PCC), which directly compresses 3D geometry (i.e., the positions of a set of points in 3D space) and associated attribute values ​​(for each point associated with the 3D geometry). G-PCC addresses the compression of point clouds in both category 1 (static point clouds) and category 3 (dynamically acquired point clouds).

[0074] A point cloud contains a collection of points in 3D space and may have attributes associated with the points. The attributes may be color information such as R, G, B or Y, Cb, Cr, or reflectivity information, or other attributes. Point clouds may be captured by various cameras or sensors (such as LIDAR sensors and 3D scanners), and may also be computer generated. Point cloud data is used in a variety of applications, including but not limited to architecture (modeling), graphics (3D models for visualization and animation), and the automotive industry (LIDAR sensors to aid navigation).

[0075] The 3D space occupied by the point cloud data can be enclosed by a virtual bounding box. The position of a point in the bounding box can be represented by a certain precision; therefore, the position of one or more points can be quantified based on the precision. At the smallest level, the bounding box is split into voxels, which are the smallest spatial units represented by a unit cube. A voxel in a bounding box can be associated with zero, one, or more than one point. The bounding box can be split into multiple cube / cuboid regions, which can be referred to as tiles. Each tile can be decoded into one or more slices. The division of the bounding box into slices and tiles can be based on the number of points in each partition, or based on other considerations (for example, a particular area can be decoded as a tile). The slice area can be further divided using splitting decisions similar to those in a video codec.

[0076] Figure 2 An overview of the G-PCC encoder 200 is provided. Figure 3 An overview of a G-PCC decoder 300 is provided. The modules shown are logical and do not necessarily correspond one-to-one with the implemented code in the reference implementation of the G-PCC codec, ie, the TMC13 test model software developed by ISO / IECMPEG (JTC 1 / SC 29 / WG 11).

[0077] In both the G-PCC encoder 200 and the G-PCC decoder 300, the point cloud positions are first decoded. The attribute decoding depends on the decoded geometry. Figure 2 and Figure 3 , the surface approximation analysis unit 212, the region adaptive hierarchical transform (RAHT) unit 218, the surface approximation synthesis unit 310, and the RAHT unit 314 are options that are usually used for category 1 data. The LOD generation unit 220, the lifting unit 222, the LOD generation unit 316, and the inverse lifting unit 318 are options that are usually used for category 3 data. All other modules are common between category 1 and category 3.

[0078] For category 3 data, the compressed geometry is typically represented as an octree from the root all the way down to the leaf level for individual voxels. For category 1 data, the compressed geometry is typically represented by a pruned octree (i.e., an octree from the root to the leaf level for blocks larger than a voxel) plus a model that approximates the surface within each leaf of the pruned octree. In this way, both category 1 and category 3 data share the octree decoding mechanism, while category 1 data can additionally approximate the voxels within each leaf with a surface model. The surface model used is a triangulation that includes 1-10 triangles per block, forming a set of triangles. Therefore, category 1 geometry codecs are called Trisoup geometry codecs, while category 3 geometry codecs are called Octree geometry codecs.

[0079] At each node of the octree, occupancy is signaled for one or more of its child nodes (up to eight nodes) (when not inferred). Multiple neighborhoods are specified, including (a) nodes that share faces with the current octree node, (b) nodes that share faces, edges, or vertices with the current octree node, etc. Within each neighborhood, the occupancy of the node and / or its child nodes can be used to predict the occupancy of the current node or its child nodes. For points that are sparsely populated in certain nodes of the octree, the codec also supports a direct decoding mode in which the 3D position of the point is encoded directly. A flag can be signaled to indicate that the direct mode is signaled. At the lowest level, the number of points associated with the octree node / leaf node can also be decoded.

[0080] Once the geometry is decoded, the attributes corresponding to the geometry point are decoded. When there are multiple attribute points corresponding to one reconstructed / decoded geometry point, the attribute values ​​representing the reconstructed point can be derived.

[0081] There are three attribute decoding methods in G-PCC: Region Adaptive Hierarchical Transform (RAHT) decoding, interpolation-based hierarchical nearest neighbor prediction (prediction transform), and interpolation-based hierarchical nearest neighbor prediction with an update / lifting step (lifting transform). RAHT and lifting are typically used for class 1 data, while prediction is typically used for class 3 data. However, either method can be used for any data, and just like the geometry codec in G-PCC, the attribute decoding method used to decode point clouds is specified in the bitstream.

[0082] The decoding of attributes can be performed in levels of detail (LOD), where each level of detail can obtain a more refined representation of the point cloud attributes. Each level of detail can be specified based on a distance metric to neighboring nodes or based on a sampling distance.

[0083] At the G-PCC encoder 200, the residual obtained as the output of the attribute coding method can be quantized. The residual can be obtained by subtracting the attribute value from a prediction derived from the attribute value of a point in the neighborhood of the current point and based on a previously encoded point. The quantized residual can be decoded using context adaptive arithmetic coding.

[0084] exist Figure 2 In the example of , the G-PCC encoder 200 may include a coordinate transform unit 202, a color transform unit 204, a voxelization unit 206, a prediction tree construction unit 207, an attribute transmission unit 208, an octree analysis unit 210, a surface approximation analysis unit 212, an arithmetic coding unit 214, a geometric reconstruction unit 216, a RAHT unit 218, an LOD generation unit 220, a lifting unit 222, a coefficient quantization unit 224, and an arithmetic coding unit 226. Figure 2 In the example of , the octree analysis unit 210 includes an encoding prediction unit 211 and a prediction buffer 213.

[0085] like Figure 2 As shown in the example of , the G-PCC encoder 200 can obtain a set of positions and a set of attributes of points in the point cloud. The G-PCC encoder 200 can obtain the position set and attribute set of points in the point cloud from the data source 104 ( Figure 1 ) obtains a set of positions and a set of attributes of points in a point cloud. The positions may include the coordinates of the points in the point cloud. The attributes may include information about the points in the point cloud, such as the color associated with the points in the point cloud. The G-PCC encoder 200 may generate a geometry bitstream 203 including an encoded representation of the positions of the points in the point cloud. The G-PCC encoder 200 may also generate an attribute bitstream 205 including an encoded representation of the attribute set.

[0086] The coordinate transformation unit 202 may apply a transformation to the coordinates of the point to transform the coordinates from the initial domain to the transformed domain. The present disclosure may refer to the transformed coordinates as transformed coordinates. The color transformation unit 204 may apply a transformation to transform the color information of the attribute to a different domain. For example, the color transformation unit 204 may transform the color information from the RGB color space to the YCbCr color space.

[0087] In addition, Figure 2 In the example of , the voxelization unit 206 can voxelize the transformed coordinates. Voxelization of the transformed coordinates can include quantizing and removing some points in the point cloud. In other words, multiple points in the point cloud can be included in a single "voxel", which can then be treated as a point in some aspects.

[0088] The prediction tree construction unit 207 may be configured to generate a prediction tree based on the voxelized transformed coordinates. The prediction tree construction unit 207 may be configured to perform any of the prediction tree coding techniques described above in an intra prediction mode or an inter prediction mode. In order to perform prediction tree coding using inter prediction, the prediction tree construction unit 207 may access points of previously encoded frames from the geometry reconstruction unit 216. The arithmetic coding unit 214 may entropy encode syntax elements representing the encoded prediction tree.

[0089] Instead of performing prediction tree-based decoding, the G-PCC encoder 200 may perform octree-based encoding. The octree analysis unit 210 may generate an octree based on voxelized transformed coordinates. Figure 2 In the example of , the surface approximation analysis unit 212 can analyze the points to potentially determine a surface representation of the set of points. The arithmetic coding unit 214 can entropy encode syntax elements representing the octree and / or information of the surface determined by the surface approximation analysis unit 212. The G-PCC encoder 200 can output these syntax elements in a geometry bitstream 203. The geometry bitstream 203 can also include other syntax elements, including syntax elements that are not arithmetically coded.

[0090] The geometric reconstruction unit 216 may reconstruct the transformed coordinates of the points in the point cloud based on the octree, the data indicating the surface determined by the surface approximation analysis unit 212, and / or other information. Due to voxelization and surface approximation, the number of transformed coordinates reconstructed by the geometric reconstruction unit 216 may be different from the number of original points in the point cloud. The present disclosure may refer to the resulting points as reconstructed points. The attribute transfer unit 208 may transfer the attributes of the original points in the point cloud to the reconstructed points in the point cloud.

[0091] In addition, the RAHT unit 218 may apply RAHT decoding to the attributes of the reconstruction point. In some examples, according to RAHT, the attributes of the block of 2×2×2 point positions are obtained and transformed along one direction to obtain four low-frequency nodes (L) and four high-frequency nodes (H). Subsequently, the four low-frequency nodes (L) are transformed in the second direction to obtain two low-frequency nodes (LL) and two high-frequency nodes (LH). The two low-frequency nodes (LL) are transformed along the third direction to obtain one low-frequency node (LLL) and one high-frequency node (LLH). The low-frequency node LLL corresponds to the DC coefficient, and the high-frequency nodes H, LH and LLH correspond to the AC coefficient. The transformation in each direction may be a 1-D transformation with two coefficient weights. The low-frequency coefficients may be obtained as coefficients for the next higher-level 2×2×2 block for the RAHT transform, and the AC coefficients may be encoded without change; such transformations continue until the top root node. The weights to be used for these coefficients are calculated using a tree traversal for encoding from top to bottom; the transformation order is bottom-up. Then, these coefficients may be quantized and decoded.

[0092] Alternatively or in addition, the LOD generation unit 220 and the lifting unit 222 may apply LOD processing and lifting to the attributes of the reconstructed points, respectively. LOD generation is used to split the attributes into different refinement levels. Each refinement level provides a refinement of the attributes of the point cloud. The first refinement level provides a rough approximation and contains few points; subsequent refinement levels typically contain more points, and so on. The refinement level can be constructed using a distance-based metric, or one or more other classification criteria (e.g., subsampling from a specific order) can also be used. Therefore, all reconstructed points can be included in the refinement level. Each level of detail is generated by taking the union of all points up to a specific refinement level: for example, LOD1 is obtained based on the refinement level RL1, LOD2 is obtained based on RL1 and RL2, ..., and LODN is obtained by the union of RL1, RL2, ..., RLN. In some cases, LOD generation can be followed by a prediction scheme (e.g., a prediction transform) in which the attributes associated with each point in the LOD are predicted based on a weighted average of previous points and the residual is quantized and entropy decoded. The lifting scheme is built on top of the predictive transform mechanism, in which update operators are used to update coefficients and adaptive quantization of coefficients is performed.

[0093] The RAHT unit 218 and the lifting unit 222 may generate coefficients based on these attributes. The coefficient quantization unit 224 may quantize the coefficients generated by the RAHT unit 218 or the lifting unit 222. The arithmetic coding unit 226 may apply arithmetic coding to the syntax elements representing the quantized coefficients. The G-PCC encoder 200 may output these syntax elements in the attribute bitstream 205. The attribute bitstream 205 may also include other syntax elements, including syntax elements that are not arithmetically coded.

[0094] exist Figure 3 In the example of , the G-PCC decoder 300 may include a geometry arithmetic decoding unit 302, an attribute arithmetic decoding unit 304, an octree synthesis unit 306, an inverse quantization unit 308, a surface approximation synthesis unit 310, a geometry reconstruction unit 312, a RAHT unit 314, a LoD generation unit 316, an inverse lifting unit 318, an inverse transform coordinate unit 320, and an inverse transform color unit 322. The geometry reconstruction unit 312 may include a prediction unit 313 and a prediction buffer 315.

[0095] The G-PCC decoder 300 may obtain the geometry bitstream 203 and the attribute bitstream 205. The geometry arithmetic decoding unit 302 of the decoder 300 may apply arithmetic decoding (e.g., context adaptive binary arithmetic coding (CABAC), exponential Golomb decoding, or other types of arithmetic decoding) to the syntax elements in the geometry bitstream 203. Similarly, the attribute arithmetic decoding unit 304 may apply arithmetic decoding to the syntax elements in the attribute bitstream 205.

[0096] The octree synthesis unit 306 can synthesize an octree based on the syntax elements parsed from the geometry bitstream 203. Starting from the root node of the octree, the occupancy of each of the eight child nodes at each octree level is signaled in the bitstream. When the signaling indicates that the child node at a specific octree level is occupied, the occupancy of the child nodes of the child node is signaled. Before advancing to the subsequent octree level, the signaling of the nodes at each octree level is signaled. At the last level of the octree, each node corresponds to a voxel position; when a leaf node is occupied, one or more points can be designated as occupied at the voxel position. In some instances, due to quantization, some branches of the octree may terminate earlier than the final level. In such cases, the leaf node is considered to be an occupied node that has no child nodes. In an example where surface approximation is used in the geometry bitstream 203, the surface approximation synthesis unit 310 can determine a surface model based on the syntax elements parsed from the geometry bitstream 203 and based on the octree.

[0097] In addition, the geometric reconstruction unit 312 can perform reconstruction to determine the coordinates of the points in the point cloud. For each position at a leaf node of the octree, the geometric reconstruction unit 312 can reconstruct the node position by using the binary representation of the leaf node in the octree. At each corresponding leaf node, the number of points at the corresponding leaf node is signaled; this indicates the number of duplicate points at the same voxel position. When geometric quantization is used, the point position is scaled to determine the reconstructed point position value.

[0098] The inverse transform coordinate unit 320 can apply an inverse transform to the reconstructed coordinates to convert the reconstructed coordinates (positions) of the points in the point cloud from the transform domain back to the original domain. The positions of the points in the point cloud can be in the floating point domain, but the point positions in the G-PCC codec are decoded in the integer domain. The inverse transform can be used to convert these positions back to the original domain.

[0099] In addition, Figure 3 In the example of , the inverse quantization unit 308 may inverse quantize the property value. The property value may be based on syntax elements obtained from the property bitstream 205 (eg, including syntax elements decoded by the property arithmetic decoding unit 304).

[0100] Depending on how the attribute value is encoded, the RAHT unit 314 may perform RAHT decoding to determine the color value of a point in the point cloud based on the inverse quantized attribute value. RAHT decoding is performed from the top to the bottom of the tree. At each level, the component values ​​are derived using the low-frequency coefficients and high-frequency coefficients derived from the inverse quantization process. At the leaf node, the derived value corresponds to the attribute value of the coefficient. The weight derivation process of the point is similar to the process used at the G-PCC encoder 200. Alternatively, the LOD generation unit 316 and the inverse lifting unit 318 may use a detail level-based technique to determine the color value of a point in the point cloud. The LOD generation unit 316 decodes each LOD, thereby giving a progressively finer representation of the attribute of the point. In the case of a predictive transform, the LOD generation unit 316 derives a prediction for the point from the weighted sum of the points previously reconstructed in the previous LOD or in the same LOD. The LOD generation unit 316 may add the prediction to the residual (which is obtained after inverse quantization) to obtain the reconstructed value of the attribute. When a lifting scheme is used, the LOD generation unit 316 may also include an update operator to update coefficients used to derive the property value. In this case, the LOD generation unit 316 may also apply inverse adaptive quantization.

[0101] In addition, Figure 3In the example of , the inverse color transform unit 322 can apply an inverse color transform to the color value. The inverse color transform can be the inverse of the color transform applied by the color transform unit 204 of the encoder 200. For example, the color transform unit 204 can transform the color information from the RGB color space to the YCbCr color space. Therefore, the inverse color transform unit 322 can transform the color information from the YCbCr color space to the RGB color space.

[0102] Example Figure 2 and Figure 3 Various units are provided to assist in understanding the operations performed by the encoder 200 and the decoder 300. The units may be implemented as fixed-function circuits, programmable circuits, or a combination thereof. Fixed-function circuits refer to circuits that provide specific functionality and pre-set the operations that can be performed. Programmable circuits refer to circuits that can be programmed to perform various tasks and provide flexible functionality in the operations that can be performed. For example, a programmable circuit may execute software or firmware that causes the programmable circuit to operate in a manner defined by the instructions of the software or firmware. Fixed-function circuits may execute software instructions (e.g., to receive parameters or output parameters), but the types of operations performed by fixed-function circuits are generally immutable. In some examples, one or more of the units may be different circuit blocks (fixed-function or programmable), and in some examples, one or more of the units may be integrated circuits.

[0103] For geometry, there are two different types of decoding techniques: octree and prediction tree decoding. In the following, we focus on octree decoding. For category 3 data, compressed geometry is usually represented as an octree from the root to the leaf level of individual voxels. For category 1 data, compressed geometry is usually represented by a pruned octree (i.e., an octree from the root to the leaf level of a block larger than a voxel) plus a model of the surface within each leaf of the pruned octree. In this way, both category 1 data and category 3 data share the octree decoding mechanism, while category 1 data can additionally approximate the voxels within each leaf with a surface model (called trisoup decoding). The surface model used is a triangulation of 1-10 triangles per block, thereby forming a triangle set. At each node of the octree, one or more of its child nodes (up to eight nodes) are signaled for occupancy (when not inferred). Multiple neighborhoods are specified, including (a) nodes that share faces with the current octree node, (b) nodes that share faces, edges or vertices with the current octree node, etc. Within each neighborhood, the occupancy of the node and / or its children can be used to predict the occupancy of the current node or its children. For points that are sparsely populated in certain nodes of the octree, the codec also supports a direct decoding mode in which the 3D position of the point is encoded directly. A flag can be signaled to indicate that the direct mode is signaled. At the lowest level, the number of points associated with an octree node / leaf node can also be decoded. Figure 4 is a conceptual diagram illustrating an example octree splitting for geometry coding.

[0104] Once the geometry is decoded, the attributes corresponding to the geometry point are decoded. When there are multiple attribute points corresponding to one reconstructed / decoded geometry point, the attribute values ​​representing the reconstructed point can be derived.

[0105] There are three attribute decoding methods in G-PCC: Region Adaptive Hierarchical Transform (RAHT) decoding, interpolation-based hierarchical nearest neighbor prediction (prediction transform), and interpolation-based hierarchical nearest neighbor prediction with an update / lifting step (lifting transform). RAHT and lifting are typically used for class 1 data, while prediction is typically used for class 3 data. However, either method can be used for any data, and just like the geometry codec in G-PCC, the attribute decoding method used to decode point clouds is specified in the bitstream.

[0106] The decoding of the attributes can be performed in detail levels, where each detail level can obtain a more refined representation of the point cloud attributes. Each detail level can be specified based on a distance metric to neighboring nodes or based on a sampling distance.

[0107] At the encoder 200, a residual obtained as an output of a decoding method for a property is quantized and decoded using context-adaptive arithmetic decoding such as CABAC decoding. In order to apply CABAC coding to a syntax element, the encoder 200 may binarize the value of the syntax element to form a series of one or more bits, which are referred to as "bins". In addition, the encoder 200 may identify a decoding context. The decoding context may identify the probability of a binary bit having a specific value. For example, the decoding context may indicate a 0.7 probability of decoding a binary bit of a value of 0 and a 0.3 probability of decoding a binary bit of a value of 1. After identifying the decoding context, the encoder 200 may divide the interval into a lower subinterval and an upper subinterval. One of the subintervals may be associated with a value of 0, and the other subinterval may be associated with a value of 1. The width of the subinterval may be proportional to the probability indicated by the identified decoding context for the associated value. If a binary bit of a syntax element has a value associated with a lower subinterval, the coded value may be equal to the lower boundary of the lower subinterval. If the same binary bit of the syntax element has a value associated with the upper subinterval, the encoded value may be equal to the lower boundary of the upper subinterval. To encode the next binary bit of the syntax element, encoder 200 may repeat these steps, where the interval is the subinterval associated with the value of the encoded bit. When encoder 200 repeats these steps for the next binary bit, encoder 200 may use a modified probability based on the probability indicated by the identified decoding context and the actual value of the binary bit that has been encoded.

[0108] When the decoder 300 performs CABAC decoding on the value of the syntax element, the decoder 300 can identify the decoding context. The decoder 300 can then divide the interval into a lower subinterval and an upper subinterval. One of the subintervals can be associated with a value of 0, and the other subinterval can be associated with a value of 1. The width of the subinterval can be proportional to the probability indicated by the identified decoding context for the associated value. If the coded value is within the lower subinterval, the decoder 300 can decode the binary bit with the value associated with the lower subinterval. If the coded value is within the upper subinterval, the decoder 300 can decode the binary bit with the value associated with the upper subinterval. In order to decode the next binary bit of the syntax element, the decoder 300 can repeat these steps, wherein the interval is a subinterval containing the coded value. When the decoder 300 repeats these steps for the next binary bit, the decoder 300 can use a modified probability based on the probability indicated by the identified decoding context and the decoded binary bit. The decoder 300 may then debinarize the binary bits to recover the value of the syntax element.

[0109] Predictive geometry coding is introduced as an alternative to octree geometry coding. Figure 2In the example of , the coding prediction unit 211 and / or the prediction tree construction unit 207 can implement predictive geometry coding. Figure 3 In the example, the decoding prediction unit 313 and / or the prediction tree construction unit 307 can implement prediction geometry decoding.

[0110] When using predictive geometry coding to encode or decode a point, a tree structure of a prediction structure (i.e., a prediction tree) may be defined to arrange the nodes. The G-PCC encoder 200 and the G-PCC decoder 300 may use various prediction strategies to predict the coordinates of each node in the tree structure relative to its predictor. Figure 5 is a conceptual diagram illustrating an example of a prediction tree 500. Figure 5 In the example of , the prediction tree 500 is shown as a directed graph, where the arrow points to the prediction direction. The horizontally dashed node 501 is the root vertex and has no predicted children. Double-line nodes (e.g., nodes 502, 504) have two children; oblique line nodes (e.g., node 506) have 3 children; open nodes have one child, and vertical line nodes (e.g., nodes 508, 510, 512, 514, and 516) are leaf nodes and these nodes have no children. Each node except the root node has only one parent node.

[0111] Four prediction strategies are specified for each node based on its parent node (p0), grandparent node (p1), and great-grandparent node (p2):

[0112] No forecast / Zero forecast (0)

[0113] Incremental prediction (p0)

[0114] Linear prediction (2*p0–p1)

[0115] Parallelogram prediction (p0+p1–p2)

[0116] In the incremental prediction strategy, the encoding prediction unit 211 of the G-PCC encoder 200 may determine the difference (increment) between the position of the current node and the position of the parent node. The G-PCC encoder 200 may signal the difference in the bitstream. The decoding prediction unit 313 of the G-PCC decoder 300 may use the signaled difference and the position of the parent node to determine the position of the current node. In the linear prediction strategy, the encoding prediction unit 211 may use a linear equation (e.g., 2*p0-p1) that takes the position of the parent node and the position of the grandparent node as parameters to determine the predicted child position. The encoding prediction unit 211 may then determine the difference between the predicted child position and the position of the current node. The G-PCC encoder 200 may signal the difference in the bitstream. The decoding prediction unit 313 of the G-PCC decoder 300 may use the predicted child position and the difference to determine the position of the current node. In the parallelogram prediction strategy, the encoding prediction unit 211 uses an equation (e.g., p0+p1–p2) that takes the position of the parent node, the position of the grandparent node, and the position of the great-grandparent node as parameters to determine the predicted child position. The encoding prediction unit 211 may then determine the difference between the predicted sub-position and the position of the current node. The G-PCC encoder 200 may signal the difference in the bitstream. The decoding prediction unit 313 may use the predicted sub-position and the difference to determine the position of the current node.

[0117] The G-PCC encoder 200 can use any algorithm to generate the prediction tree. In some examples, the algorithm can be determined based on the application / use case and several strategies can be used. For each node, the residual coordinate values ​​can be encoded in the bitstream starting from the root node in a depth-first manner. Predictive geometry decoding is mainly used for category 3 (LIDAR acquired) point cloud data, such as for low-latency applications.

[0118] Angular modes can be used in predictive geometry coding, where the characteristics of the LIDAR sensor can be used to decode the prediction tree more efficiently. The coordinates of the position are converted to (r, φ, i) (radius, azimuth, and laser index), and the prediction is performed in this domain. Therefore, the residuals are decoded in the r, φ, i domain. Due to rounding errors, the decoding in the r, φ, i domain is not lossless. Therefore, a second set of residuals corresponding to Cartesian coordinates is decoded. A description of the encoding and decoding strategies for angular modes for predictive geometry coding is provided below.

[0119] The process focuses on point clouds acquired using a rotating LIDAR model. Here, the LIDAR has N lasers (e.g., N=16, 32, 64) rotating around the Z axis according to an azimuth angle φ (see Fig. 6A and Figure 6B ). Each laser can have a different elevation angle θ(i) i=1…N and height Assume that laser i hits point M with Cartesian integer coordinates (x, y, z) according to Fig. 6A and Figure 6B The coordinate system definition described in . Fig. 6A and Figure 6B is a conceptual diagram illustrating an example rotating LIDAR acquisition model.

[0120] This method models the position of M using three parameters (r, φ, i), which are calculated as follows:

[0121] ·

[0122] φ=atan2(y,x)

[0123] ·

[0124] More precisely, the process uses a quantized version of (r,φ,i) expressed as The three parameters and i are calculated as follows:

[0125] ·

[0126] ·

[0127] · in

[0128] ·(q r ,o r ) and (q φ ,o φ ) are control and The quantization parameter of the accuracy.

[0129] ·sign(t) is a function that returns 1 if t is positive, and (-1) otherwise.

[0130] |t| is the absolute value of t.

[0131] To avoid reconstruction mismatches due to the use of floating point operations, andtan(θ(i)) i=1…N The values ​​of are precomputed and quantized as follows:

[0132]

[0133] in

[0134] · and (q θ ,o θ ) are control and The quantization parameter of the accuracy.

[0135] The reconstructed Cartesian coordinates are obtained as follows:

[0136] ·

[0137] ·

[0138] · where app_cos(.) and app_sin(.) are approximations of cos(.) and sin(.). This calculation can use fixed-point representation, lookup tables, and linear interpolation.

[0139] Please note that can be different from (x,y,z) for various reasons:

[0140] -Quantification

[0141] -approximate

[0142] - Model inaccuracy

[0143] - Model parameter inaccuracy

[0144] Let (r x ,r y ,r z ) is the reconstruction residual defined as follows:

[0145] -

[0146] -

[0147] -

[0148] In this process, the encoder 200 may proceed as follows:

[0149] Model parameters and And the quantization parameter q r q θ and q φ Encoding

[0150] Apply the geometry prediction scheme described in the text of ISO / IEC FDIS23090-9 Geometry-based point cloud compression (ISO / IEC JTC 1 / SC29 / WG7m55637, Telecommunications Conference, October 2020) to represent

[0151] New predictors can be introduced that exploit the characteristics of LIDAR. For example, the rotation speed of the LIDAR scanner around the z-axis is usually constant. Therefore, we can predict the current

[0152]

[0153] in

[0154] ·(δ φ (k)) k=1…K is a set of possible speeds that the encoder can use. The index k can be written explicitly to the bitstream, or can be inferred from the context based on a deterministic strategy applied by both the encoder and the decoder, and

[0155] n(j) is the number of points skipped, which may be explicitly written to the bitstream or may be inferred from the context based on a deterministic strategy applied by both the G-PCC encoder 200 and the G-PCC decoder 300. n(j) is also referred to hereinafter as “ Note that n(j) is currently only used with the incremental predictor.

[0156] · Use each node code to reconstruct the residual (r x ,r y ,r z )

[0157] The decoder 300 may proceed as follows:

[0158] Model parameters and And the quantization parameter q r q θ and q φ Decoding

[0159] The geometric prediction scheme described in [1] is used to predict the Parameters to decode

[0160] Calculate reconstruction coordinates As mentioned above.

[0161] · For the residual (r x ,r y ,r z ) to decode

[0162] As discussed in the next section, the reconstruction residual (r x ,r y ,r z ) to support lossy compression

[0163] Calculate the original coordinates (x,y,z) as follows:

[0164] o

[0165] o

[0166] o

[0167] Lossy compression can be achieved by applying quantization to the reconstructed residual (r x ,r y ,r z ) or by discarding points.

[0168] The quantized reconstruction residual can be calculated as follows:

[0169] ·

[0170] ·

[0171] · Among them (q x ,o x ), (q y ,o y ) and (q z ,o z ) are respectively controlled and The quantization parameter of the accuracy.

[0172] Trellis quantization can be used to further improve RD (rate distortion) performance results. Quantization parameters can be changed at sequence / frame / slice / block level to achieve region adaptive quality and for rate control purposes.

[0173] Predictive geometry coding is a form of inter-frame prediction that uses a prediction tree structure to predict the position of a point. When angular coding is enabled, the x, y, z coordinates are converted into radius, azimuth, and laser coordinates, and signal the residual in these three coordinates and in the x, y, z dimensions. Intra-frame prediction for radius, azimuth, and laser ID can be one of four modes, and the predictor is the node classified as the father, grandfather, and great-grandfather in the prediction tree relative to the current node. Predictive geometric decoding as currently designed in G-PCC version 1 is an intra-frame decoding tool because it only uses points in the same frame for prediction. In addition, using points from previously decoded frames can provide better predictions and therefore better compression performance.

[0174] As originally proposed, inter-frame prediction predicts the radius of the point from the reference frame. For a prediction tree such as prediction tree 500 ( Figure 5), the G-PCC encoder 200 or the G-PCC decoder 300 determines whether the point is inter-predicted or intra-predicted. The G-PCC encoder 200 can use a flag to indicate whether the point is inter-predicted or intra-predicted. When a point is intra-predicted, the G-PCC encoder 200 and the G-PCC decoder 300 can use the intra-prediction mode of predictive geometry decoding. When inter-prediction is used, the azimuth and laser ID are still predicted using intra-prediction, while the radius is predicted from the point in the reference frame that has the same laser ID as the current point and the azimuth closest to the current azimuth. In addition to radius prediction, further development of the process can achieve inter-prediction of azimuth and laser ID. When inter-prediction is applied, the G-PCC encoder 200 and the G-PCC decoder 300 can predict the radius, azimuth and laser ID of the current point based on points near the azimuth position of the previously decoded point in the reference frame. In addition, the G-PCC encoder 200 and the G-PCC decoder 300 may use separate context sets for inter prediction and intra prediction.

[0175] The process used for inter-frame prediction is Figure 7 Shown in. Figure 7 704 (interPredPt) (i.e., inter-frame predictor) in a reference frame 706 for inter-frame prediction of a current point 700 (curPoint) in a current frame 702. Each small circle corresponds to a point or other location. Figure 7 In the example of , the extension of the inter prediction to azimuth, radius and laser ID may include or consist of the following steps:

[0176] • For a given point, determine the previously decoded point (prevDecP0).

[0177] • Determine the position in the reference frame (refFrameP0) with the same scaled azimuth and laser ID as prevDecP0.

[0178] In the reference point cloud frame, find the first point (interPredPt) with a larger azimuth (eg, a scaled azimuth) than that of refFrameP0. interPredPt is also called the "Next" inter-frame predictor.

[0179] Therefore, in Figure 7 In the example of , the G-PCC encoder 200 and the G-PCC decoder 300 may identify a previous point 708 (prevDecP0) in the current frame 702. The previous point 708 is encoded or decoded before the current point 700 of the current frame 702.

[0180] In addition, the G-PCC encoder 200 and the G-PCC decoder 300 may identify a reference position 710 (refFrameP0). The reference position 710 is a position in the reference frame 706 and has a laser identifier (laser ID) and a scaled azimuth that matches the laser identifier and azimuth of the previous point 708 in the current frame 702. The G-PCC encoder 200 and the G-PCC decoder may identify an inter-frame prediction point 704. The inter-frame prediction point 704 may be a next point in the reference frame 706 that has a scaled azimuth greater than the scaled azimuth of the reference position 710. The inter-frame prediction point 704 may be a predictor of the radius, azimuth, and laser ID of the current point 700. The G-PCC encoder 200 may encode the current point 700 based on the predictor of the current point 700. For example, as part of encoding the current point 700, the G-PCC encoder 200 may signal the difference between the position of the inter-frame prediction point 704 and the position of the current point 700. As part of decoding the current point 700 , the G-PCC decoder 300 may add the signaled difference to the position of the inter-prediction point 704 to determine the position of the current point 700 .

[0181] Figure 8 1 is a flowchart illustrating an example decoding process associated with an "inter-frame flag" signaled for each point. The inter-frame flag signaled for a point indicates whether inter-frame prediction is applied for that point. The flowcharts of the present disclosure are provided as examples. Other examples may include more, fewer, or different steps, or may perform the steps in a different order.

[0182] exist Figure 8 In the example of , the G-PCC decoder 300 can determine whether the inter-frame flag of the next point to be decoded (i.e., the current point of the current frame of the point cloud data) indicates that the current point is inter-frame predicted (800). If the inter-frame flag of the current point does not indicate that the current point is inter-frame predicted (the "no" branch of 800), the G-PCC decoder 300 can identify the intra-frame prediction candidate (802). For example, the G-PCC decoder 300 can determine the intra-frame prediction strategy (e.g., no prediction, incremental prediction, linear prediction, parallelogram prediction, etc.) to determine the predictor of the current point. The syntax element (pred_mode) signaled in the geometry bitstream 203 can indicate the intra-frame prediction strategy used to determine the predictor of the current point.

[0183] On the other hand, if the inter-frame flag of the current point indicates that the current point is inter-frame predicted (the "yes" branch of 800), the G-PCC decoder 300 may identify a previous point in the decoding order (e.g., previous point 708) (804). The previous point may have coordinates (r, and the laser ID). The G-PCC decoder 300 can then derive the quantized coordinates (i.e., azimuth coordinates) (806) of the previous point. The quantized coordinates can be represented as The G-PCC decoder 300 can then check for points in the reference frame (e.g., reference frame 706) with quantized coordinates greater than the quantized coordinates of the previous point (i.e., the inter-frame prediction points (e.g., interPredPt704)) (808). The G-PCC decoder 300 can use the inter-frame prediction points as predictors for the current point (810).

[0184] Regardless of whether the G-PCC decoder 300 uses intra-frame prediction (e.g., as described with respect to step 802) or inter-frame prediction (e.g., as described with respect to steps 804 to 810) to determine the predictor for the current point, the G-PCC decoder 300 can add an incremental multiplier (812).

[0185] The LIDAR system can scan and sample content at a specific azimuth frequency. The G-PCC encoder 200 can signal the azimuth of a point using the azimuth residual value (resAz2). The azimuth residual is not the direct difference between the azimuth of the current point and the azimuth of the predictor of the current point (which can be determined using inter-frame or intra-frame prediction). Instead, the G-PCC encoder 200 encodes the azimuth residual as a combination of an incremental multiplier and a residual. For example, azimSpeed can represent the azimuth difference between consecutive captures of one of the rotating LIDAR sensors (note that there are multiple sensors in each rotating LIDAR system). Thus, if each LIDAR sensor in the rotating LIDAR system captures 1000 points per rotation, then azimSpeed will be (1 << azimBitDepth) / 1000, effectively, the azimuth difference between adjacent point captures. Here, azimBitDepth is the bit depth used to represent the azimuth value at the G-PCC encoder 200. (1 << azimBitDepth) represents a full rotation (360 degrees). Thus, (1 << azimBitDepth) / 1000 represents the difference in azimuth between two captures. Although the LIDAR sensors can be designed to sample at a constant interval during rotation, due to noise and other inaccuracies, the difference between the azimuth values of adjacent captures may not be azimSpeed, or a multiple of azimSpeed. The first azimuth residual resAz1, which is the difference in azimuth between the current point and the predictor, is decoded as an incremental A combination of the multiplier (qphi) and the second azimuth residual (resAz2). qphi can be derived as follows:

[0186]

[0187] The value of the decoded azimuth residual resAz2 is obtained as resAz1−deltaPhi*azimSpeed. Both qphi and resAz2 are signaled in the bitstream. The G-PCC decoder 300 may decode resAz2 and qphi. The G-PCC decoder 300 may obtain the reconstructed azimuth residual (resAz1) as resAz2+qphi*azimSpeed.

[0188] Fig. 9 is a conceptual diagram illustrating an example additional inter-frame prediction sub-point 900 obtained from a first point having an azimuth angle greater than the inter-frame prediction sub-point 914. Figure 7 In the described inter-frame prediction method for predicting geometry, when inter-frame decoding is applied, the radius, azimuth and laser ID of the current point (current point 700) are predicted based on points (inter-frame prediction point 704) near the co-located azimuth position (reference position 710) in the reference frame (reference frame 706). Fig. 9 In the example of FIG. 9 , the G-PCC encoder 200 and the G-PCC decoder 300 may determine the additional inter prediction subpoint 900 using the following steps:

[0189] a) For a given point (current point 904 of current frame 906), determine the previous point 908 in current frame 906 ( Fig. 9 "previously decoded points" in );

[0190] b) determining a reference position 912 in the reference frame 910 having the same scaled azimuth and laser ID as the previous point 908 determined in step a) ( Fig. 9 Reference points with identically scaled azimuth and laser ID) in

[0191] c) determining a position in the reference frame 910 as a first point having a larger azimuth angle (eg, a scaled azimuth angle) than the reference position 912 determined in step b) to be used as an inter-frame prediction subpoint ( Fig. 9 The inter-frame prediction point 914 in FIG.

[0192] This can be done by finding Fig. 9 The first point ( ) of the inter-frame prediction point 914 determined in step c) with a large azimuth (eg, scaled azimuth) is shown in FIG. Fig. 9The additional inter prediction point is obtained by using the "additional inter prediction point 900" in FIG. 1 . If inter coding has been applied, additional signaling may be used to indicate which predictor is selected. The additional inter prediction subpoint may also be referred to as the "NextNext" inter prediction subpoint.

[0193] A context selection algorithm may be applied to decode the inter prediction flag. For example, the inter prediction flag values ​​of five previously decoded points may be used to select the context of the inter prediction flag in prediction geometry decoding.

[0194] Now let’s discuss adaptive azimuth quantization. When using spherical coordinates in the predictive geometry decoding of LIDAR acquired point clouds in G-PCC version 1, the azimuth is quantized regardless of the distance between the point and the LIDAR acquisition head. The sampling result of this quantization is roughly as follows: Fig.10 exemplified. Fig.10 is a conceptual diagram illustrating sampling of azimuth and radius using uniform quantization as in G-PCC version 1. Fig.10 It is shown that the sampling density is high near the origin where the spin sensor head 1000 is located, and becomes low in the area far away from the spin sensor head. Depending on the value Δφ(1002), for a point close to the spin sensor head (r 1 ,φ 1 ) or for points far from the sensor head (r 2 ,φ 2 ) to obtain insufficient precision. In the first case, for close points, there is too much decoded information for the residual error of the azimuth prediction. On the other hand, in the second case, not enough information is decoded for the residual error of the azimuth prediction of the far points to have accurate precision about the inverse transformed (x,y) values, thus resulting in the Cartesian coordinates (x) to be decoded. res ,y res ). In both cases, the compression of the azimuth angle φ is not optimal. In summary, when considering the overall compression scheme of the points in Cartesian space, uniform quantization of φ does not lead to an optimal representation of the point positions.

[0195] The proposed method adaptively quantizes the azimuth angle according to the radius, leading to an improvement in compression performance. For more efficient compression, an adaptive quantization step size of the azimuth angle φ is proposed. Using the reconstruction radius r 2D The value of , the proposed non-uniform adaptive angle quantization step size is changed to:

[0196] Δφ(r 2D ) = Δφ arc / r 2D (1)

[0197] By using this non-uniform quantization step size, for any radius r 1 、r 2 , the length of the arc generated by the quantization step Δφ(.) is uniform, since it is equal to r 1 .Δφ(r 1 )=Δφ arc =r 2 .Δφ(r 2 ).

[0198] Therefore, for Fig.11 and Fig.12 For any radius shown in , this non-uniform quantization step size in the φ domain can provide a quantization step size Δφ arc Uniform quantization of the arc. Fig.12 Also shown is the more uniform angular sector implied by the uniform quantization of the arc, resulting in a more uniform maximum error caused by the quantization of φ. Fig.11 is a conceptual diagram illustrating non-uniform quantization of azimuth angles resulting in uniformly quantized arcs (eg, arc 1100). Fig.12 This is an example using Δφ arc Uniform quantization of circular arcs of quantization steps (e.g., Δφ arc 1200).

[0199] The specific implementation details are described in [G-PCC][New] Improved Quantization of Azimuthal Angle in Predictive Geometry Coding by J. Taquet, S. Lasserre, S. Gao, M.-L. Champel (ISO / IEC JTC1 / SC29 / WG7 m55979, January 2021), and some additional modifications in [G-PCC][EE13.51] Report on Predictive Geometry Improvement by J. Taquet, S. Lasserre, S. Gao, M.-L. Champel (ISO / IEC JTC1 / SC29 / WG7 m56482, April 2021). The integer division in the inverse quantization of the azimuthal angle residual is approximated by using the Newton-Raphson division approximation algorithm. In addition, the internal precision used to represent the azimuth angle is increased (e.g., 24 bits for lossless), which results in modifications to the specific implementation of the integer sine and cosine functions to maintain 32-bit arithmetic, but the modifications do not affect the standard definition of these functions. Due to the increase in precision, it also results in scaling of spherical coordinates used for attribute decoding.

[0200] The improved quantization of azimuth angles has been made backward compatible with G-PCC version 1 by adding a flag in the geometry parameter set extension to enable / disable the feature.

[0201] We now discuss the decoding of the azimuth residual. In addition to the adaptive azimuth quantization described above, the following process can be implemented to improve the decoding of the azimuth residual. When spherical coordinates are used in the prediction geometry decoding of the LIDAR acquired point cloud in G-PCC version 1, the prediction of the azimuth of the point can be obtained by adding the azimuth prediction provided by the 'n'th predictor Add azimuth step The number 'k' (decoded in the bitstream) is used to refine:

[0202]

[0203] Azimuth step can essentially correspond to the rotation performed by the LIDAR sensor head between two consecutive attempts to acquire a point with the laser at a given elevation angle. It corresponds to the azimuth angle given by:

[0204]

[0205] where 'geom_angular_azimuth_speed_minus1' is obtained from the geometry parameter set (GPS).

[0206] In G-PCC version 1, there is no constraint on the value of 'k'. Azimuth The predicted residuals

[0207]

[0208] It is unbounded.

[0209] To limit the residual Make it fit in the interval The value of 'k' can be determined as follows:

[0210]

[0211] More precisely, in the context of the above-mentioned adaptive quantization of the azimuth angle, the quantized azimuth angle residual The following equation will be satisfied:

[0212]

[0213] in It is the adaptive quantization of 'x' based on the decoding radius 'r'.

[0214] Then, by using the bounds The value of can improve the quantization residual Entropy decoding.

[0215] First, the bounds are calculated for each point as follows

[0216] const int rec_radius_scaling=rPred+residual[0]<<3; / / ~r*2*pi

[0217] auto speed_r=int64_t(_geomAngularAzimuthSpeed)*rec_radius_scaling;

[0218] int phiBound=divExp2RoundHalfInf(speed_r,_geom_angular_azimuth_scale_log2+1);

[0219] The encoder 200 may then perform the following steps: Fig.13 Entropy coding is illustrated. Fig.13 is a conceptual diagram illustrating an example process 1300 for entropy encoding a quantized residual angle using a limit B. If the limit 'B' is equal to zero, then the quantized residual is zero, so no decoding is required. Otherwise, a flag is encoded to indicate Is it equal to zero? is non-zero, the sign binary bit is encoded. Then, if the limit 'B' is equal to 1, then is negative 1 or 1, so no further encoding is required. Otherwise, the flag is encoded to indicate Is the absolute value of equal to 1? The absolute value of is not equal to 1, but the limit 'B' is equal to 2, then is negative 2 or 2, and the encoding stops. Otherwise, the expGolomb code is used to encode the remaining part (i.e., ) is encoded. The number of entropy coding contexts can be equal to 24.

[0220] The procedure for scaling the azimuth step size is now discussed. In G-PCC version 1, the Cartesian coordinate prediction (x pred ,y pred ):

[0221]

[0222] In the above equation, is the reconstructed azimuth angle, and ‘r 2D-rec ’ is the reconstructed radius.

[0223] If implemented as a supplement to the above process, then where is the adaptive quantization of the azimuth angle described in the section titled "Adaptive Azimuthal Angle Quantization", is the inverse quantization, and is the predicted azimuth residual.

[0224] In G-PCC version 1 and the above process, ‘r 2D-rec = r << geom_angular_radius_inv_scale_log2’; compared to the decoded point cloud Cartesian precision, the radius ‘r’ used internally in the codec and decoded by it has a precision reduced by the number of bits equal to ‘geom_angular_radius_inv_scale_log2’ obtained from the geometric parameter set (this is equivalent to the quantization of the radius).

[0225] Now discuss the process of implementing the scaling of the azimuth step. If the improved azimuth quantization and the improved azimuth residual decoding as described above are implemented, the bounds (see the section titled "Improved Coding of Azimuthal Angle Residual") calculated for each point for entropy (decoding) decoding are used to implement the scaling of the azimuth step. If the integer bound ‘B’ is equal to 0 or equivalently ‘B < 1’, then:

[0226]

[0227] where is the scaled azimuth step.

[0228] Now discuss the process for calculating the scaled azimuth step. To decode the optimal number ‘k’ of the scaled azimuth step , the optimal will become:

[0229]

[0230] One problem with Equation (9) is that Equation (9) requires integer division in decoder 300. Therefore, implement the approximation of the division in. To calculate this approximation, use the highest power of the ‘2 n ’ factor such that ‘2 n *

[0231] Azimuth step size for scaling It can be obtained by the following operation: and Iteratively scale '2 n ', starting from 'n=0', and in Less than 2π angle (i.e., '2 geom_angular_azimuth_scale_log2 ') and Both use consecutive bit-wise shifts of 1-bit operations:

[0232]

[0233] Then, the number of azimuth steps 'qphi' in the encoder 200 and the azimuth predictor 'pred[1]' updated by the number of azimuth steps in both the encoder 200 and the decoder 300 are calculated using 'azimuthSpeed' instead of '_geomAngularAzimuthSpeed=gps.geom_angular_azimuth_speed_minus1+1' as follows:

[0234] -qphi=residual[1]>=0? (residual[1]+(_geomAngularAzimuthSpeed>>1))

[0235] - / _geomAngularAzimuthSpeed

[0236] -:-(-residual[1]+(_geomAngularAzimuthSpeed>>1))

[0237] - / _geomAngularAzimuthSpeed;

[0238] -pred[1]+=qphi*_geomAngularAzimuthSpeed;

[0239] +qphi=residual[1]>=0? (residual[1]+(azimuthSpeed>>1))

[0240] + / azimuthSpeed

[0241] +:-(-residual[1]+(azimuthSpeed>>1))

[0242] + / azimuthSpeed;

[0243] +pred[1]+=qphi*azimuthSpeed;

[0244] residual[1]=point[1]-pred[1];

[0245] We now discuss the radius residual sign decoding. In the predictive geometry encoder, the sign of the radius residual is encoded with a single entropy decoding context. Since the radius residual sign should be more or less piecewise constant when the radius is predicted from the previous point radius (i.e., the parent node in the prediction tree), the sign probability will be highly correlated with the sign value of the radius of the previously encoded point when the parent node is used as a predictor. In addition, this probability should increase when consecutive decoded points have similar azimuths (i.e., the number of azimuth steps encoded in the bitstream and added to the predictor is zero).

[0246] Therefore, the proposed method uses a table of 2×2×2×2 (i.e., 16) contexts as follows:

[0247] ctx sign = ctxTab[I previous ][I penulm ][I last ][s res,prec ] (10)

[0248] Where 'ctxTab' is the context table, 'I previous 'Is a Boolean value indicating whether the selected predictor is a parent node, 'I penulm 'Is a Boolean value indicating whether the number of azimuth steps decoded from the previous point is equal to zero, last ' is a Boolean value indicating whether the number of azimuth steps for the current point is equal to zero, and 's res,prec ' is a Boolean value indicating the sign of the last decoded radius residual.

[0249] Now let's discuss the predictor list. A dynamic list of predictors is derived to perform better prediction after the laser beam has moved from a first object at a first distance to another object at a different distance, has passed the other object, and passed back to the first object. For example, Fig.14 As illustrated, this may occur when one object is in front of another object (e.g., a car like a wall), or when an object has a hole (e.g., a wall with an open door or window, or an entrance wall). Fig.14 is a conceptual diagram illustrating an example of a laser 1400 detecting different objects 1402 , 1404 , and 1406 . Fig.14Also shown is a histogram 1408 of distances measured using laser 1400 .

[0250] Instead of using a list of G-PCC predictors, from N pairs of a radius and an azimuth The prediction buffer (e.g., Figure 2 The prediction buffer 213 or Figure 3 The prediction buffer 315) builds a list of N predictors. Predictor derivation is described in detail in the subsection entitled "Derivation of the predictors", and buffer management is explained in the subsection entitled "Management of the prediction buffer". Decoding of the predictor index can be performed using unary decoding with one context per predictor index.

[0251] The export of predictors is performed as follows:

[0252] If the predicted point is the first point in the tree (i.e., no parent node exists), then predict the child PR 0 is set equal to (r min ,0,0), other predictors PR n>0 is set equal to (0,0,0).

[0253] If the point has a parent point, then

[0254] a. Predictor PR 0 is set equal to where θ 0 is the laser index θ value of the parent point p0 decoded in the parent node, and where is the first pair in the buffer (as will be understood from the buffer management, it is also equal to the radius r and azimuth angle of the parent point p0 decoded in the parent node, respectively );

[0255] b. Predictor PR n>0 is set equal to where θ 0 is the laser index θ value of the parent point p0 decoded in the parent node, and where is the nth pair in the buffer, and if Then k is equal to 0, otherwise k is equal to integer division

[0256] Since it is best to avoid integer division in decoder 300, the following divApprox function of G-PCC can be used to approximate

[0257] The buffers used for predictor derivation may be managed as follows. Each pair of buffers is first initialized to (0,0). After (de)coding of a point, the encoder 200 or decoder 300 may update the buffers as follows:

[0258] If the (decoded) decoding radius residual r res If the absolute value of is higher than the threshold Th, the encoder 200 or decoder 300 may determine that the laser has detected a new object. The encoder 200 or decoder 300 may then insert the new element at the front of the buffer where r 0 and The encoder 200 or the decoder 300 may discard the last element of the buffer. The encoder 200 or the decoder 300 may discard the last element of the buffer by setting the buffer element equal The last element of the buffer is discarded (for n=3 to 1). The encoder 200 or decoder 300 may then set the first buffer element value from the point of decoding.

[0259] If (decoding) decode r res If the absolute value of is not higher than the threshold value Th, the encoder 200 or decoder 300 may determine that the laser has detected an object present in the buffer. The encoder 200 or decoder 300 may then move the element of the buffer with the index predIdx (which corresponds to the index of the predictor that has been used for prediction) to the front of the buffer. The encoder 200 and decoder 300 may update the buffer to include That is, the reconstruction radius and the reconstruction azimuth of the (decoded) decoding point. The encoder 200 and the decoder 300 can be obtained by setting the buffer element equal This is then done by setting the first buffer element value from the decoding point (for n=predIdx to 1).

[0260] The threshold Th may be equal to gps.predgeom_radius_threshold_for_pred_list and has been fixed in the encoder as 2048 >> ps.geom_angular_radius_inv_scale_log2. gps.predgeom_radius_threshold_for_pred_list is a syntax element indicating the threshold Th. s.geom_angular_radius_inv_scale_log2 is the exact value (ie number of bits) used for some intermediate derivations of the radius component (especially with respect to spherical to Cartesian conversion, or vice versa).

[0261] We now discuss the processes for encoding and decoding the magnitude of the radius residuals. These processes can improve the magnitude encoding of the radius residuals in the prediction tree geometry decoding of G-PCC for LIDAR acquired point cloud compression.

[0262] Fig.15 is a flow chart illustrating an example encoding method of the magnitude of the radius residual. Fig.15 In the example of , the encoder 200 uses a context adaptive entropy encoder to encode the bits of the magnitude of the radius residual, and the context can be determined according to the context determination process described elsewhere in this disclosure.

[0263] like Fig.15 As shown, the encoder 200 can obtain Then, the encoder 200 can determine the predictor P pred (1502). The encoder 200 can use the coordinates of the point and the predictor P pred The residual can be determined by the coordinates of To specify. For example, the encoder 200 may subtract the corresponding coordinate values ​​of the point and the predictor to determine the residual. In addition, the encoder 200 may obtain a prediction index i and an integer qphi (1506). For example, the encoder 200 may select a predictor index i based on a review of one or more possible values ​​of i to determine which provides the best performance. The integer qphi is a quantized value of the azimuth residual. The encoder 200 may then determine a context index ctxIdx (1508). The encoder 200 may select a context ctx (1510) based on the context index ctxIdx. An example process for determining a context index ctxIdx and a context ctx is provided below.

[0264] After obtaining the radius residual, the encoder 200 can determine the flag f 0 The binary entropy encoder (eg, the arithmetic coding unit 214 of the encoder 200) may use the context ctx to set the flag f 0 The value of , and the encoder 200 may signal the flag f in the geometry bitstream 203 0 The encoding value (1512). Flag f 0 The value represents the radius residual r 2D_res Is it equal to 0?

[0265] The encoder 200 can then determine the radius residual r 2D_res Is it equal to 0(1514). If the radius residual r 2D_res is equal to 0 (the "yes" branch of 1514), then because r 2D_res = 0 is encoded, so the radius residual r is completed2D_res Otherwise, if the radius residual r 2D_res is not equal to 0 (the “No” branch of 1514), the encoder 200 may determine that the flag f 1 The arithmetic coding unit 214 of the encoder 200 may calculate the value of the flag f based on the context ctx. 1 The value of f is entropy encoded, and the encoder 200 can 1 The entropy coded value of is included in the geometry bitstream 203 (1516). 1 Indicates absolute value |r 2D_res |Is it equal to 1?

[0266] The encoder 200 can then determine the absolute value |r 2D_res | is equal to 1(1518). If the absolute value |r 2D_res | is equal to 1 (the "yes" branch of 1518), the encoder 200 has completed the radius residual r 2D_res Otherwise, if the absolute value | r 2D-_res | is not equal to 1 (the "No" branch of 1518), the encoder 200 determines the flag f 2 The arithmetic coding unit 214 of the encoder 200 calculates the value of the flag f based on the context ctx. 2 The value of performs binary entropy coding, and the encoder 200 signals the flag f 2 The entropy coded value of is the geometry bitstream 203 (1520). 2 Indicates absolute value |r 2D_res |Is it equal to 2?

[0267] The encoder 200 can then determine the absolute value |r 2D_res | is equal to 2(1522). If the absolute value |r 2D_res | is equal to 2 (the "yes" branch of 1522), the encoder 200 has completed the radius residual r 2D_res Otherwise, if the absolute value | r 2D_res | is not equal to 2 (the "no" branch of 1522), the encoder 200 may use exponential Golomb coding to decode the absolute value (|r 2D_res |-3) to encode (1524).

[0268] An overview of the proposed decoding method for the magnitude of the radius residual is given in Fig.16 Shown in. Fig.16 is a flow chart illustrating an example decoding method for the magnitude of the radius residual. Fig.16In an example, the decoder 300 may receive a bitstream (e.g., the geometry bitstream 203). The decoder 300 may obtain a prediction index i and an integer qphi (1600) of a point from the bitstream. The decoder 300 may then determine a context index ctxIdx (1602). The decoder 300 may select a context ctx based on the context index ctxIdx (1604). An example process for determining a context index ctxIdx and a context ctx is provided below.

[0269] The decoder 300 can decode the flag f from the bitstream 0 The decoder 300 may use the context ctx to determine the value of the flag f 0 The value of the decoder is 0 Residual r 2D_res Is equal to 0. The decoder 300 can then determine the flag f 0 Is it equal to 1 (1608). If the flag f 0 is equal to 1 (the "yes" branch of 1608), the decoder 300 has completed decoding the residual r 2D_res Otherwise, if the flag f 0 If the value of is not equal to 1 (the “No” branch of 1608), the decoder 300 can decode the flag f from the bit stream. 0 The decoder 300 may use the context ctx to determine the value of the flag f 1 The value of the decoder is decoded. 1 Residual r 2D_res Is equal to 1. The decoder 300 can then determine the flag f 1 Is it equal to 1(1612). If the flag f 1 is equal to 1 (the "yes" branch of 1612), the decoder 300 has completed decoding the residual r 2D_res .

[0270] Otherwise, if the flag f 1 If the value of is not equal to 1 (the "No" branch of 1612), the decoder 300 can decode the flag f from the bit stream. 2 The decoder 300 can use the context ctx to set the flag f 2 The value of the decoder is decoded. 2 Residual r 2D_res Is it equal to 2? If the flag f 2 is equal to 1 (the "yes" branch of 1616), the decoder 300 has completed decoding the residual r 2D_res Otherwise, if the flag f 2If the value of is not equal to 1 (the "No" branch of 1616), the exponential Golomb decoder of decoder 300 can decode a series of bits from the bit stream (1618). The series of bits indicates the absolute value (|res 2D_res |-3).

[0271] As described above, the encoder 200 and the decoder 300 determine the context index ctxIdx and the context ctx. Now, the process of determining the context ctx is discussed. 2D_res ), the encoder 200 and the decoder 300 determine the context index ctxIdx by using the predictor index i and the integer qphi of the basic azimuth step according to the following equation:

[0272]

[0273] And then select the context ctx in the context table ctxTable_T to entropy encode the bits of the magnitude of the radius residual according to ctxIdx.

[0274] ctx=ctxTable_T[ctxIdx] (12)

[0275] The above-described processes for predictive geometric coding only apply to intra-coded pictures. These processes do not take into account inter-coded points. For example, the decision to select the context of the coding residual radius and orientation is suboptimal because the statistics of the variables are different for inter- and intra-coded points. This may result in a loss of coding efficiency. The techniques of the present disclosure may address these issues and may therefore result in an increase in coding efficiency.

[0276] According to the first technique of the present disclosure, the encoder 200 and the decoder 300 may perform a context selection method for a radius residual sign based on an inter-frame prediction flag and whether a previous prediction point was coded using inter-frame prediction. For example, a radius residual sign flag may be signaled to indicate a radius residual (e.g., r 2D_res ) is positive or negative. The encoder 200 and the decoder 300 may perform entropy encoding or entropy decoding on the radius residual sign flag based on the context. The encoder 200 and the decoder 300 may determine the context for encoding or decoding, which may be as follows according to G-PCC version 1 (indicating a changed <c> …< / c> Tag) Update radius residual sign flag:

[0277]

[0278] In the above equation, 'ctxTab' is the context table, 'I prevInter ' is an indication of a previous decoding point (e.g., Figure 7preDecP 708) is a Boolean value indicating whether it is inter-frame decoding, 'I currInter 'Is a Boolean value indicating whether the current point (eg, curPoint 700) is inter-coded, 'I previous 'Is a Boolean value indicating whether the selected predictor is a parent node, 'I penulm 'Is a Boolean value indicating whether the number of azimuth steps decoded from the previous point is equal to zero, last ' is a Boolean value indicating whether the number of azimuth steps for the current point is equal to zero, and 's res,prec ' is a Boolean value indicating the sign of the last decoded radius residual.

[0279] In another example, the encoder 200 and the decoder 300 may determine the context of the residual symbol as follows:

[0280]

[0281] isInter can also be exported as <c>mini prevInter +I currInter ,1)< / c> .

[0282] In another example, the encoder 200 and the decoder 300 may determine the context of the residual symbol as follows:

[0283]

[0284] In another example, the encoder 200 and the decoder 300 may determine the context of the residual symbol as follows:

[0285]

[0286] Fig.17 is a flow chart illustrating example operations of an encoder 200 that selects a context for entropy encoding a radius residual symbol based on whether a previous prediction point was encoded using inter-frame prediction, in accordance with one or more techniques of this disclosure. Fig.17 In an example of , the encoder 200 (e.g., the prediction tree construction unit 207 or the encoding prediction unit 211 of the encoder 200) can determine the sign of the radius residual of the current point of the point cloud (1700). For example, the encoder 200 can determine the predictor of the current point. The encoder 200 can determine the predictor according to any of the examples provided elsewhere in the present disclosure. The predictor can indicate the predicted radius, orientation, and laser ID of the current point. The residual radius of the current point can be the difference between the actual radius of the current point and the predicted radius. The sign of the radius residual indicates whether the radius residual is positive or negative.

[0287] In addition, the encoder 200 may determine a context for entropy encoding a radius residual sign flag indicating a sign of a radius residual for the current point (1702). The encoder 200 may determine the context for entropy encoding the radius residual sign flag based on whether the previous coded point is inter-coded and whether the current point is inter-coded. For example, the encoder 200 may determine the context as described in any of equations (13), (14), (15), or (16) above.

[0288] Thus, in some examples, as part of determining the context for entropy encoding the radius residual sign flag, the encoder 200 may look up the context based on whether the previous point is inter-coded, whether the current point is inter-coded, whether the predictor of the current point is the parent of the current point, whether the number of azimuth steps for the decoding of the previous point is equal to zero, whether the number of azimuth steps for the decoding of the current point is equal to zero, and the sign of the last decoded radius residual. For example, the encoder 200 may look up the context in a six-dimensional table (ctxTab), as described in equation (13). In this example, the value of the first dimension of the table indicates whether the previous point is inter-frame decoded, the value of the second dimension of the table indicates whether the current point is inter-frame decoded, the value of the third dimension of the table indicates whether the predictor of the current point is the parent node of the current point, the value of the fourth dimension of the table indicates whether the number of azimuth steps for decoding of the previous point is equal to zero, the value of the fifth dimension of the table indicates whether the number of azimuth steps for decoding of the current point is equal to zero, and the value of the sixth dimension of the table indicates the sign of the last decoded radius residual.

[0289] In some examples (such as those related to equation (14)), as part of determining the context for entropy encoding the radius residual sign flag, the encoder 200 may determine the context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps for decoding of the previous point is equal to zero, whether the number of azimuth steps for decoding of the current point is equal to zero, and the sign of the last decoded radius residual. The encoder 200 may determine a value of a variable (e.g., isInter). As part of determining the value of the variable, the encoder 200 may determine that the value of the variable is equal to a Boolean value indicating whether the previous point is inter-coded multiplied by a Boolean value indicating whether the current point is inter-coded, or determine that the value of the variable is equal to the minimum of: 1 and a value equal to the Boolean value indicating whether the previous point is inter-coded plus a value equal to the Boolean value indicating whether the current point is inter-coded. The encoder 200 can look up the context in a three-dimensional table, where the value of the first dimension of the table indicates whether the previous point was inter-coded, the value of the second dimension of the table indicates whether the current point is inter-coded, and the value of the third dimension of the table is equal to 0 when the value of the variable is true, otherwise it is equal to the context index.

[0290] In some examples (such as those related to equation (15)), as part of determining the context for entropy encoding the radius residual sign flag, the encoder 200 may determine the intra context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps for decoding of the previous point is equal to zero, whether the number of azimuth steps for decoding of the current point is equal to zero, and the sign of the last decoded radius residual. The encoder 200 may determine the inter context index based on whether the previous point is inter-coded and whether the current point is inter-coded. The encoder 200 may look up the context in a two-dimensional table, where the value of a first dimension of the table is the inter context index, and the value of a second dimension of the table is equal to 0 if the current point is inter-coded and equal to the intra context index otherwise.

[0291] In some examples (such as those related to equation (16)), as part of determining the context for entropy encoding the radius residual sign flag, the encoder 200 can determine the intra context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual. The encoder 200 can look up the context in a two-dimensional table. The value of the first dimension of the table is equal to 2 when the current point is inter-frame decoding, otherwise it is equal to a Boolean value indicating whether the previous point is inter-frame prediction. The value of the second dimension of the table is equal to 0 when the current point is inter-frame decoding, otherwise it is equal to the intra context index.

[0292] The encoder 200 (eg, the arithmetic coding unit 214 of the encoder 200) may entropy encode the radius residual sign flag using the determined context (1704). For example, the encoder 200 may perform CABAC encoding on the radius residual sign flag using the determined context.

[0293] Fig.18 is a flow diagram illustrating example operation of a decoder 300 that selects a context for entropy decoding a radius residual symbol based on whether a previous prediction point was encoded using inter prediction, in accordance with one or more techniques of this disclosure.

[0294] exist Fig.18In the example of , the decoder 300 can obtain an entropy-encoded radius residual sign flag indicating a sign of a radius residual of a current point of the point cloud (1800). The decoder 300 (e.g., the geometric arithmetic decoding unit 302 of the decoder 300) can determine a context for entropy decoding the radius residual sign flag (1802). The decoder 300 can determine the context for entropy decoding the radius residual sign flag based on whether the previously decoded point is inter-coded and whether the current point is inter-coded. For example, the decoder 300 can determine the context as described in any of the above equations (13), (14), (15).

[0295] The decoder 300 may entropy decode the radius residual sign flag using the determined context (1804). For example, the decoder 300 may entropy decode the radius residual sign flag using CABAC decoding or another entropy decoding process. The decoder 300 may reconstruct the position of the current point based on the radius residual sign flag (1806). For example, the decoder 300 may determine a predictor of the current point, such as described in any one of the examples provided elsewhere in the present disclosure. In addition, the decoder 300 may determine a radius residual value, an azimuth residual value, and a laser ID residual value from the bitstream. In this example, the decoder 300 may set the sign of the radius residual value based on the decoded radius residual sign flag. In this example, the decoder 300 may add the coordinate value (e.g., radius, azimuth, laser ID) of the predictor to the corresponding residual value (e.g., radius residual value, azimuth residual value, laser ID residual value) to reconstruct the position of the current point.

[0296] According to the second technology of the present disclosure, the encoder 200 and the decoder 300 may perform context selection of one or more syntax elements of radius and azimuth residuals based on whether the point is decoded by intra prediction or inter prediction. When the point is decoded by intra prediction, a set of contexts is used, and when the point is decoded by inter prediction, a different set of contexts may be used. This applies to one or more binary bits of syntax elements associated with radius and azimuth residuals. In some cases, the time of context selection may also be determined by whether the previous point is inter-coded. For example, the encoder 200 or the decoder 300 may determine the context for entropy encoding of one or more syntax elements associated with the azimuth residual (e.g., syntax elements associated with the number of quantized residual / azimuth steps qphi) based on whether the previous decoded point is inter-coded and / or whether the current point is inter-coded, the context indicating the magnitude of the azimuth residual of the current point. The encoder 200 or the decoder 300 may entropy encode or decode the azimuth residual using the determined second context.

[0297] For example, the encoder 200 and the decoder 300 may determine the change in context derivation of the bits of the radius residual magnitude (wherein from the G-PCC version) as follows: <c> …< / c> Label indication). In this example, whether the current point is inter-coded can be used to determine the context of the decoded binary bit. For example, in order to encode each bit of the radius residual magnitude, the encoder 200 and the decoder 300 can determine the context index ctxIdx using the predictor index i and the integer qphi of the basic azimuth step according to the following equation.

[0298]

[0299] The encoder 200 and the decoder 300 may then select a context ctx in the context table ctxTable_T to entropy encode or decode bits of the magnitude of the radius residual according to ctxIdx.

[0300] ctx=ctxTable T <c> [interCtx]< / c> [ctxIdx] (18)

[0301] <c> Where interCtx is a Boolean variable indicating whether the current point is decoded using inter-frame prediction.< / c>

[0302] In another example, the encoder 200 and the decoder 300 may determine the context derivation of the bits of the radius residual magnitude as follows (where the changes from G-PCC version 1 are used): <c> …< / c> In this example, the encoder 200 and the decoder 300 additionally use values ​​indicating whether the current point is inter-coded and whether the previous point is inter-coded to determine the context of the decoded binary bit.

[0303]

[0304] In the above equation, resPhi is the azimuth residual to be decoded, boundPhi is a constraint variable derived from resPhi, and ctxL is used to select a context based on whether the predictor is a parent node. Exponential Golomb coding is used to encode the azimuth residual as (a) resPhi=0 flag in line [1], (b) resPhi sign flag in line [2], (c) abs(resPhi(==1) in line [3], and (d) abs(resPhi-1). <c>The context selection in lines [1], [3], and [4] is updated by including interCtxIdx, which is a Boolean variable indicating whether the current point is coded with inter prediction. The context for the sign flag for resPhi is updated using interCtxIdx and _resPhiOldSign, which is an integer variable that takes the following three values:

[0305] -0, when the previously decoded point is intra-decoded and the resPhi of the previously decoded point is less than 0

[0306] -1, when the previous point is intra-decoded and the resPhi of the previously decoded point is greater than or equal to 0

[0307] -2, the previous point is inter-frame decoding< / c>

[0308] Therefore, in the above pseudo code, the entropy coding function (ie, encode()) takes two parameters as input. The first parameter of the entropy coding function is the value to be encoded. The second parameter of the entropy coding function is the context for encoding the value. The azimuth residual can be encoded as a set of syntax elements. If the absolute value of the azimuth residual may be greater than 0, the first syntax element may be signaled. The first syntax element indicates whether the azimuth residual is equal to zero (ie, isZero). If the absolute value of the azimuth residual may be greater than 0 (ie, boundPhi!=0), the second syntax element is signaled. The second syntax element is a sign flag indicating the sign value of the azimuth residual. The sign value indicates whether the azimuth residual is positive or negative. If the absolute value of the azimuth residual may be greater than 1 (ie, boundPhi!=1), the third syntax element (ie, isOne) is signaled. The third syntax element indicates whether the azimuth residual is equal to 1. If the absolute value of the azimuth residual may be greater than 2 (ie, boundPhi!=2), a fourth syntax element (ie, residual) is signaled. The fourth syntax element indicates the azimuth residual minus 1 (ie, resPhi-1).

[0309] In the above pseudo code, when determining the context for entropy encoding the isZero syntax element, the encoder 200 can look up the context in a two-dimensional table (_ctxResPhiIsZero), where interCtxIdx is a value for a first dimension of the table and ctxL is a value for a second dimension of the table. As described above, interCtxIdx indicates whether the current point is inter-predicted, and ctxL indicates whether the current point is a parent node.

[0310] When determining the context for entropy encoding the symbol flag, the encoder 200 can look up the context in a two-dimensional table (_ctxResPhiSign). The value of the first dimension of the table is set to 0 when resPhiOldSign is equal to 2, otherwise it is set to ctxL. The value of the second dimension of the table is set to 3 when interCtxIdx is true (i.e., the current point is decoded using inter-frame prediction), otherwise it is set to _resPhiOldSign. The encoder 200 can update the values ​​of _resPhiOldSign and resPhi after entropy encoding the symbol flag.

[0311] When determining the context for entropy encoding the isOne syntax element, the encoder 200 may look up the context in a two-dimensional table (_ctxResPhiIsOne). The value of the first dimension of the table is interCtxIx, and the value of the second dimension of the table is ctxL.

[0312] In the above pseudo code, the encoder 200 uses exponential Golomb coding to entropy encode the residual. The encodeExpGolomb() function performs exponential Golomb decoding. The encodeExpGolomb() function takes four parameters: the value to be encoded, the second value specifying the order of the exponential Golomb code, the context of the prefix of the exponential Golomb code, and the context of the suffix of the exponential Golomb code. When the residual is entropy encoded using exponential Golomb coding, the encoder 200 can convert the residual (ie, resPhi-1) into a code with a prefix and a suffix. The encoder 200 can use different contexts to encode the prefix and the suffix. The encoder 200 can determine the context of the prefix by looking up the context in the first two-dimensional table (_ctxResPhiExpGolombPre). The encoder 200 can determine the context of the suffix by looking up the context in the second two-dimensional table (_ctxResPhiExpGolombSuf). For both the first table and the second table, the value of the first dimension is equal to interCtxIdx (ie, a value indicating whether the current point is encoded using inter-frame prediction). For both the first and second tables, the value of the second dimension is equal to a Boolean value that is true if boundPhi-3 is greater than 6 (ie, if the maximum value that the azimuth residual can have minus 3 is greater than 6).

[0313] In another example, the sign of the azimuth residual is decoded as follows:

[0314]

[0315]

[0316] In other words, the entropy coding function (ie, encode()) takes two parameters as input. The first parameter of the entropy coding function is the value to be encoded. The second parameter of the entropy coding function is the context for encoding the value. In the above pseudo code, the value to be encoded (ie, the sign of the azimuth residual) is set to 1 when the azimuth residual (resPhi) is greater than or equal to 0, and is set to 0 when the azimuth residual is not greater than or equal to 0. In addition, the encoder 200 can look up the context in a two-dimensional table named _ctxResPhiSign. The value of the first dimension of the table is set to 2 when interCtxIdx is true, otherwise it is set to ctxL. As described above, interCtxIdx is a Boolean variable indicating whether the current point is decoded using inter-frame prediction, and ctxL indicates whether the current point is a parent node. The value of the second dimension of the table is set to 3 when interCtxIdx is true, otherwise it is set to _resPhiOldSign. value_resPhiOldSign is defined as above. After determining the context, encoder 200 may update resPhiOldSign to 2 if interFlag is true, or set _resPhiOldSign equal to 1 or 0 depending on whether resPhi is greater than or equal to 0.

[0317] In another example, the sign of the azimuth residual is decoded as follows:

[0318]

[0319] This example is similar to the previous example, except that the encoder 200 only sets the value for the second dimension of the _ctxResPhiSign table to _resPhiOldSign.

[0320] Fig.19 is a flow chart illustrating example operations of an encoder 200 in accordance with one or more techniques of this disclosure, wherein the encoder 200 determines a context for entropy encoding a residual value. Fig.19In an example, the encoder 200 (e.g., the prediction tree construction unit 207 of the encoder 200 or the encoding prediction unit 211 of the encoder 200) can determine a residual value associated with a current point of the point cloud (1900). The residual value associated with the current point can be a radius residual or an azimuth residual. The encoder 200 can determine the predictor of the current point according to any of the examples provided elsewhere in the present disclosure. For example, the encoder 200 can determine the residual value by subtracting the coordinate component of the predictor from the corresponding coordinate component of the position of the current point. For example, the encoder 200 can determine the radius residual by subtracting the radius component of the predictor from the radius component of the position of the current point. The encoder 200 can determine the azimuth residual by subtracting the azimuth component of the predictor from the azimuth component of the position of the current point.

[0321] In addition, the encoder 200 (e.g., the arithmetic coding unit 214 of the encoder 200) can determine the context for entropy encoding the residual value based on whether the current point is encoded with intra-frame prediction or inter-frame prediction (1902). Therefore, when the current point is encoded with intra-frame prediction, the encoder 200 can use a set of contexts, and when the current point is encoded with inter-frame prediction, the encoder 200 can use a different set of contexts. In some examples, the encoder 200 can further determine the context based on whether the previous point (e.g., a point encoded immediately before the current point or another point encoded before the current point) is inter-frame decoded. In other words, the encoder 200 can determine the context for entropy encoding the residual value based on whether the current point is encoded with intra-frame prediction or inter-frame prediction and based on whether the previous point is encoded with intra-frame prediction or inter-frame prediction.

[0322] In some examples where the residual value is a radius residual value, the encoder 200 may determine the context by selecting a context from a table, for example, as shown in equation (18). In some examples where the residual value is an azimuth residual value, the encoder 200 may actually determine one or more contexts for entropy encoding the residual value. For example, the encoder 200 may determine a context for entropy encoding a first value indicating whether the absolute value of the azimuth residual is greater than 0, a context for entropy encoding a second value indicating the sign of the azimuth residual, a context for entropy encoding a third value indicating whether the absolute value of the azimuth residual is greater than 1, and / or one or more contexts for entropy encoding a fourth value indicating the absolute value of the azimuth residual minus 1. The encoder 200 may determine the context for entropy encoding the first value, the second value, the third value, and / or the fourth value by selecting a context from a table based on whether the current point is inter-coded (and in some examples further based on whether the previous point is inter-coded).

[0323] The encoder 200 (e.g., the arithmetic coding unit 214 of the encoder 200) may entropy encode the residual value using the determined context (1904). For example, the encoder 200 may apply CABAC coding or exponential Golomb coding to the residual value. For example, in some examples where the residual value is an azimuth residual value, the encoder 200 may entropy encode a first value indicating whether the absolute value of the azimuth residual is greater than 0 using the context determined for the first value, entropy encode a second value indicating the sign of the azimuth residual using the context determined for the second value, entropy encode a third value indicating whether the absolute value of the azimuth residual is greater than 1 using the context for the third value, and / or entropy encode a fourth value indicating the absolute value of the azimuth residual minus 1 using one or more contexts determined for the fourth value.

[0324] Fig. 20 is a flow diagram illustrating example operation of decoder 300 in accordance with one or more techniques of this disclosure, in which decoder 300 determines a context for entropy decoding a residual value. Fig. 20 In the example of , the decoder 300 can obtain an entropy-coded residual value (2000) associated with the current point of the point cloud. The residual value associated with the current point is a radius residual or an azimuth residual. In some examples, the entropy-coded residual value can be an entropy-coded value indicating whether the absolute value of the azimuth residual is greater than 0, an entropy-coded value indicating the sign of the azimuth residual, an entropy-coded value indicating whether the absolute value of the azimuth residual is greater than 1, or an entropy-coded value indicating the absolute value of the azimuth residual minus 1.

[0325] The decoder 300 may determine a context for entropy decoding a residual value based on whether the current point is coded using intra prediction or inter prediction (2002). As described above, the decoder 300 may determine the context in the same manner as the encoder 200.

[0326] In addition, the decoder 300 may entropy decode the residual value using the determined context (2004). For example, the decoder 300 may perform CABAC decoding or exponential Golomb decoding on the residual value. The decoder 300 may reconstruct the position of the current point based on the radius residual or the azimuth residual (2006). For example, the decoder 300 may determine a predictor for the current point, such as described in any of the examples provided elsewhere in the present disclosure. In this example, the decoder 300 may add the coordinate value (e.g., radius, azimuth, laser ID) of the predictor to the corresponding residual value (e.g., radius residual value, azimuth residual value, laser ID residual value) to determine the position of the current point.

[0327] According to the third technique of the present disclosure, the prediction buffer (eg, Figure 2The prediction buffer 213 or Figure 5 The prediction buffer 215 of the encoder 200 and the decoder 300 is managed such that the estimated residual is used to compare with the threshold value Th for the inter-frame prediction point (instead of the (decoded) decoding radius residual). For the intra-frame prediction point, the absolute value of the (decoded) decoding radius residual is used to manage the prediction buffer as described above. In some examples, when the current point is decoded with inter-frame prediction, the encoder 200 and the decoder 300 update the prediction buffer such that new elements are always inserted at the front of the buffer and the last element in the buffer is discarded regardless of the threshold.

[0328] In one example, the management of the prediction buffer is modified as follows, where the change to <c> …< / c> Tag and delete <d> …< / d> Label marking:

[0329] The buffers used for predictor derivation are managed as follows. Each pair of buffers is first initialized to (0,0). After (de)coding of a point, the buffers are updated as follows:

[0330] - <c>If the point is inter-frame predicted, the variable r x is set equal to the estimated radius residual r est , the estimated radius residual value is equal to the difference between the reconstructed radius of the point and one of the radius values ​​currently in the buffer (e.g., the radius of the first entry in the list). Otherwise (the point is decoded using intra prediction), r x is set equal to the (decoded) decoding radius residual value r res .

[0331] When the point is decoded using inter prediction, the value of predIdx is set equal to 0.< / c>

[0332] -if <d> (Decoding) Decoding estimated radius residual< / d> <c> r x < / c> <d> r res < / d> If the absolute value of is higher than the threshold Th, it is considered that the laser has detected a new object. Then, the new element Inserted into the front of the buffer, where r 0 and is the reconstructed radius and reconstructed azimuth of the decoded code point. The last element of the buffer is discarded. This is done by letting the buffer element equal (for n=3 to 1). Then, the first buffer element value is set from the decoding point.

[0333] -if <d> (Decoding) Decoding< / d> <c> r x < / c> <d> r res < / d> If the absolute value of is not higher than the threshold Th, the laser is considered to have detected an object present in the buffer. Then, the element of the buffer with index predIdx (corresponding to the index of the predictor that has been used for prediction) is moved to the front of the list and replaced with ((decoding) The reconstruction radius and reconstruction azimuth of the decoding point) are updated. This is done by letting the buffer element equal (for n=predIdx to 1), and then performing the operation by setting the first buffer element value from the decoding point.

[0334] -Th is equal to ps.Gap_radius_threshold_for_pred_list and is fixed to 2048 in the encoder>>

[0335] ps.geom_angular_radius_inv_scale_log2.

[0336] In another example, a different value of Th may be selected when a coded point is inter-coded than when the point is intra-coded.

[0337] In another example, when the point is inter-coded, the last entry in the list is removed. Insert at the end of the buffer where r 0 and are the reconstruction radius and reconstruction azimuth of the (decoded) decoding point.

[0338] Fig.21 2 is a flow chart illustrating example operation of encoder 200 in which encoder 200 updates prediction buffer 213 in accordance with one or more techniques of this disclosure. Fig.21 In the example of , after encoding the first point of the point cloud, the encoder 200 (e.g., the encoding prediction unit 211 of the encoder 200) can update the prediction buffer 213 (2100) containing one or more predictors. Each corresponding predictor of the one or more predictors indicates a corresponding radius and a corresponding azimuth.

[0339] As part of updating prediction buffer 213, encoder 200 may determine whether the first point is inter-predicted (2102). If the first point is inter-predicted (the "yes" branch of 2102), encoder 200 may set a variable to an estimated radius residual value equal to the difference between the reconstructed radius of the first point and the radius value currently in prediction buffer 213 (2104). If the first point is not inter-predicted (the "no" branch of 2102), for example, if the first point is intra-predicted, encoder 200 may set the variable to the decoded radius residual value (2106).

[0340] Additionally, as part of updating prediction buffer 213, encoder 200 may determine whether the absolute value of the variable is greater than a threshold value (2108). In some examples, encoder 200 may determine the threshold value based on whether the first point is inter-predicted or intra-predicted. For example, the threshold value when the first point is intra-predicted may be greater than the threshold value when the first point is inter-predicted.

[0341] If the absolute value of the variable is greater than the threshold value (the "yes" branch of 2108), the encoder 200 may insert a new predictor into the prediction buffer 213, where the radius of the new predictor is the reconstructed radius of the first point and the azimuth of the new predictor is equal to the reconstructed azimuth of the first point (2110). The encoder 200 may remove the last coordinate pair in the coordinate list in the prediction buffer. In addition, the encoder 200 may move all coordinate pairs with indexes 0 to N-2 to indexes 1 to N-1, respectively, where N is the number of coordinate pairs in the list.

[0342] On the other hand, if the absolute value of the variable is not greater than the threshold value (the "No" branch of 2108), the encoder 200 may move the specific predictor in the prediction buffer 213 to the front of the prediction buffer 213, and may update the specific predictor with the reconstruction radius of the first point and the reconstruction azimuth of the first point (2112). The specific predictor is a predictor used to predict the first point. In an example where the first point is decoded using intra-frame prediction, the updated specific coordinate pair is a coordinate pair used to predict the first point. In an example where the first point is decoded using inter-frame prediction, the updated specific coordinate pair is the first coordinate pair in the list in the prediction buffer.

[0343] In some examples, as part of updating prediction buffer 213, decoder 300 may remove the last occurrence of the predictor in prediction buffer 213 based on the first point being inter-predicted, and may insert a new predictor at the end of prediction buffer 213. In other words, when the point is inter-coded, the last entry in the list is removed, and is inserted at the end of the prediction buffer 213, where r0 and are the reconstruction radius and reconstruction azimuth of the decoded point.

[0344] In some examples, when the second point is decoded using inter-frame prediction, the encoder 200 can update the prediction buffer 213 so that new coordinate pairs (i.e., elements) are always inserted to the front of the prediction buffer 213, and the encoder 200 discards the last element in the prediction buffer 213 regardless of the threshold.

[0345] After updating the prediction buffer 213, the encoder 200 may derive one or more predictors for the second point of the point cloud based on the coordinate pair in the prediction buffer 213 (2114). For example, assuming that the second point is not the first point of the tree (i.e., the second point has a parent point), the decoder 300 may set the first predictor equal to where θ 0 is the parent point p decoded in the parent node 0 The laser index θ value, and where is the first pair in the prediction buffer 213. The decoder 300 may set the prediction sub-PR n>0 equal where θ 0 is the laser index θ value of the parent point p0 decoded in the parent node, and where is the nth pair in buffer 213, and if Then k is equal to 0, otherwise k is equal to integer division In some examples, It can be approximated using the divApprox function of G-PCC:

[0346] The encoder 200 may then determine a predictor for the second point from among the derived predictors (2116). For example, the encoder 200 may test each of the predictors to determine which predictor results in a minimum residual value, or a residual value that can be decoded with fewer bits than the other predictors. Thus, the encoder 200 may determine a residual value for the second point based on the determined predictors (2118). To determine the residual value for the second point, the encoder 200 may determine the corresponding r, or theta minus r at the second point, or theta coordinates.

[0347] The encoder 200 may entropy encode the residual value of the second point (2120). For example, the encoder 200 may entropy encode the residual value of the second point using CABAC encoding or exponential Golomb decoding. In some examples, the encoder 200 may determine a context for entropy encoding the residual value, as described in the techniques described elsewhere in this disclosure. For example, the encoder 200 may determine the context based on whether the second point is decoded using an intra-frame predictor or an inter-frame prediction. In addition, in some examples, the encoder 200 may determine a radius residual sign flag, determine a context for entropy encoding the radius residual sign flag, as described elsewhere in this disclosure, and entropy encode the radius residual sign flag using the determined context.

[0348] Fig. 22 is a flow chart illustrating example operation of decoder 300 in which decoder 300 updates prediction buffer 315 in accordance with one or more techniques of this disclosure. Fig. 22 In the example of , after decoding the first point of the point cloud, the decoder 300 can update the prediction buffer 315 (2200) containing one or more coordinate pairs. Each corresponding coordinate pair of the one or more coordinate pairs can indicate a corresponding radius and a corresponding azimuth.

[0349] As part of updating the prediction buffer 315, the decoder 300 may determine whether the first point is inter-predicted (2202). If the first point is inter-predicted (the "yes" branch of 2202), the decoder 300 may set a variable to an estimated radius residual value equal to the difference between the reconstructed radius of the first point and the radius value currently in the prediction buffer 315 (2204). If the first point is not inter-predicted (the "no" branch of 2202), the encoder 200 may set the variable to the decoded radius residual value (2206).

[0350] Decoder 300 may then determine whether the absolute value of the variable is greater than a threshold value (2208). In some examples, decoder 300 may determine the threshold value based on whether the first point is inter-prediction or intra-prediction.

[0351] If the absolute value of the variable is greater than the threshold value (the "yes" branch of 2208), the decoder 300 can insert a new coordinate pair into the prediction buffer 315, where the radius of the new coordinate pair is the reconstructed radius of the first point and the azimuth of the new coordinate pair is equal to the reconstructed azimuth of the first point (2210). The decoder 300 can remove the last coordinate pair in the coordinate list in the prediction buffer. In addition, the decoder 300 can move all coordinate pairs with indexes 0 to N-2 to indexes 1 to N-1, respectively, where N is the number of coordinate pairs in the list.

[0352] If the absolute value of the variable is not greater than the threshold value (the "No" branch of 2208), the decoder 300 may move the specific coordinate pair in the prediction buffer 315 to the front of the prediction buffer 315, and may update the specific coordinate pair with the reconstruction radius of the first point and the reconstruction azimuth of the first point (2212). The specific coordinate pair may be a coordinate pair used for prediction of the first point. In an example where the first point is decoded using intra-frame prediction, the updated specific coordinate pair is a coordinate pair used to predict the first point. In an example where the first point is decoded using inter-frame prediction, the updated specific coordinate pair is the first coordinate pair in the list in the prediction buffer.

[0353] In other examples, decoder 300 may update prediction buffer 315 in other ways. For example, in some examples, as part of updating prediction buffer 315, decoder 300 may remove the last occurrence of a coordinate pair in prediction buffer 315 based on the first point being inter-predicted, and may insert a new coordinate pair at the end of prediction buffer 315. In other words, when the point is inter-coded, the last entry in the list is removed, and is inserted into the end of the prediction buffer 315, where r0 and are the reconstruction radius and reconstruction azimuth of the decoded point.

[0354] In some examples, when the second point is decoded using inter-frame prediction, the decoder 300 can update the prediction buffer 315 so that new coordinate pairs (i.e., elements) are always inserted to the front of the prediction buffer 315, and the decoder 300 discards the last element in the prediction buffer 315 regardless of the threshold.

[0355] After updating the prediction buffer 315, the decoder 300 may derive a predictor for a second point of the point cloud based on the coordinate pair in the prediction buffer 315 (2214). For example, assuming that the second point is not the first point of the tree (i.e., the second point has a parent point), the decoder 300 may set the first predictor equal to where θ 0 is the parent point p decoded in the parent node 0 The laser index θ value, and where is the first pair in the prediction buffer 315. The decoder 300 may set the predictor PR n>0 equal where θ 0 is the laser index θ value of the parent point p0 decoded in the parent node, and where is the nth pair in the prediction buffer 315, and if Then k is equal to 0, otherwise k is equal to integer division In some examples, It can be approximated using the divApprox function of G-PCC:

[0356] The decoder 300 may determine a predictor for the second point from among the derived predictors (2216). For example, the decoder 300 may obtain a syntax element that specifies an index of the predictor for the second point from the bitstream.

[0357] The decoder 300 may reconstruct the position of the second point based on the determined predictor (2218). For example, the decoder 300 may obtain r, In this example, the decoder 300 can obtain the residual value of one or more of the residual r, or θ coordinates are added to the corresponding r, Or theta coordinates to reconstruct the position of the second point.

[0358] In some examples, the decoder 300 may entropy decode the residual value of the second point using CABAC decoding. In some examples, the decoder 300 may determine a context for entropy decoding the residual value, as described in the techniques described elsewhere in this disclosure. For example, the decoder 300 may determine the context based on whether the second point is coded with an intra-frame predictor or an inter-frame prediction. In addition, in some examples, the decoder 300 determines a context for entropy decoding the radius residual sign flag, as described elsewhere in this disclosure, performs entropy decoding on the radius residual sign flag using the determined context, and applies the radius residual sign flag as part of determining the radius residual for the second point.

[0359] Fig.23 is a conceptual diagram illustrating an example ranging system 2300 that can be used with one or more techniques of this disclosure. Fig.23 In the example of , ranging system 2300 includes illuminator 2302 and sensor 2304. Illuminator 2302 can emit light 2306. In some examples, illuminator 2302 can emit light 2306 as one or more laser beams. Light 2306 can be at one or more wavelengths, such as infrared wavelengths or visible light wavelengths. In other examples, light 2306 is not a coherent laser. When light 2306 encounters an object such as object 2308, light 2306 produces return light 2310. Return light 2310 may include backscattered and / or reflected light. Return light 2310 may pass through lens 2311, which guides return light 2310 to produce an image 2312 of object 2308 on sensor 2304. Sensor 2304 generates signal 2314 based on image 2312. Image 2312 may include points (e.g., Fig.23 A collection of points (represented by the small dots in image 2312).

[0360] In some examples, illuminator 2302 and sensor 2304 can be mounted on a rotating structure so that illuminator 2302 and sensor 2304 capture a 360-degree view of the environment (e.g., a rotating LIDAR sensor). In other examples, ranging system 2300 can include one or more optical components (e.g., mirrors, collimators, diffraction gratings, etc.) that enable illuminator 2302 and sensor 2304 to detect objects within a certain range (e.g., up to 360 degrees). Although Fig.23 The example shows only a single illuminator 2302 and sensor 2304, but the ranging system 2300 can include multiple sets of illuminators and sensors.

[0361] In some examples, the illuminator 2302 generates a structured light pattern. In such examples, the ranging system 2300 may include a plurality of sensors 2304 on which respective images of the structured light pattern are formed. The ranging system 2300 may use differences between the images of the structured light pattern to determine the distance to an object 2308 from which the structured light pattern is backscattered. When the object 2308 is relatively close to the sensor 2304 (e.g., 0.2 meters to 2 meters), the ranging system based on structured light may have a high level of accuracy (e.g., accuracy in the sub-millimeter range). This high level of accuracy may be useful in facial recognition applications such as unlocking a mobile device (e.g., a mobile phone, a tablet computer, etc.) and for security applications.

[0362] In some examples, the ranging system 2300 is a time-of-flight (ToF) based system. In some examples where the ranging system 2300 is a ToF based system, the illuminator 2302 generates pulses of light. In other words, the illuminator 2302 can modulate the amplitude of the emitted light 2306. In such examples, the sensor 2304 detects the return light 2310 from the pulse of light 2306 generated by the illuminator 2302. The ranging system 2300 can then determine the distance to the object 2308 from which the light 2306 is backscattered based on the delay between when the light 2306 is emitted and when the light is detected and the known speed of light in air. In some examples, the illuminator 2302 can modulate the phase of the emitted light 2306 instead of (or in addition to) modulating the amplitude of the emitted light 2306. In such an example, sensor 2304 can detect the phase of return light 2310 from object 2308 and determine the distance to a point on object 2308 using the speed of light and based on the time difference between when illuminator 2302 generates light 2306 at a particular phase and when sensor 2304 detects return light 2310 at that particular phase.

[0363] In other examples, the point cloud can be generated without using the illuminator 2302. For example, in some examples, the sensor 2304 of the ranging system 2300 can include two or more optical cameras. In such examples, the ranging system 2300 can use the optical cameras to capture a stereoscopic image of an environment including the object 2308. The ranging system 2300 can include a point cloud generator 2316 that can calculate the differences between the locations in the stereoscopic images. The ranging system 2300 can then use these differences to determine the distances to the locations shown in the stereoscopic images. Based on these distances, the point cloud generator 2316 can generate a point cloud.

[0364] Sensor 2304 may also detect other properties of object 2308, such as color and reflectivity information. Fig.23In the example of , the point cloud generator 2316 can generate a point cloud based on the signal 2114 generated by the sensor 2304. The ranging system 2300 and / or the point cloud generator 2316 can form a data source 104 ( Figure 1 ). Therefore, the point cloud generated by the ranging system 2300 can be encoded and / or decoded according to any technology of the present disclosure. Inter-frame prediction and residual prediction as described in the present disclosure can reduce the size of the encoded data.

[0365] Fig.24 is a conceptual diagram illustrating an example vehicle-based scenario in which one or more techniques of the present disclosure may be used. Fig.24 In the example of FIG. 24, vehicle 2400 includes ranging system 2402. Ranging system 2402 can be used to measure Fig.23 The discussed method is implemented. Fig.24 Although not shown in the example of FIG. 24 , the vehicle 2400 may also include a data source such as the data source 104 ( Figure 1 ) and a G-PCC encoder, such as G-PCC encoder 200 ( Figure 1 ).exist Fig.24 In the example of FIG. 24 , a range finding system 2402 emits laser beams 2404 that are reflected from pedestrians 2406 or other objects on the road. A data source of vehicle 2400 can generate a point cloud based on the signal generated by the range finding system 2402. A G-PCC encoder of vehicle 2400 can encode the point cloud to generate a bitstream 2408, such as a geometry bitstream 203 ( Figure 2 ) and attribute bitstream 205 ( Figure 2 ). Inter-frame prediction and residual prediction as described in the present disclosure can reduce the size of the geometry bitstream. The bitstream 2408 can include significantly fewer bits than the unencoded point cloud obtained by the G-PCC encoder.

[0366] The output interface of the vehicle 2400 (eg, the output interface 108 ( Figure 1 )) can send the bitstream 2408 to one or more other devices. The bitstream 2408 may include significantly fewer bits than the unencoded point cloud obtained by the G-PCC encoder. Therefore, the vehicle 2400 can send the bitstream 2408 to other devices faster than the unencoded point cloud data. In addition, the bitstream 2408 may require less data storage capacity on the device.

[0367] exist Fig.24 In the example of FIG. 24 , vehicle 2400 may send bitstream 2408 to another vehicle 2410. Vehicle 2410 may include a G-PCC decoder, such as G-PCC decoder 300 ( Figure 1). The G-PCC decoder of vehicle 2410 can decode the bitstream 2408 to reconstruct the point cloud. Vehicle 2410 can use the reconstructed point cloud for various purposes. For example, vehicle 2410 can determine that pedestrian 2406 is on the road ahead of vehicle 2400 based on the reconstructed point cloud, and therefore begin to slow down, for example, even before the driver of vehicle 2410 realizes that pedestrian 2406 is on the road. Therefore, in some examples, vehicle 2410 can perform autonomous navigation operations based on the reconstructed point cloud.

[0368] Additionally or alternatively, the vehicle 2400 can send a bitstream 2408 to the server system 2412. The server system 2412 can use the bitstream 2408 for various purposes. For example, the server system 2412 can store the bitstream 2408 for subsequent reconstruction of the point cloud. In this example, the server system 2412 can use the point cloud together with other data (e.g., vehicle telemetry data generated by the vehicle 2400) to train an autonomous driving system. In other examples, the server system 2412 can store the bitstream 2408 for subsequent reconstruction for accident forensic investigations.

[0369] Fig.25 is a conceptual diagram illustrating an example extended reality system in which one or more technologies of the present disclosure may be used. Extended reality (XR) is a term used to cover a range of technologies including augmented reality (AR), mixed reality (MR), and virtual reality (VR). Fig.25 In the example of FIG. 2 , user 2500 is located in a first location 2502. User 2500 wears an XR headset 2504. As an alternative to the XR headset 2504, user 2500 may use a mobile device (e.g., a mobile phone, a tablet computer, etc.). The XR headset 2504 includes a depth detection sensor, such as a range finding system, that detects the position of a point on an object 2506 at the location 2502. The data source of the XR headset 2504 may use the signal generated by the depth detection sensor to generate a point cloud representation of the object 2506 at the location 2502. The XR headset 2504 may include a G-PCC encoder (e.g., Figure 1 The G-PCC encoder 200 is configured to encode the point cloud to generate a bitstream 2508. Inter-frame prediction and residual prediction as described in the present disclosure can reduce the size of the bitstream 2508.

[0370] The XR headset 2504 may send a bitstream 2508 to an XR headset 2510 worn by a user 2512 at a second location 2514 (e.g., via a network, such as the Internet). The XR headset 2510 may decode the bitstream 2508 to reconstruct a point cloud. The XR headset 2510 may use the point cloud to generate an XR visualization (e.g., AR visualization, MR visualization, VR visualization) representing the object 2506 at the location 2502. Thus, in some examples, such as when the XR headset 2510 generates a VR visualization, the user 2512 may have a 3D immersive experience of the location 2502. In some examples, the XR headset 2510 may determine the location of a virtual object based on the reconstructed point cloud. For example, the XR headset 2510 may determine that the environment (e.g., location 2502) includes a flat surface based on the reconstructed point cloud, and then determine that a virtual object (e.g., a cartoon character) is to be positioned on the flat surface. The XR headset 2510 may generate an XR visualization in which the virtual object is located at the determined location. For example, the XR headset 2510 may show a cartoon character sitting on the flat surface.

[0371] Fig.26 is a conceptual diagram illustrating an example mobile device system in which one or more techniques of this disclosure may be used. Fig.26 In an example of FIG. 1 , a mobile device 2600 (e.g., a wireless communication device) such as a mobile phone or tablet includes a range finding system such as a LIDAR system that detects the location of points on an object 2602 in the environment of the mobile device 2600. A data source of the mobile device 2600 may use a signal generated by a depth detection sensor to generate a point cloud representation of the object 2602. The mobile device 2600 may include a G-PCC encoder (e.g., Figure 1 The G-PCC encoder 200 is configured to encode the point cloud to generate a bitstream 2604. Fig.26In an example, the mobile device 2600 may send a bitstream to a remote device 2606 (such as a server system or other mobile device). Inter-frame prediction and residual prediction as described in the present disclosure may reduce the size of the bitstream 2604. The remote device 2606 may decode the bitstream 2604 to reconstruct a point cloud. The remote device 2606 may use the point cloud for various purposes. For example, the remote device 2606 may use the point cloud to generate an environmental map of the mobile device 2600. For example, the remote device 2606 may generate an internal map of a building based on the reconstructed point cloud. In another example, the remote device 2606 may generate an image (e.g., computer graphics) based on the point cloud. For example, the remote device 2606 may use the points in the point cloud as vertices of a polygon and use the color attributes of the points as the basis for coloring the polygon. In some examples, the remote device 2606 may use the reconstructed point cloud for facial recognition or other security applications.

[0372] The examples in various aspects of this disclosure may be used alone or in any combination.

[0373] The following is a non-limiting list of provisions in accordance with one or more techniques of the present disclosure.

[0374] Item 1A: A method for encoding a point cloud, the method comprising: determining a sign of a radius residual of a current point of the point cloud; determining a context for entropy encoding a radius residual sign flag indicating the sign of the radius residual of the current point, wherein determining the context for entropy encoding the radius residual sign flag comprises: determining the context for entropy encoding the radius residual sign flag based on whether a previously decoded point is inter-coded and whether the current point is inter-coded; and entropy encoding the radius residual sign flag using the determined context.

[0375] Item 2A: A method for decoding a point cloud, the method comprising: obtaining an entropy-encoded radius residual symbol flag indicating a sign of a radius residual of a current point of the point cloud; determining a context for entropy decoding the radius residual symbol flag, wherein determining the context for entropy encoding the radius residual symbol flag comprises: determining the context for entropy encoding the radius residual symbol flag based on whether a previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded; entropy decoding the radius residual symbol flag using the determined context; and reconstructing the position of the current point based on the radius residual symbol flag.

[0376] Item 3A: A method for encoding a point cloud, the method comprising: determining a residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; determining a context for entropy encoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; and entropy encoding the residual value using the determined context.

[0377] Item 4A: A method for decoding a point cloud, the method comprising: obtaining an entropy-encoded residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; determining a context for entropy encoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; entropy decoding the residual value using the determined context; and reconstructing the position of the current point based on the radius residual or the azimuth residual.

[0378] Clause 5A: A method for encoding a point cloud, the method comprising: after encoding a first point of the point cloud, updating a prediction buffer comprising one or more predictors, each respective predictor of the one or more predictors indicating a respective radius and a respective azimuth, wherein updating the prediction buffer comprises: based on the first point being inter-predicted, setting a variable to be equal to an estimated radius residual value of a difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer; and one of the following: based on an absolute value of the variable being greater than a threshold, inserting a new predictor into the prediction buffer, wherein the new predictor The radius of the predictor is the reconstruction radius of the first point, and the azimuth of the new predictor is equal to the reconstruction azimuth of the first point; or based on the absolute value of the variable being not greater than the threshold, the specific predictor in the prediction buffer is moved to the front of the prediction buffer, and the specific predictor is updated with the reconstruction radius of the first point and the reconstruction azimuth of the first point, wherein the specific predictor is used for the prediction of the first point; determine the predictor for the second point of the point cloud in the prediction buffer; determine the residual value of the second point based on the determined predictor; and entropy encode the residual value of the second point.

[0379] Clause 6A: The method according to clause 5A further includes: after encoding a third point of the point cloud: based on the third point being intra-predicted, setting the variable to the decoded radius residual value of the third point; and one of the following: based on the absolute value of the variable being greater than the threshold, inserting a second new predictor into the prediction buffer, wherein the radius of the second new predictor is the reconstructed radius of the third point and the azimuth of the new predictor is equal to the reconstructed azimuth of the third point; or based on the absolute value of the variable being not greater than the threshold, updating a second specific predictor with the reconstructed radius of the third point and the reconstructed azimuth of the third point, wherein the second specific predictor is the first occurrence of the predictor in the predictor buffer.

[0380] Clause 7A: The method of any of clauses 5A to 6A, further comprising determining the threshold based on whether the first point is inter-predicted or inter-predicted.

[0381] Clause 8A: A method according to any one of clauses 5A to 7A, wherein updating the prediction buffer further comprises: removing the last occurrence of the predictor in the prediction buffer based on the first point being inter-frame predicted; and inserting the new predictor at the end of the prediction buffer.

[0382] Item 9A: A method for decoding a point cloud, the method comprising: after decoding a first point of the point cloud, updating a prediction buffer comprising one or more predictors, each corresponding predictor of the one or more predictors indicating a corresponding radius and a corresponding azimuth, wherein updating the prediction buffer comprises: based on the first point being inter-frame predicted, setting a variable to an estimated radius residual value, the estimated radius residual value being equal to the difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer; and one of the following: based on the absolute value of the variable being greater than a threshold, inserting a new predictor into the prediction buffer, wherein the radius of the new predictor is the reconstructed radius of the first point, and the azimuth of the new predictor is equal to the reconstructed azimuth of the first point; or based on the absolute value of the variable being not greater than the threshold, moving a specific predictor in the prediction buffer to the front of the prediction buffer and updating the specific predictor with the reconstructed radius of the first point and the reconstructed azimuth of the first point, wherein the specific predictor is used for prediction of the first point; determining a predictor in the prediction buffer for a second point of the point cloud; and reconstructing a value of the second point based on the determined predictor.

[0383] Clause 10A: The method according to clause 9A further includes: after decoding a third point of the point cloud: based on the third point being intra-predicted, setting the variable to the decoded radius residual value of the third point; and one of the following: based on the absolute value of the variable being greater than the threshold, inserting a second new predictor into the prediction buffer, wherein the radius of the second new predictor is the reconstructed radius of the third point and the azimuth of the new predictor is equal to the reconstructed azimuth of the third point; or based on the absolute value of the variable being not greater than the threshold, updating a second specific predictor with the reconstructed radius of the third point and the reconstructed azimuth of the third point, wherein the second specific predictor is the first occurrence of the predictor in the predictor buffer.

[0384] Clause 11A: The method of any of clauses 9A to 10A, further comprising determining the threshold based on whether the first point is inter-predicted or inter-predicted.

[0385] Clause 12A: A method according to any one of clauses 9A to 11A, wherein updating the prediction buffer further comprises: removing the last occurrence of the predictor in the prediction buffer based on the first point being inter-frame predicted; and inserting the new predictor at the end of the prediction buffer.

[0386] Clause 13A: A method of encoding or decoding a point cloud according to any of the techniques of this disclosure.

[0387] Clause 14A: An apparatus for encoding or decoding a point cloud, the apparatus comprising one or more means for performing the method of any of clauses 1A to 13A.

[0388] Clause 15A: The apparatus of clause 14A, wherein the one or more components comprise one or more processors implemented in circuitry.

[0389] Clause 16A: The apparatus of any of clauses 14A or 15A, further comprising a memory to store the data representing the point cloud.

[0390] Clause 17A: Apparatus as recited in any of clauses 14A to 16A, wherein the apparatus comprises a decoder.

[0391] Clause 18A: The apparatus of any of clauses 14A to 17A, wherein the apparatus comprises an encoder.

[0392] Clause 19A: The apparatus of any of clauses 14A to 18A, further comprising means for generating the point cloud.

[0393] Clause 20A: The apparatus of any of clauses 14A to 19A, further comprising a display for presenting an image based on the point cloud.

[0394] Clause 21A: A computer-readable storage medium having stored thereon instructions which, when executed, cause one or more processors to perform the method of any of clauses 1A to 13A.

[0395] Item 1B. A device for encoding a point cloud, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in a circuit and coupled to the memory, the one or more processors configured to: determine a sign of a radius residual of a current point of the point cloud; determine a context for entropy encoding a radius residual sign flag indicating the sign of the radius residual of the current point based on whether a previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded; and entropy encode the radius residual sign flag using the determined context.

[0396] Clause 2B. An apparatus according to clause 1B, wherein the one or more processors are configured to look up the context based on whether a previous point was inter-frame decoded, whether the current point is inter-frame decoded, whether the predictor of the current point is the parent node of the current point, whether the number of azimuth steps decoded by the previous point is equal to zero, whether the number of azimuth steps decoded by the current point is equal to zero, and the sign of the last decoded radius residual as part of determining the context for entropy encoding the radius residual sign flag.

[0397] Clause 3B. An apparatus according to any one of clauses 1B to 2B, wherein the one or more processors are configured to: as part of determining a context for entropy encoding the radius residual sign flag: determine a context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determine a value of a variable, wherein the one or more processors are configured to: as part of determining the value of the variable: determine that the value of the variable is equal to an indication A Boolean value indicating whether the previous point is inter-frame decoding is multiplied by a Boolean value indicating whether the current point is inter-frame decoding, or the value of the variable is determined to be equal to the minimum of the following: 1 and a value equal to the Boolean value indicating whether the previous point is inter-frame decoding plus the Boolean value indicating whether the current point is inter-frame decoding; and looking up the context in a three-dimensional table, wherein the value of the first dimension of the table indicates whether the previous point is inter-frame decoding, the value of the second dimension of the table indicates whether the current point is inter-frame decoding, and the value of the third dimension of the table is equal to 0 if the value of the variable is true, otherwise equal to the context index.

[0398] Clause 4B. A device according to any one of clauses 1B to 3B, wherein the one or more processors are configured to: as part of determining the context for entropy encoding the radius residual sign flag: determine an intra-frame context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determine an inter-frame context index based on whether the previous point is inter-frame decoded and whether the current point is inter-frame decoded; and look up the context in a two-dimensional table, wherein the value of the first dimension of the table is the inter-frame context index, and the value of the second dimension of the table is equal to 0 when the current point is inter-frame decoded, otherwise equal to the intra-frame context index.

[0399] Clause 5B. An apparatus according to any one of clauses 1B to 3B, wherein the one or more processors are configured to: as part of determining the context for entropy encoding the radius residual sign flag: determine an intra-frame context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; and look up the context in a two-dimensional table, wherein: the value of the first dimension of the table is equal to 2 when the current point is inter-frame decoding, otherwise it is equal to a Boolean value indicating whether the previous point is inter-frame prediction, and the value of the second dimension of the table is equal to 0 when the current point is inter-frame decoding, otherwise it is equal to the intra-frame context index.

[0400] Clause 6B. The apparatus of any of Clauses 1B to 5B, further comprising means for generating the point cloud.

[0401] Clause 7B. An apparatus according to any one of clauses 1B to 6N, wherein the one or more processors are further configured to: determine a second context for entropy encoding one or more syntax elements associated with an azimuth residual indicating the magnitude of the azimuth residual of the current point based on whether the previously decoded point is inter-frame decoded and / or whether the current point is inter-frame decoded; and entropy encode the azimuth residual using the determined second context.

[0402] Item 8B. A device for decoding a point cloud, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in a circuit and coupled to the memory, the one or more processors configured to: obtain an entropy-encoded radius residual symbol flag indicating a sign of a radius residual of a current point of the point cloud; determine a context for entropy decoding the radius residual symbol flag based on whether a previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded; entropy decode the radius residual symbol flag using the determined context; and reconstruct the position of the current point based on the radius residual symbol flag.

[0403] Clause 9B. An apparatus according to clause 8B, wherein the one or more processors are configured to look up the context based on whether a previous point was inter-frame decoded, whether the current point is inter-frame decoded, whether the predictor of the current point is the parent node of the current point, whether the number of azimuth steps decoded by the previous point is equal to zero, whether the number of azimuth steps decoded by the current point is equal to zero, and the sign of the last decoded radius residual as part of determining the context for entropy decoding of the radius residual sign flag.

[0404] Clause 10B. An apparatus according to any one of clauses 8B to 9B, wherein the one or more processors are configured to: as part of determining the context for entropy decoding the radius residual sign flag: determine a context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determine the value of a variable, wherein the one or more processors are configured to: as part of determining the value of the variable: determine that the value of the variable is equal to A Boolean value indicating whether the previous point is inter-coded is multiplied by a Boolean value indicating whether the current point is inter-coded, or the value of the variable is determined to be equal to the minimum of: 1 and a value equal to the Boolean value indicating whether the previous point is inter-coded plus the Boolean value indicating whether the current point is inter-coded; and looking up the context in a three-dimensional table, wherein the value of the first dimension of the table indicates whether the previous point is inter-coded, the value of the second dimension of the table indicates whether the current point is inter-coded, and the value of the third dimension of the table is equal to 0 if the value of the variable is true, otherwise equal to the context index.

[0405] Clause 11B. An apparatus according to any one of clauses 8B to 10B, wherein the one or more processors are configured to: as part of determining the context for entropy decoding the radius residual sign flag: determine an intra-frame context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determine an inter-frame context index based on whether the previous point is inter-frame decoded and whether the current point is inter-frame decoded; and look up the context in a two-dimensional table, wherein the value of the first dimension of the table is the inter-frame context index, and the value of the second dimension of the table is equal to 0 when the current point is inter-frame decoded, otherwise equal to the intra-frame context index.

[0406] Clause 12B. An apparatus according to any one of clauses 8B to 10B, wherein the one or more processors are configured to: as part of determining the context for entropy decoding the radius residual sign flag: determine an intra-frame context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; and look up the context in a two-dimensional table, wherein: the value of the first dimension of the table is equal to 2 when the current point is inter-frame decoding, otherwise it is equal to a Boolean value indicating whether the previous point is inter-frame prediction, and the value of the second dimension of the table is equal to 0 when the current point is inter-frame decoding, otherwise it is equal to the intra-frame context index.

[0407] Clause 13B. The apparatus of any of clauses 8B to 12B, further comprising a display for presenting an image based on the point cloud.

[0408] Clause 14B. A device according to any one of clauses 8B to 13B, the device further comprising: determining a second context for entropy encoding one or more syntax elements associated with an azimuth residual indicating the magnitude of the azimuth residual of the current point based on whether the previously decoded point is inter-frame decoded and / or whether the current point is inter-frame decoded; and entropy decoding the azimuth residual using the determined second context.

[0409] Clause 15B. A method for encoding a point cloud, the method comprising: determining a sign of a radius residual of a current point of the point cloud; determining a context for entropy encoding a radius residual sign flag indicating the sign of the radius residual of the current point, wherein determining the context for entropy encoding the radius residual sign flag comprises: determining the context for entropy encoding the radius residual sign flag based on whether a previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded; and entropy encoding the radius residual sign flag using the determined context.

[0410] Clause 16B. A method according to clause 15B, wherein determining the context for entropy encoding the radius residual sign flag includes: looking up the context based on whether the previous point is inter-frame decoded, whether the current point is inter-frame decoded, whether the predictor of the current point is the parent node of the current point, whether the number of azimuth steps for decoding of the previous point is equal to zero, whether the number of azimuth steps for decoding of the current point is equal to zero, and the sign of the last decoded radius residual.

[0411] Clause 17B. A method according to any one of clauses 15B to 16B, wherein determining the context for entropy encoding the radius residual sign flag includes: determining a context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determining the value of a variable, wherein determining the value of the variable includes one of the following: determining that the value of the variable is equal to a Boolean value indicating whether the previous point is inter-frame decoding Multiplying by a Boolean value indicating whether the current point is inter-coded, or determining that the value of the variable is equal to the minimum of: 1 and a value equal to the Boolean value indicating whether the previous point is inter-coded plus the Boolean value indicating whether the current point is inter-coded; and looking up the context in a three-dimensional table, wherein a value of a first dimension of the table indicates whether the previous point is inter-coded, a value of a second dimension of the table indicates whether the current point is inter-coded, and a value of a third dimension of the table is equal to 0 if the value of the variable is true, otherwise equal to the context index.

[0412] Clause 18B. A method according to any one of clauses 15B to 17B, wherein determining the context for entropy encoding the radius residual sign flag includes: determining an intra-frame context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determining an inter-frame context index based on whether the previous point is inter-frame coded and whether the current point is inter-frame coded; and looking up the context in a two-dimensional table, wherein the value of the first dimension of the table is the inter-frame context index, and the value of the second dimension of the table is equal to 0 when the current point is inter-frame coded, otherwise equal to the intra-frame context index.

[0413] Clause 19B. A method according to any one of clauses 15B to 17B, wherein determining the context for entropy encoding the radius residual sign flag includes: determining an intra-frame context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; and looking up the context in a two-dimensional table, wherein: the value of the first dimension of the table is equal to 2 when the current point is inter-frame decoding, otherwise it is equal to a Boolean value indicating whether the previous point is inter-frame prediction, and the value of the second dimension of the table is equal to 0 when the current point is inter-frame decoding, otherwise it is equal to the intra-frame context index.

[0414] Clause 20B. According to a method described in any one of clauses 15B to 19B, the method further includes: determining a second context for entropy encoding one or more syntax elements associated with an azimuth residual indicating the magnitude of the azimuth residual of the current point based on whether the previously decoded point is inter-frame decoded and / or whether the current point is inter-frame decoded; and entropy encoding the azimuth residual using the determined second context.

[0415] Clause 21B. A method for decoding a point cloud, the method comprising: obtaining an entropy-encoded radius residual symbol flag indicating a sign of a radius residual of a current point of the point cloud; determining a context for entropy decoding the radius residual symbol flag, wherein determining the context for entropy decoding the radius residual symbol flag comprises: determining the context for entropy decoding the radius residual symbol flag based on whether a previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded; entropy decoding the radius residual symbol flag using the determined context; and reconstructing the position of the current point based on the radius residual symbol flag.

[0416] Clause 22B. A method according to clause 21B, wherein determining the context for entropy decoding the radius residual sign flag includes: looking up the context based on whether the previous point is inter-frame coded, whether the current point is inter-frame coded, whether the predictor of the current point is the parent node of the current point, whether the number of azimuth steps for decoding of the previous point is equal to zero, whether the number of azimuth steps for decoding of the current point is equal to zero, and the sign of the last decoded radius residual.

[0417] Clause 23B. A method according to any one of clauses 21B to 22B, wherein determining the context for entropy decoding the radius residual sign flag includes: determining a context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determining the value of a variable, wherein determining the value of the variable includes one of the following: determining that the value of the variable is equal to a Boolean value indicating whether the previous point is inter-frame decoding Multiplying by a Boolean value indicating whether the current point is inter-coded, or determining that the value of the variable is equal to the minimum of: 1 and a value equal to the Boolean value indicating whether the previous point is inter-coded plus the Boolean value indicating whether the current point is inter-coded; and looking up the context in a three-dimensional table, wherein a value of a first dimension of the table indicates whether the previous point is inter-coded, a value of a second dimension of the table indicates whether the current point is inter-coded, and a value of a third dimension of the table is equal to 0 if the value of the variable is true, otherwise equal to the context index.

[0418] Clause 24B. A method according to any one of clauses 21B to 23B, wherein determining the context for entropy decoding the radius residual sign flag includes: determining an intra-frame context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determining an inter-frame context index based on whether the previous point is inter-frame coded and whether the current point is inter-frame coded; and looking up the context in a two-dimensional table, wherein the value of the first dimension of the table is the inter-frame context index, and the value of the second dimension of the table is equal to 0 when the current point is inter-frame coded, otherwise equal to the intra-frame context index.

[0419] Clause 25B. A method according to any one of clauses 21B to 23B, wherein determining the context for entropy decoding the radius residual sign flag comprises: determining an intra-frame context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; and looking up the context in a two-dimensional table, wherein: the value of the first dimension of the table is equal to 2 when the current point is inter-frame decoding, otherwise it is equal to a Boolean value indicating whether the previous point is inter-frame prediction, and the value of the second dimension of the table is equal to 0 when the current point is inter-frame decoding, otherwise it is equal to the intra-frame context index.

[0420] Clause 26B. A device according to any one of clauses 21B to 25B, the device further comprising: determining a second context for entropy encoding one or more syntax elements associated with an azimuth residual indicating the magnitude of the azimuth residual of the current point based on whether the previously decoded point is inter-frame decoded and / or whether the current point is inter-frame decoded; and entropy decoding the azimuth residual using the determined second context.

[0421] Clause 27B. A device for encoding a point cloud, the device comprising: a component for determining a sign of a radius residual of a current point of the point cloud; a component for determining a context for entropy encoding a radius residual sign flag indicating the sign of the radius residual of the current point, wherein determining the context for entropy encoding the radius residual sign flag comprises: determining the context for entropy encoding the radius residual sign flag based on whether a previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded; and a component for entropy encoding the radius residual sign flag using the determined context.

[0422] Item 28B. A device for decoding a point cloud, the device comprising: a component for obtaining an entropy-encoded radius residual symbol flag indicating a sign of a radius residual of a current point of the point cloud; a component for determining a context for entropy decoding the radius residual symbol flag, wherein determining the context for entropy decoding the radius residual symbol flag comprises: determining the context for entropy decoding the radius residual symbol flag based on whether a previously decoded point is inter-frame decoded and whether the current point is inter-frame decoded; a component for entropy decoding the radius residual symbol flag using the determined context; and a component for reconstructing the position of the current point based on the radius residual symbol flag.

[0423] Item 1C. A device for encoding a point cloud, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in a circuit and coupled to the memory, the one or more processors configured to: determine a residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; determine a context for entropy encoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; and entropy encode the residual value using the determined context.

[0424] Clause 2C. A device according to clause 1, wherein the one or more processors are configured to, as part of determining the context: determine the context for entropy encoding the residual value based on whether the current point is encoded using intra-frame prediction or inter-frame prediction and based on whether the previous point was encoded using intra-frame prediction or inter-frame prediction.

[0425] Clause 3C. An apparatus according to any one of clauses 1B to 2C, wherein the context for entropy encoding the residual value is one of: a context for entropy encoding a first value indicating whether the absolute value of the azimuth residual is greater than 0, a context for entropy encoding a second value indicating the sign of the azimuth residual, a context for entropy encoding a third value indicating whether the absolute value of the azimuth residual is greater than 1, or a context for entropy encoding a fourth value indicating the absolute value of the azimuth residual minus 1.

[0426] Clause 4C. An apparatus according to any one of clauses 1C to 3C, wherein the context for entropy encoding the residual value is a context for entropy encoding a second value of a sign indicating the azimuth residual, and the one or more processors are configured to, as part of determining the context: set the value of a first dimension of a lookup table to 2 if a Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, and set the value of the first dimension to a Boolean variable indicating whether the current point is a parent node; set the value of a second dimension of the lookup table to 3 if the Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, otherwise set it to a value with a different value, depending on whether a previous point was intra-coded and the azimuth residual of the previous point is less than 0, whether the previous point was intra-coded and the azimuth residual of the previous point is greater than or equal to 0, or whether the previous point was inter-coded; and search the context in the lookup table based on the value of the first dimension and the value of the second dimension.

[0427] Clause 5C. An apparatus according to any one of clauses 1C to 4C, wherein the context for entropy encoding the residual value is a context for entropy encoding a second value of a sign indicating the azimuth residual, and the one or more processors are configured to, as part of determining the context: set the value of a first dimension of a lookup table to be equal to 2 when a Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, and set the value of the first dimension to a Boolean variable indicating whether the current point is a parent node; set the value of a second dimension of the lookup table to be equal to a value having a different value, depending on whether a previous point was intra-frame decoded and the azimuth residual of the previous point is less than 0, whether the previous point was intra-frame decoded and the azimuth residual of the previous point is greater than or equal to 0, or whether the previous point was inter-frame decoded; and search the context in the lookup table based on the value of the first dimension and the value of the second dimension.

[0428] Clause 6C. The apparatus of any of Clauses 1C to 6C, further comprising means for generating the point cloud.

[0429] Item 7C. A device for decoding a point cloud, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors, the one or more processors configured to: obtain an entropy-encoded residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; determine a context for entropy decoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; entropy decode the residual value using the determined context; and reconstruct the position of the current point based on the radius residual or the azimuth residual.

[0430] Clause 8C. A device according to Clause 7C, wherein the one or more processors are configured to, as part of determining the context: determine the context for entropy decoding the residual value based on whether the current point is encoded using intra-frame prediction or inter-frame prediction and based on whether the previous point was encoded using intra-frame prediction or inter-frame prediction.

[0431] Clause 9C. An apparatus according to any one of clauses 7C to 8C, wherein the context for entropy decoding the residual value is one of: a context for entropy decoding a first value indicating whether the absolute value of the azimuth residual is greater than 0, a context for entropy decoding a second value indicating the sign of the azimuth residual, a context for entropy decoding a third value indicating whether the absolute value of the azimuth residual is greater than 1, or a context for entropy decoding a fourth value indicating the absolute value of the azimuth residual minus 1.

[0432] Clause 10C. An apparatus according to any one of clauses 7C to 9C, wherein the context for entropy decoding the residual value is a context for entropy decoding a second value of a symbol indicating the azimuth residual, and the one or more processors are configured to include, as part of determining the context: setting the value of a first dimension of a lookup table to 2 when a Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, and setting the value of the first dimension to a Boolean variable indicating whether the current point is a parent node; setting the value of a second dimension of the lookup table to 3 when the Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, otherwise setting it to a value with a different value, depending on whether a previous point is intra-frame decoded and the azimuth residual of the previous point is less than 0, whether the previous point is intra-frame decoded and the azimuth residual of the previous point is greater than or equal to 0, or whether the previous point is inter-frame decoded; and searching the context in the lookup table based on the value of the first dimension and the value of the second dimension.

[0433] Clause 11C. An apparatus according to any one of clauses 7C to 10C, wherein the context for entropy decoding the residual value is a context for entropy decoding a second value of a symbol indicating the azimuth residual, and the one or more processors are configured to, as part of determining the context: set the value of a first dimension of a lookup table to be equal to 2 when a Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, and set the value of the first dimension to a Boolean variable indicating whether the current point is a parent node; set the value of a second dimension of the lookup table to be equal to a value having a different value, depending on whether a previous point is intra-frame decoded and the azimuth residual of the previous point is less than 0, whether the previous point is intra-frame decoded and the azimuth residual of the previous point is greater than or equal to 0, or whether the previous point is inter-frame decoded; and search the context in the lookup table based on the value of the first dimension and the value of the second dimension.

[0434] Clause 12C. The apparatus of any of Clauses 7C to 11C, further comprising a display to present an image based on the point cloud.

[0435] Clause 13C. A method for encoding a point cloud, the method comprising: determining a residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; determining a context for entropy encoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; and entropy encoding the residual value using the determined context.

[0436] Clause 14C. The method of clause 13C, wherein determining the context comprises determining the context for entropy encoding the residual value based on whether the current point is encoded using intra prediction or inter prediction and based on whether a previous point was encoded using intra prediction or inter prediction.

[0437] Clause 15C. A method according to any one of clauses 13C to 14C, wherein the context for entropy encoding the residual value is one of: a context for entropy encoding a first value indicating whether the absolute value of the azimuth residual is greater than 0, a context for entropy encoding a second value indicating the sign of the azimuth residual, a context for entropy encoding a third value indicating whether the absolute value of the azimuth residual is greater than 1, or a context for entropy encoding a fourth value indicating the absolute value of the azimuth residual minus 1.

[0438] Clause 16C. A method according to any one of clauses 13C to 15C, wherein the context for entropy encoding the residual value is a context for entropy encoding a second value of a sign indicating the azimuth residual, and determining the context includes: setting the value of a first dimension of a lookup table to 2 when a Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, and setting the value of the first dimension to a Boolean variable indicating whether the current point is a parent node; setting the value of a second dimension of the lookup table to 3 when the Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, otherwise setting it to a value with a different value, depending on whether the previous point is intra-frame decoded and the azimuth residual of the previous point is less than 0, whether the previous point is intra-frame decoded and the azimuth residual of the previous point is greater than or equal to 0, or whether the previous point is inter-frame decoded; and searching the context in the lookup table based on the value of the first dimension and the value of the second dimension.

[0439] Clause 17C. A method according to any one of clauses 13C to 16C, wherein the context for entropy encoding the residual value is a context for entropy encoding a second value of a sign indicating the azimuth residual, and determining the context includes: setting the value of a first dimension of a lookup table to 2 when a Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, and setting the value of the first dimension to a Boolean variable indicating whether the current point is a parent node; setting the value of a second dimension of the lookup table to a value having a different value, depending on whether a previous point is intra-decoded and the azimuth residual of the previous point is less than 0, whether the previous point is intra-decoded and the azimuth residual of the previous point is greater than or equal to 0, or whether the previous point is inter-coded; and searching the context in the lookup table based on the value of the first dimension and the value of the second dimension.

[0440] Clause 18C. A method for decoding a point cloud, the method comprising: obtaining an entropy-encoded residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; determining a context for entropy decoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; entropy decoding the residual value using the determined context; and reconstructing the position of the current point based on the radius residual or the azimuth residual.

[0441] Clause 19C. The method of clause 18C, wherein determining the context comprises determining the context for entropy decoding the residual value based on whether the current point is encoded using intra prediction or inter prediction and based on whether a previous point is encoded using intra prediction or inter prediction.

[0442] Clause 20C. A method according to any one of clauses 18C to 19C, wherein the context for entropy decoding the residual value is one of: a context for entropy decoding a first value indicating whether the absolute value of the azimuth residual is greater than 0, a context for entropy decoding a second value indicating the sign of the azimuth residual, a context for entropy decoding a third value indicating whether the absolute value of the azimuth residual is greater than 1, or a context for entropy decoding a fourth value indicating the absolute value of the azimuth residual minus 1.

[0443] Clause 21C. A method according to any one of clauses 18C to 20C, wherein the context for entropy decoding the residual value is a context for entropy decoding a second value of a symbol indicating the azimuth residual, and determining the context includes: when a Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, setting the value of a first dimension of a lookup table to be equal to 2, and setting the value of the first dimension to a Boolean variable indicating whether the current point is a parent node; when the Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, setting the value of a second dimension of the lookup table to be equal to 3, otherwise setting it to a value with a different value, depending on whether the previous point is intra-frame decoded and the azimuth residual of the previous point is less than 0, whether the previous point is intra-frame decoded and the azimuth residual of the previous point is greater than or equal to 0, or whether the previous point is inter-frame decoded; and searching the context in the lookup table based on the value of the first dimension and the value of the second dimension.

[0444] Clause 22C. A method according to any one of clauses 18C to 21C, wherein the context for entropy decoding the residual value is a context for entropy decoding a second value of a symbol indicating the azimuth residual, and determining the context includes: setting the value of a first dimension of a lookup table to 2 when a Boolean variable indicating whether the current point is decoded using inter-frame prediction is true, and setting the value of the first dimension to a Boolean variable indicating whether the current point is a parent node; setting the value of a second dimension of the lookup table to a value having a different value, depending on whether a previous point is intra-frame decoded and the azimuth residual of the previous point is less than 0, whether the previous point is intra-frame decoded and the azimuth residual of the previous point is greater than or equal to 0, or whether the previous point is inter-frame decoded; and searching the context in the lookup table based on the value of the first dimension and the value of the second dimension.

[0445] Clause 23C. A device for decoding a point cloud, the device comprising: a component for determining a residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; a component for determining a context for entropy encoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; and a component for entropy encoding the residual value using the determined context.

[0446] Clause 24C. A device for encoding a point cloud, the device comprising: a component for determining a residual value associated with a current point of the point cloud, the residual value associated with the current point being a radius residual or an azimuth residual; a component for determining a context for entropy encoding the residual value based on whether the current point is decoded using intra-frame prediction or inter-frame prediction; and a component for entropy encoding the residual value using the determined context.

[0447] Item 1D. A device for encoding a point cloud, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in a circuit and coupled to the memory, the one or more processors configured to: after encoding a first point of the point cloud, update a prediction buffer comprising one or more coordinate pairs, each corresponding coordinate pair in the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein the one or more processors are configured as part of updating the prediction buffer: based on the first point being inter-frame predicted, setting a variable to an estimated radius residual value equal to the difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer; based on the absolute value of the variable being greater than a threshold, Insert a new coordinate pair into the prediction buffer, wherein the radius of the new coordinate pair is the reconstruction radius of the first point, and the azimuth of the new predictor is equal to the reconstruction azimuth of the first point; and based on the absolute value of the variable being not greater than the threshold, move a specific coordinate pair in the prediction buffer to the front of the prediction buffer, and update the specific coordinate pair with the reconstruction radius of the first point and the reconstruction azimuth of the first point, wherein based on the first point being inter-frame predicted, the specific coordinate pair is the first coordinate pair in the prediction buffer; based on the coordinate pair in the prediction buffer, derive one or more predictors for a second point of the point cloud; determine a predictor for the second point from among the derived predictors; and determine a residual value for the second point based on the determined predictor.

[0448] Clause 2D. The apparatus of clause 1D, wherein the one or more processors are further configured to entropy encode the residual value of the second point.

[0449] Clause 3D. A device according to any one of clauses 1D to 2D, wherein the one or more processors are further configured to: after encoding a third point of the point cloud: based on the third point being intra-predicted, set the variable to the decoded radius residual value of the third point; based on the absolute value of the variable being greater than the threshold, insert a second new coordinate pair into the prediction buffer, wherein the radius of the second new coordinate pair is the reconstructed radius of the third point, and the azimuth of the new coordinate pair is equal to the reconstructed azimuth of the third point; and based on the absolute value of the variable being not greater than the threshold, move a second specific coordinate pair in the prediction buffer to the front of the prediction buffer, and update the second specific coordinate pair with the reconstructed radius of the first point and the reconstructed azimuth of the first point, wherein the second specific coordinate pair is used for the prediction of the first point.

[0450] Clause 4D. The apparatus of any of clauses 1D to 3D, wherein the one or more processors are further configured to determine the threshold based on whether the first point is inter-predicted or intra-predicted.

[0451] Clause 5D. A device according to any one of clauses 1D to 4D, wherein the one or more processors are also configured to, as part of updating the prediction buffer, further: remove the last occurring coordinate pair in the prediction buffer based on the first point being inter-frame predicted; and insert the new coordinate pair at the end of the prediction buffer.

[0452] Clause 6D. The apparatus of any of clauses 1D to 5D, further comprising means for generating the point cloud.

[0453] Item 7D. A device for decoding a point cloud, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in a circuit and coupled to the memory, the one or more processors configured to: after decoding a first point of the point cloud, update a prediction buffer comprising one or more coordinate pairs, each corresponding coordinate pair in the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein the one or more processors are configured as part of updating the prediction buffer: based on the first point being inter-frame predicted, setting a variable to an estimated radius residual value equal to the difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer; based on the absolute value of the variable being greater than a threshold , inserting a new coordinate pair into the prediction buffer, wherein the radius of the new coordinate pair is the reconstruction radius of the first point, and the azimuth of the new predictor is equal to the reconstruction azimuth of the first point; and based on the absolute value of the variable being not greater than the threshold, moving a specific coordinate pair in the prediction buffer to the front of the prediction buffer, and updating the specific coordinate pair with the reconstruction radius of the first point and the reconstruction azimuth of the first point, wherein based on the first point being inter-frame predicted, the specific coordinate pair is the first coordinate pair in the prediction buffer; based on the coordinate pair in the prediction buffer, deriving one or more predictors for a second point of the point cloud; determining a predictor for the second point from among the derived predictors; and reconstructing the position of the second point based on the determined predictor.

[0454] Item 8D. A device according to Item 7D, wherein the one or more processors are further configured to: after decoding a third point of the point cloud: based on the third point being intra-predicted, set the variable to the decoded radius residual value of the third point; and one of the following: based on the absolute value of the variable being greater than the threshold, insert a second new coordinate pair into the prediction buffer, wherein the radius of the second new coordinate pair is the reconstructed radius of the third point, and the azimuth of the new coordinate pair is equal to the reconstructed azimuth of the third point; or based on the absolute value of the variable being not greater than the threshold, move a second specific coordinate pair in the prediction buffer to the front of the prediction buffer, and update the second specific coordinate pair with the reconstructed radius of the first point and the reconstructed azimuth of the first point, wherein the second specific coordinate pair is used for the prediction of the first point.

[0455] Clause 9D. The apparatus of any of clauses 7D to 9D, wherein the one or more processors are further configured to determine the threshold based on whether the first point is inter-predicted or intra-predicted.

[0456] Clause 10D. A device according to any one of clauses 7D to 9D, wherein the one or more processors are configured to, as part of updating the prediction buffer, further: remove the last occurring coordinate pair in the prediction buffer based on the first point being inter-frame predicted; and insert the new coordinate pair at the end of the prediction buffer.

[0457] Clause 11D. The apparatus of any of clauses 7D to 10D, further comprising a display to present an image based on the point cloud.

[0458] Item 12D. A method for encoding a point cloud, the method comprising: after encoding a first point of the point cloud, updating a prediction buffer comprising one or more coordinate pairs, each corresponding coordinate pair in the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein updating the prediction buffer comprises: based on the first point being inter-frame predicted, setting a variable to an estimated radius residual value equal to the difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer; and one of the following: based on the absolute value of the variable being greater than a threshold, inserting a new coordinate pair into the prediction buffer, wherein the radius of the new coordinate pair is the reconstructed radius of the first point, and and the azimuth of the new predictor is equal to the reconstructed azimuth of the first point; or based on the absolute value of the variable being not greater than the threshold, the specific coordinate pair in the prediction buffer is moved to the front of the prediction buffer, and the specific coordinate pair is updated with the reconstruction radius of the first point and the reconstructed azimuth of the first point, wherein based on the first point being inter-frame predicted, the specific coordinate pair is the first coordinate pair in the prediction buffer; based on the coordinate pair in the prediction buffer, one or more predictors for a second point of the point cloud are derived; a predictor for the second point is determined from among the derived predictors; and a residual value for the second point is determined based on the determined predictor.

[0459] Clause 13D. The method of clause 12D, further comprising entropy encoding the residual value of the second point.

[0460] Clause 14D. According to the method described in any one of clauses 12D to 13D, the method also includes: after encoding the third point of the point cloud: based on the third point being intra-predicted, setting the variable to the decoded radius residual value of the third point; and one of the following: based on the absolute value of the variable being greater than the threshold, inserting a second new coordinate pair into the prediction buffer, wherein the radius of the second new coordinate pair is the reconstructed radius of the third point, and the azimuth of the new coordinate pair is equal to the reconstructed azimuth of the third point; or based on the absolute value of the variable being not greater than the threshold, moving the second specific coordinate pair in the prediction buffer to the front of the prediction buffer, and updating the second specific coordinate pair with the reconstructed radius of the first point and the reconstructed azimuth of the first point, wherein the second specific coordinate pair is used for the prediction of the first point.

[0461] Clause 15D. The method of any of clauses 12D to 14D, further comprising determining the threshold based on whether the first point is inter-predicted or intra-predicted.

[0462] Clause 16D. A method according to any one of clauses 12D to 15D, wherein updating the prediction buffer further comprises: removing the last occurring coordinate pair in the prediction buffer based on the first point being inter-frame predicted; and inserting the new coordinate pair at the end of the prediction buffer.

[0463] Item 17D. A method for decoding a point cloud, the method comprising: after decoding a first point of the point cloud, updating a prediction buffer comprising one or more coordinate pairs, each corresponding coordinate pair of the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein updating the prediction buffer comprises: based on the first point being inter-frame predicted, setting a variable to an estimated radius residual value, the estimated radius residual value being equal to the difference between the reconstructed radius of the first point and the radius value currently in the prediction buffer; and one of the following: based on the absolute value of the variable being greater than a threshold, inserting a new coordinate pair into the prediction buffer, wherein the radius of the new coordinate pair is the reconstructed radius of the first point. The invention relates to a method for reconstructing a point cloud by using a prediction buffer of a first point and a reconstructed radius, and the azimuth of the new prediction sub-point is equal to the reconstructed azimuth of the first point; and based on the absolute value of the variable being not greater than the threshold value, moving the specific coordinate pair in the prediction buffer to the front of the prediction buffer, and updating the specific coordinate pair with the reconstruction radius of the first point and the reconstructed azimuth of the first point, wherein based on the first point being inter-frame predicted, the specific coordinate pair is the first coordinate pair in the prediction buffer; based on the coordinate pair in the prediction buffer, deriving one or more prediction sub-points for a second point of the point cloud; determining the prediction sub-point from among the derived prediction sub-points; and reconstructing the position of the second point based on the determined prediction sub-points.

[0464] Clause 18D. The method according to Clause 17D further includes: after decoding the third point of the point cloud: based on the third point being intra-predicted, setting the variable to the decoded radius residual value of the third point; and one of the following: based on the absolute value of the variable being greater than the threshold, inserting a second new coordinate pair into the prediction buffer, wherein the radius of the second new coordinate pair is the reconstructed radius of the third point, and the azimuth of the new coordinate pair is equal to the reconstructed azimuth of the third point; or based on the absolute value of the variable being not greater than the threshold, moving the second specific coordinate pair in the prediction buffer to the front of the prediction buffer, and updating the second specific coordinate pair with the reconstructed radius of the first point and the reconstructed azimuth of the first point, wherein the second specific coordinate pair is used for the prediction of the first point.

[0465] Clause 19D. The method of any of clauses 17D to 18D, further comprising determining the threshold based on whether the first point is inter-predicted or intra-predicted.

[0466] Clause 20D. A method according to any one of clauses 17D to 19D, wherein updating the prediction buffer further comprises: removing the last occurring coordinate pair in the prediction buffer based on the first point being inter-frame predicted; and inserting the new coordinate pair at the end of the prediction buffer.

[0467] Item 21D. A device for encoding a point cloud, the device comprising: a component for updating a prediction buffer containing one or more coordinate pairs after encoding a first point of the point cloud, each corresponding coordinate pair of the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein the component for updating the prediction buffer comprises: a component for setting a variable equal to an estimated radius residual value of a difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer based on that the first point is inter-frame predicted; a component for inserting a new coordinate pair into the prediction buffer based on an absolute value of the variable being greater than a threshold, wherein the radius of the new coordinate pair is the reconstructed radius of the first point, and the The azimuth of the new predictor is equal to the reconstructed azimuth of the first point; or a component for moving a specific coordinate pair in the prediction buffer to the front of the prediction buffer based on the absolute value of the variable being not greater than the threshold and updating the specific coordinate pair with the reconstruction radius of the first point and the reconstructed azimuth of the first point, wherein the specific coordinate pair is the first coordinate pair in the prediction buffer based on the first point being inter-frame predicted; a component for deriving one or more predictors for a second point of the point cloud based on the coordinate pair in the prediction buffer; a component for determining a predictor for the second point from among the derived predictors; and a component for determining a residual value for the second point based on the determined predictor.

[0468] Item 22D. A device for decoding a point cloud, the device comprising: a component for updating a prediction buffer containing one or more coordinate pairs after decoding a first point of the point cloud, each corresponding coordinate pair of the one or more coordinate pairs indicating a corresponding radius and a corresponding azimuth, wherein the component for updating the prediction buffer comprises: a component for setting a variable to be equal to an estimated radius residual value of the difference between a reconstructed radius of the first point and a radius value currently in the prediction buffer based on that the first point is inter-frame predicted; a component for inserting a new coordinate pair into the prediction buffer based on an absolute value of the variable being greater than a threshold, wherein the radius of the new coordinate pair is the reconstructed radius of the first point, and the The azimuth of the new predictor is equal to the reconstructed azimuth of the first point; and a component for moving a specific coordinate pair in the prediction buffer to the front of the prediction buffer and updating the specific coordinate pair with the reconstruction radius of the first point and the reconstructed azimuth of the first point based on the absolute value of the variable being not greater than the threshold, wherein the specific coordinate pair is the first coordinate pair in the prediction buffer based on that the first point is inter-frame predicted; a component for deriving one or more predictors for a second point of the point cloud based on the coordinate pairs in the prediction buffer; a component for determining a predictor for the second point from among the derived predictors; and a component for reconstructing the position of the second point based on the determined predictor.

[0469] It should be appreciated that, according to examples, certain actions or events of any technique described herein may be performed in a different order, may be added, combined, or omitted entirely (e.g., not all described actions or events are necessary to implement the technique). In addition, in some examples, actions or events may be performed concurrently (e.g., by multithreading, interrupt handling, or multiple processors) rather than sequentially.

[0470] In one or more examples, the described functionality may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functionality may be stored as one or more instructions or codes on a computer-readable medium or sent via a computer-readable medium and executed by a hardware-based processing unit. A computer-readable medium may include a computer-readable storage medium (which corresponds to a tangible medium such as a data storage medium) or a communication medium, which includes, for example, any medium that facilitates the transfer of a computer program from one place to another according to a communication protocol. In this manner, a computer-readable medium may generally correspond to (1) a non-transient tangible computer-readable storage medium, or (2) a communication medium (such as a signal or carrier wave). A data storage medium may be any available medium that can be accessed by one or more computers or one or more processors to retrieve instructions, codes, and / or data structures for implementing the techniques described in the present disclosure. A computer program product may include a computer-readable medium.

[0471] By way of example and not limitation, such computer-readable storage media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage or other magnetic storage devices, flash memory, or any other medium that can be used to store the desired program code in the form of instructions or data structures and can be accessed by a computer. In addition, any connection is appropriately referred to as a computer-readable medium. For example, if the instruction is sent from a website, server or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL) or wireless technology (such as infrared, radio and microwave), the coaxial cable, fiber optic cable, twisted pair, DSL or wireless technology (such as infrared, radio and microwave) is included in the definition of the medium. However, it should be understood that computer-readable storage media and data storage media do not include connections, carrier waves, signals or other transient media, but instead relate to non-transient tangible storage media. As used herein, disks and optical disks include compact disks (CDs), laser optical disks, optical disks, digital versatile disks (DVDs), floppy disks and blue-ray disks, wherein disks usually reproduce data magnetically, while optical disks reproduce data optically using lasers. Combinations of the above should also be included within the scope of computer-readable media.

[0472] Instructions may be executed by one or more processors, such as one or more digital signal processors (DSPs), general-purpose microprocessors, application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other equivalent integrated or discrete logic circuits. Therefore, the terms "processor" and "processing circuitry" as used herein may refer to any of the aforementioned structures or any other structure suitable for implementing the techniques described herein. In addition, in some aspects, the functionality described herein may be provided within dedicated hardware and / or software modules configured for encoding and decoding, or incorporated into a combined codec. In addition, these techniques may be fully implemented in one or more circuits or logic elements.

[0473] The techniques of the present disclosure may be implemented in a variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC), or a set of ICs (e.g., a chipset). Various components, modules, or units are described in the present disclosure to emphasize functional aspects of a device configured to perform the disclosed techniques, but implementation by different hardware units is not necessarily required. Instead, as described above, the various units may be combined in a codec hardware unit, or the various units may be provided by a collection of interoperable hardware units (including one or more processors as described above) in combination with appropriate software and / or firmware.

[0474] Various examples have been described. These and other examples are within the scope of the following claims.

Claims

1. A device for encoding a point cloud, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in circuitry and coupled to the memory, the one or more processors being configured to: Determining the sign of the radius residual of the current point of the point cloud; determining a context for entropy encoding a radius residual sign flag indicating the sign of the radius residual for the current point based on whether a previously coded point is inter-coded and whether the current point is inter-coded; as well as The radius residual sign flag is entropy encoded using the determined context.

2. An apparatus according to claim 1, wherein the one or more processors are configured to look up the context based on whether a previous point is inter-frame decoded, whether the current point is inter-frame decoded, whether the predictor of the current point is the parent node of the current point, whether the number of azimuth steps decoded by the previous point is equal to zero, whether the number of azimuth steps decoded by the current point is equal to zero, and the sign of the last decoded radius residual as part of determining the context for entropy encoding the radius residual sign flag.

3. The apparatus of claim 1 , wherein the one or more processors are configured, as part of determining the context for entropy encoding the radius residual sign flag: Determining a context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determining a value of a variable, wherein the one or more processors are configured as part of determining the value of the variable: determining that the value of the variable is equal to a Boolean value indicating whether the previous point is inter-coded multiplied by a Boolean value indicating whether the current point is inter-coded, or determining that the value of the variable is equal to the minimum of: 1 and a value equal to the Boolean value indicating whether the previous point is inter-coded plus the Boolean value indicating whether the current point is inter-coded; as well as The context is looked up in a three-dimensional table, wherein a value of a first dimension of the table indicates whether a previous point is inter-coded, a value of a second dimension of the table indicates whether the current point is inter-coded, and a value of a third dimension of the table is equal to 0 if the value of the variable is true, otherwise equal to the context index.

4. The apparatus of claim 1 , wherein the one or more processors are configured, as part of determining the context for entropy encoding the radius residual sign flag: Determining an intra context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determining an inter-frame context index based on whether the previous point is inter-frame decoded and whether the current point is inter-frame decoded; as well as The context is looked up in a two-dimensional table, wherein a value of a first dimension of the table is the inter-frame context index, and a value of a second dimension of the table is equal to 0 if the current point is inter-frame decoding, otherwise equal to the intra-frame context index.

5. The apparatus of claim 1 , wherein the one or more processors are configured, as part of determining the context for entropy encoding the radius residual sign flag: Determine an intra context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the previous point is equal to zero, whether the number of azimuth steps of the current point is equal to zero, and the sign of the last decoded radius residual; and The context is looked up in a two-dimensional table, where: The value of the first dimension of the table is equal to 2 if the current point is inter-coded, otherwise equal to a Boolean value indicating whether the previous point was inter-predicted, and The value of the second dimension of the table is equal to 0 if the current point is inter-frame decoding, and is equal to the intra-frame context index otherwise. The device according to claim 1 , further comprising a device for generating the point cloud.

7. The device of claim 1, wherein the one or more processors are further configured to: Determining, based on whether the previously coded point is inter-coded and / or whether the current point is inter-coded, a second context for entropy encoding one or more syntax elements associated with the azimuth residual indicating a magnitude of the azimuth residual for the current point; and The azimuth residual is entropy encoded using the determined second context.

8. A device for decoding a point cloud, the device comprising: a memory configured to store point cloud data about the point cloud; and one or more processors implemented in circuitry and coupled to the memory, the one or more processors being configured to: Obtaining an entropy-coded radius residual sign flag indicating a sign of a radius residual of a current point of the point cloud; Determining a context for entropy decoding the radius residual sign flag based on whether a previously decoded point is inter-coded and whether the current point is inter-coded; entropy decoding the radius residual sign flag using the determined context; as well as The position of the current point is reconstructed based on the radius residual sign flag.

9. An apparatus according to claim 8, wherein the one or more processors are configured to look up the context based on whether a previous point is inter-frame decoded, whether the current point is inter-frame decoded, whether the predictor of the current point is the parent node of the current point, whether the number of azimuth steps decoded by the previous point is equal to zero, whether the number of azimuth steps decoded by the current point is equal to zero, and the sign of the last decoded radius residual as part of determining the context for entropy decoding of the radius residual sign flag.

10. The apparatus of claim 8, wherein the one or more processors are configured, as part of determining the context for entropy decoding the radius residual sign flag: Determining a context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determining a value of a variable, wherein the one or more processors are configured as part of determining the value of the variable: determining that the value of the variable is equal to a Boolean value indicating whether the previous point is inter-coded multiplied by a Boolean value indicating whether the current point is inter-coded, or determining that the value of the variable is equal to the minimum of: 1 and a value equal to the Boolean value indicating whether the previous point is inter-coded plus the Boolean value indicating whether the current point is inter-coded; as well as The context is looked up in a three-dimensional table, wherein a value of a first dimension of the table indicates whether a previous point is inter-coded, a value of a second dimension of the table indicates whether the current point is inter-coded, and a value of a third dimension of the table is equal to 0 if the value of the variable is true, otherwise equal to the context index.

11. The apparatus of claim 8, wherein the one or more processors are configured, as part of determining the context for entropy decoding the radius residual sign flag: Determining an intra context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determining an inter-frame context index based on whether the previous point is inter-frame decoded and whether the current point is inter-frame decoded; as well as The context is looked up in a two-dimensional table, wherein a value of a first dimension of the table is the inter-frame context index, and a value of a second dimension of the table is equal to 0 if the current point is inter-frame decoding, otherwise equal to the intra-frame context index.

12. The apparatus of claim 8, wherein the one or more processors are configured, as part of determining the context for entropy decoding the radius residual sign flag: Determine an intra context index based on whether the selected predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the previous point is equal to zero, whether the number of azimuth steps of the current point is equal to zero, and the sign of the last decoded radius residual; and The context is looked up in a two-dimensional table, where: The value of the first dimension of the table is equal to 2 if the current point is inter-coded, otherwise equal to a Boolean value indicating whether the previous point was inter-predicted, and The value of the second dimension of the table is equal to 0 if the current point is inter-frame decoding, and is equal to the intra-frame context index otherwise.

13. The device of claim 8, further comprising a display for presenting an image based on the point cloud.

14. The device according to claim 8, further comprising: determining, based on whether the previously coded point is inter-coded and / or whether the current point is inter-coded, a second context for entropy encoding one or more syntax elements associated with the azimuth residual indicating a magnitude of the azimuth residual for the current point; as well as The azimuth residual is entropy decoded using the determined second context.

15. A method for encoding a point cloud, the method comprising: Determining the sign of the radius residual of the current point of the point cloud; Determining a context for entropy encoding a radius residual sign flag indicating the sign of the radius residual of the current point, wherein determining the context for entropy encoding the radius residual sign flag comprises: determining the context for entropy encoding the radius residual sign flag based on whether a previously coded point is inter-coded and whether the current point is inter-coded; as well as The radius residual sign flag is entropy encoded using the determined context.

16. The method of claim 15, wherein determining the context for entropy encoding the radius residual sign flag comprises: The context is found based on whether the previous point is inter-frame coded, whether the current point is inter-frame coded, whether the predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual.

17. The method of claim 15, wherein determining the context for entropy encoding the radius residual sign flag comprises: Determining a context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; Determining a value of a variable, wherein determining the value of the variable comprises one of: determining that the value of the variable is equal to a Boolean value indicating whether the previous point is inter-coded multiplied by a Boolean value indicating whether the current point is inter-coded, or determining that the value of the variable is equal to the minimum of: 1 and a value equal to the Boolean value indicating whether the previous point is inter-coded plus the Boolean value indicating whether the current point is inter-coded; as well as The context is looked up in a three-dimensional table, wherein a value of a first dimension of the table indicates whether a previous point is inter-coded, a value of a second dimension of the table indicates whether the current point is inter-coded, and a value of a third dimension of the table is equal to 0 if the value of the variable is true, otherwise equal to the context index.

18. The method of claim 15, wherein determining the context for entropy encoding the radius residual sign flag comprises: Determining an intra context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determining an inter-frame context index based on whether the previous point is inter-frame decoded and whether the current point is inter-frame decoded; as well as The context is looked up in a two-dimensional table, wherein a value of a first dimension of the table is the inter-frame context index, and a value of a second dimension of the table is equal to 0 if the current point is inter-frame decoding, otherwise equal to the intra-frame context index.

19. The method of claim 15, wherein determining the context for entropy encoding the radius residual sign flag comprises: Determining an intra context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; as well as The context is looked up in a two-dimensional table, where: The value of the first dimension of the table is equal to 2 if the current point is inter-coded, otherwise equal to a Boolean value indicating whether the previous point was inter-predicted, and The value of the second dimension of the table is equal to 0 if the current point is inter-frame decoding, and is equal to the intra-frame context index otherwise.

20. The method according to claim 15, further comprising: determining, based on whether the previously coded point is inter-coded and / or whether the current point is inter-coded, a second context for entropy encoding one or more syntax elements associated with the azimuth residual indicating a magnitude of the azimuth residual for the current point; as well as The azimuth residual is entropy encoded using the determined second context.

21. A method for decoding a point cloud, the method comprising: Obtaining an entropy-coded radius residual sign flag indicating a sign of a radius residual of a current point of the point cloud; Determining a context for entropy decoding the radius residual sign flag, wherein determining the context for entropy decoding the radius residual sign flag comprises: determining the context for entropy decoding the radius residual sign flag based on whether a previously decoded point is inter-coded and whether the current point is inter-coded; entropy decoding the radius residual sign flag using the determined context; and The position of the current point is reconstructed based on the radius residual sign flag.

22. The method of claim 21 , wherein determining the context for entropy decoding the radius residual sign flag comprises: The context is found based on whether the previous point is inter-frame coded, whether the current point is inter-frame coded, whether the predictor of the current point is the parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual.

23. The method of claim 21 , wherein determining the context for entropy decoding the radius residual sign flag comprises: Determining a context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; Determining a value of a variable, wherein determining the value of the variable comprises one of: determining that the value of the variable is equal to a Boolean value indicating whether the previous point is inter-coded multiplied by a Boolean value indicating whether the current point is inter-coded, or determining that the value of the variable is equal to the minimum of: 1 and a value equal to the Boolean value indicating whether the previous point is inter-coded plus the Boolean value indicating whether the current point is inter-coded; as well as The context is looked up in a three-dimensional table, wherein a value of a first dimension of the table indicates whether a previous point is inter-coded, a value of a second dimension of the table indicates whether the current point is inter-coded, and a value of a third dimension of the table is equal to 0 if the value of the variable is true, otherwise equal to the context index.

24. The method of claim 21 , wherein determining the context for entropy decoding the radius residual sign flag comprises: Determining an intra context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; determining an inter-frame context index based on whether the previous point is inter-frame decoded and whether the current point is inter-frame decoded; as well as The context is looked up in a two-dimensional table, wherein a value of a first dimension of the table is the inter-frame context index, and a value of a second dimension of the table is equal to 0 if the current point is inter-frame decoding, otherwise equal to the intra-frame context index.

25. The method of claim 21 , wherein determining the context for entropy decoding the radius residual sign flag comprises: Determining an intra context index based on whether the selected predictor of the current point is a parent node of the current point, whether the number of azimuth steps of the decoding of the previous point is equal to zero, whether the number of azimuth steps of the decoding of the current point is equal to zero, and the sign of the last decoded radius residual; as well as The context is looked up in a two-dimensional table, where: The value of the first dimension of the table is equal to 2 if the current point is inter-coded, otherwise equal to a Boolean value indicating whether the previous point was inter-predicted, and The value of the second dimension of the table is equal to 0 if the current point is inter-frame decoding, and is equal to the intra-frame context index otherwise.

26. The device of claim 21, further comprising: determining, based on whether the previously coded point is inter-coded and / or whether the current point is inter-coded, a second context for entropy encoding one or more syntax elements associated with the azimuth residual indicating a magnitude of the azimuth residual for the current point; as well as The azimuth residual is entropy decoded using the determined second context.

27. A device for encoding a point cloud, the device comprising: means for determining a sign of a radius residual of a current point of the point cloud; means for determining a context for entropy encoding a radius residual sign flag indicating the sign of the radius residual for the current point, wherein determining the context for entropy encoding the radius residual sign flag comprises: determining the context for entropy encoding the radius residual sign flag based on whether a previously coded point is inter-coded and whether the current point is inter-coded; and Means for entropy encoding the radius residual sign flag using the determined context.

28. A device for decoding a point cloud, the device comprising: means for obtaining an entropy encoded radius residual sign flag indicating a sign of a radius residual for a current point of the point cloud; means for determining a context for entropy decoding the radius residual sign flag, wherein determining the context for entropy decoding the radius residual sign flag comprises: determining the context for entropy decoding the radius residual sign flag based on whether a previously coded point is inter-coded and whether the current point is inter-coded; means for entropy decoding the radius residual sign flag using the determined context; and Means for reconstructing a position of the current point based on the radius residual sign.