Method and apparatus for encoding / decoding point cloud geometry data captured by a self-rotating sensor head - Patents.com

By encoding azimuth data with boundary values dependent on sensor characteristics, the method improves the efficiency of point cloud compression for sparse geometry data captured by self-rotating sensor heads, addressing latency and compression challenges in autonomous vehicle applications.

JP7588734B2Active Publication Date: 2024-11-22BEIJING XIAOMI MOBILE SOFTWARE CO LTD
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
JP2023560503
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2021-04-08
Filing Date
2021-10-13
Publication Date
2024-11-22
Estimated Expiration
2041-10-13

AI Technical Summary

Technical Problem

Existing point cloud compression methods are inefficient for sparse geometry data captured by self-rotating sensor heads, particularly in applications requiring low latency and high compression performance, such as autonomous vehicles, due to the complexity of encoding and decoding processes.

Method used

A method for encoding and decoding point cloud data using boundary values based on sensor characteristics, where azimuth data is quantized and encoded to ensure its absolute value is limited by a boundary value, improving encoding efficiency.

Benefits of technology

This approach enhances the encoding efficiency of point cloud geometry data captured by self-rotating sensor heads, reducing latency and improving compression performance for sparse data, making it suitable for real-time applications like autonomous navigation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007588734000001
    Figure 0007588734000001
  • Figure 0007588734000002
    Figure 0007588734000002
  • Figure 0007588734000003
    Figure 0007588734000003
Patent Text Reader

Abstract

A method and apparatus for encoding / decoding a point cloud representing a physical object is provided, where points are captured by a self-rotating sensor head and are represented by a sensor index associated with the sensor that captured the point, an azimuth angle representing the capture angle of the sensor, and a radius value of the spherical coordinates of the point. coded,n ) is encoded / decoded. coded,n ) is the azimuth angle (Φ(P n )) The azimuth angle data (Φ coded,n ) is based on a boundary value (B) that depends on the characteristics of the sensor, and the azimuth angle data (Φ coded,n ) is limited by said bound value.
Need to check novelty before this filing date? Find Prior Art

Description

Cross-references to related applications

[0001] This application claims priority to European Patent Application No. EP21305456.2, filed April 8, 2021, the contents of which are incorporated by reference in their entirety into this disclosure. [Technical field]

[0002] This application relates generally to point cloud compression, and more specifically to a method and apparatus for encoding / decoding point cloud geometry data captured with a self-rotating sensor head. [Background technology]

[0003] This section is intended to introduce the reader to various aspects of the art, which may be related to various aspects of at least one exemplary embodiment of the present application that is described and / or claimed below. This discussion is believed to be helpful in providing the reader with background information to better understand all aspects of the present application.

[0004] Point clouds have recently gained attention as a format to represent 3D data. It varies in its ability to represent all types of physical objects or scenarios. Point clouds can be used for various purposes, such as cultural heritage / architecture, where objects like sculptures or buildings are scanned in a 3D way to share the spatial configuration of the object without transmitting or accessing it. It is also a way to ensure that knowledge of the object is preserved in case it may be destroyed. For example, a temple destroyed in an earthquake. Usually, this type of point cloud is static, colored and huge.

[0005] Another use case is in topography and cartography, where 3D representations are used to allow maps to be not limited to flat surfaces but to include relief. Google Maps is currently a good example of a 3D map, but it uses meshes rather than point clouds. However, point clouds can be an appropriate data format for 3D maps, and usually this type of point cloud is static, colored, and large.

[0006] Virtual reality (VR), augmented reality (AR) and immersive worlds have been a hot topic lately and are seen by many as the future of 2D tablet video. The basic idea is to immerse the viewer in the surrounding environment, whereas standard TV only allows the viewer to see the virtual world in front of him / her. There are several levels of immersion depending on the viewer's degree of freedom in the environment. Point clouds are a good format candidate to distribute VR / AR worlds.

[0007] The automotive industry, especially the foreseeable field of autonomous vehicles, is also an area where point clouds can be used extensively. Autonomous vehicles should be able to "sense" their environment in order to make better driving decisions based on the presence and nature of detected objects in their nearest vicinity, and on the road layout.

[0008] A point cloud is a collection of points located in three-dimensional (3D) space, optionally with additional values ​​attached to each point. These additional values ​​are typically called attributes. An attribute may be, for example, a three-component color, a material property (e.g., reflectance), and / or a two-component surface normal vector associated with the point.

[0009] A point cloud is therefore a combination of geometry (the positions of points in 3D space, usually expressed as 3D Cartesian coordinates x, y, z) and attributes.

[0010] Point clouds can be captured by various types of devices, such as an array of cameras, depth sensors, lasers (also called light detection and ranging, laser lidar), radar, or they can be computer-generated (e.g., in movie post-production). Depending on the use case, for cartography, a point cloud may contain thousands to billions of points. The original representation of the point cloud requires a very large number of bits per point, at least a dozen bits per Cartesian coordinate x, y, or z, and optionally provides more bits for one or more attributes, e.g., three times the 10 bits for color.

[0011] In many applications it is important to be able to distribute point clouds to end users or store them on servers while maintaining an acceptable (or preferably very good) quality of experience, consuming only a reasonable amount of bitrate or storage space. Efficient compression of these point clouds is a key point for the practical realization of many immersive world distribution chains.

[0012] For distribution and visualization by end users, e.g., in AR / VR glasses or any other 3D-enabled device, the compression may be lossy (e.g., in the case of video compression), but other use cases, such as medical applications or autonomous driving, require lossless compression in order not to alter the decisions obtained from subsequent analysis of the compressed and transmitted point cloud.

[0013] Until recently, the mass market had no solution for point cloud compression (aka PCC) and no standardized point cloud decoders available. In 2017, the standardization working group ISO / JCT1 / SC29 / WG11, also known as the Motion Picture Experts Group or MPEG, started a work project on point cloud compression. This resulted in two standards: MPEG-I Part 5 (ISO / IEC 23090-5) or Video-Based Point Cloud Compression (V-PCC) MPEG-I Part 9 (ISO / IEC 23090-9) or Geometry-Based Point Cloud Compression (G-PCC)

[0014] The V-PCC coding method compresses point clouds by multiple projections onto a 3D object to obtain 2D patches that are packaged into an image (or video in the case of processing dynamic point clouds). It compresses images and videos captured with existing image / video codecs, making the most of image and video solutions already in place. By its very nature, V-PCC is only efficient with dense and continuous point clouds, since image / video codecs cannot compress non-smooth patches, such as those obtained from projections of sparse geometry data captured by laser lidar.

[0015] The G-PCC encoding method has two approaches to compress the captured sparse geometry data.

[0016] The first approach is based on an occupancy tree, which is any type of tree - locally octtree, quaternary tree, binary tree - to represent the point cloud geometry. Occupied nodes are split until a certain size is reached, and the 3D positions of the points are provided by occupied leaf nodes, which are usually located at the centers of these nodes. The occupancy information is carried by occupancy flags, which send signals to communicate the occupancy state of each of the node's subnodes. By using a neighborhood-based prediction technique, a high level of compression of the occupied flags for dense point clouds can be obtained. Sparse point clouds can also be solved by directly encoding the positions of non-minimal sized points in the node, stopping the tree construction when only isolated points exist in the node. Such a technique is called direct coding mode (DCM).

[0017] The second approach is based on a prediction tree, where each node represents the 3D location of a point, and the parent / child relationships between nodes represent the spatial prediction from parent to child. This approach only solves sparse point clouds, and offers the advantages of lower latency and easier decoding than occupancy trees. However, it offers only a small improvement in compression performance over the first occupancy-based approach, and increases the coding complexity as the encoder needs to intensively search for the best predictor (among a long sequence of potential predictors) when building the prediction tree.

[0018] In these two schemes, the attribute (decoding) encoding is performed after the geometry (decoding) encoding is completed, so essentially two encodings occur.

[0019] An important use case is the transmission of sparse geometry data captured by self-rotating sensor heads (e.g., self-rotating laser radar heads) mounted on moving vehicles. This typically requires a simple, low-latency embedded encoder. The need for simplicity limits the processing power available to the point cloud encoder, since the encoder may be located in a computing unit that performs other processing in parallel (e.g., (semi-)autonomous driving). To achieve fast transmission from the car to the cloud, low latency is also required to check the local traffic in real time based on the collection of multiple vehicles and to make rapid enough decisions based on the traffic information. The use of 5G allows the transmission latency to be low enough, but the encoder itself should not introduce too much latency for encoding. Also, the data stream from millions of cars to the cloud is expected to be huge, so compression performance is crucial.

[0020] Certain a priori assumptions related to the sparse geometry data captured with a self-rotating sensor head were used to obtain highly efficient encoding / decoding methods.

[0021] First, G-PCC utilizes the elevation angle (relative to a horizontal ground plane) captured by a self-rotating sensor head, as shown in Figures 1 and 2. The self-rotating sensor head 10 includes a collection of sensors 11 (e.g., laser instruments), five of which are shown here. The self-rotating sensor head 10 is capable of self-rotating around a vertical axis z to capture the geometry data of a physical object, i.e., the 3D positions of the points of a point cloud. The geometry data captured by the self-rotating sensor head is then expressed in spherical coordinates (r 3D ,Φ,θ), where r 3D is the distance from point P to the center of the self-rotating sensor head, Φ is the azimuth angle of the self-rotation of the sensor head relative to the rotation of the reference object, and θ k is the elevation angle of sensor k of the self-rotating sensor head relative to the horizontal reference plane.

[0022] A regular distribution along the azimuth angle was observed in the geometry data captured with the self-rotating sensor head, as shown in Figure 3. This regularity is used in G-PCC to obtain a quasi-1D representation of the point cloud, where the noise is limited by a radius r 3D Only θ and Φ are in a continuous range of values, and the angles Φ and θ can only take on discrete numerical values. i ∀i=0~I-1, where I is the number of azimuth angles for capturing the point, and θ k ∀k=0 to K−1, where K is the number of sensors in the self-rotating sensor head 10. Essentially, as shown in Figure 3, G-PCC calculates sparse geometry data captured by the self-rotating sensor head in a 2D discrete angular plane (Φ, θ) and a radius value r for each point. 3D Represents.

[0023] In spherical coordinate space, the discrete property of angles is used to predict the position of the current point based on already coded points; such quasi-1D property is already exploited in the occupancy tree and prediction tree in G-PCC.

[0024] More precisely, occupancy trees make extensive use of DCM, using a context-adaptive entropy encoder to entropy code the direct positions of points in nodes, followed by a local transformation from the point positions to angular coordinates (Φ,θ) and the position of these angular coordinates relative to the discrete angular coordinates (Φi,θk) obtained from the coded points. The quasi-1D nature of this coordinate space (r 2D ,Φi,θk), the prediction tree uses the angular coordinates (r 2D ,Φ,θ) directly encode the first version of the point location in r 2D is the projection radius on the horizontal xy plane. Then, the angular coordinate (r 2D ,Φ,θ). These are also converted to 3D Cartesian coordinates (x,y,z) and we encode the xyz residuals to account for errors in the coordinate transformation, approximations in elevation and azimuth angles, and potential noise.

[0025] Point P of the point cloud nThe azimuth angle Φ(P n ) can benefit from the prediction scheme shown in FIG. 5. n Predicted angle Φ pred,n is the encoded point P al The angle Φ(P al ) by a multiple of the basic azimuth angle displacement ΔΦ, al It is calculated from the angle. Φ pred,n =Φ(P al )+m*ΔΦ (1) Here, m is Φ pred,n is point P n The original azimuth angle Φ(P n ) is an integer value chosen to be closest to

[0026] Next, the residual azimuth angle Φ res,n The index n is calculated by the following formula (the residual azimuth angle is the n (Instructions for the Φ res,n =Φ(P n )-Φ pred,n =Φ(P n )-Φ(P al )-m*ΔΦ (2) Integer m and residual azimuth Φ res,n are both encoded into the bitstream.

[0027] On the decoding side, the integer m and the residual azimuth angle Φ are obtained from the bitstream. res,n and the decoded azimuth angle Φ dec,n is obtained by the following formula: Φ dec,n =Φ res,n +Φ pred,n =Φ res,n +Φ(P al )+m*ΔΦ (3)

[0028] Other spherical coordinates (r 2D ,θ) and the xyz residual are also decoded. Then, the decoded xyz residual and the decoded spherical coordinates (r 2D, Φ, θ) and obtain the 3D Cartesian coordinates (x, y, z) of the points in the point cloud.

[0029] European Patent Application No. EP20306672.5 describes another encoding / decoding method that exploits certain a priori related to the sparse geometry captured with a self-rotating sensor head.

[0030] The 3D location of a point in the captured point cloud is expressed in the 2D coordinate (Φ, λ) system (as shown in Figure 6) and in terms of a radius value r 2D or r 3D This representation is called "single-chain encoding" because the points are represented by a single chain of points, with each point having a single successor. The coordinate Φ is the azimuth angle of the self-rotation of the sensor head, and its discrete values ​​are Φ i (∀i=0 to I-1). The coordinate λ is the sensor index, and its discrete values ​​are represented as λk (∀k=0 to K-1). The radius r 2D or r 3D belongs to a continuous range of numbers.

[0031] Due to the regular self-rotation (turning) of the sensor head and the continuous capture at regular time intervals, the azimuth distance between two points detected by the same sensor is a multiple of the basic azimuth displacement ΔΦ, as shown in Figure 6. Then, for example, at the first capture time t1, the five sensors of the self-rotating sensor head 10 in Figure 1 are P1(t1), ..., P k At the second capture time t2, the sensor of the self-rotating sensor head 10 detects five points P1(t2), ..., P5(t1) at an azimuth angle Φ2 = Φ1 + ΔΦ. k (t2), …, P5(t2), etc. Therefore, this discrete value Φ1 is k P(t1), ..., P(t1), ..., P(t2), ..., P(t3), ..., P(t4), ..., P(t5), ..., P(t6), ..., P(t7), ..., P(t8), ..., P(t9), ..., P(t1), ..., P(t1), ..., P(t2), ..., P(t3), ..., P(t4), ..., P(t5 ... k(t2), ...P5(t2) can be regarded as quantized values ​​of the azimuth angle Φ.

[0032] On the encoding side, for each point P n For the captured point P n By transforming the 3D Cartesian coordinates that represent the 3D position of point P n The sensor index λ associated with the sensor that captured k(n) (Sensor index λ k (in the set ∀k=0 to K-1), and the azimuth angle Φ representing the capture angle of the sensor. i(n) (discrete angle Φ i (∀i=0 to I-1) and point P n The radius value r of the spherical coordinates of n These 3D Cartesian coordinates may be the output of the sensor head. For simplicity, hereafter, λ k(n) and index i(n) are λ n and Φ n Therefore, Φ n is not an angle, but an angle Φ i However, the index Φ n and the standard related azimuth angle Φ i(n) =Φ Φn Since there is a clear relationship between this quantity Φ n is also called the azimuth angle.

[0033] Next, we first sort the azimuth angle Φ n and the sensor index λ n Returning to Figure 6, the sequentially captured points are sorted as P1(t1),…,P k (t1),…,P5(t1),P1(t2),…,P k (t2),…,P5(t2),…,P1(tn),…,P k (tn),…P5(tn).

[0034] point P n The order index o(P n) is obtained by the following formula: o(P n )=Φ n * K+λ n

[0035] Alternatively, the points are sorted based on sensor index and then lexicographically based on azimuth angle.

[0036] point P n The order index o(P n ) is obtained by the following formula: o(P n )=λ n *I+Φ n

[0037] Next, two consecutive points P n-1 and P n The order index difference Δo represents the difference in order index (for n=2 to N) n is obtained by the following formula: Δo n =o(P n )-o(P n-1 )

[0038] The ordinal index o(P1) of the first point P1 can be directly coded into the bitstream, which corresponds to arbitrarily setting the ordinal index of a fictitious zeroth point to zero, i.e., o(P0)=0, and coding Δo1=o(P1)-o(P0)=o(P1).

[0039] The order index o(P1) of the first point and the order difference Δo n Then, any point P can be calculated by the following equation: n The order index o(P n ) can be recursively reconstructed. o(P n )=o(P n-1 )+Δo n

[0040] Then, the sensor index λ is calculated by the following formula: n and azimuth angle Φn Search for. λ n =o(P n ) Modular K (4) Φ n =o(P n ) / K (5)

[0041] Here, the division / K is integer division (also called Euclidean division). Therefore, o(P1) and Δo n is λ n and Φ n is an alternative representation of

[0042] Order index o(P1) and (N-1) order index difference Δo n By encoding (∀n=2 to N), the order index o(P n ) into the bitstream, where N is the number of sequence points. n represents the difference between the order indexes associated with two consecutive order points. In Fig. 7, five order points (black circles) are shown. At time t1, the angle Φ c (Φ i In P n and P n+1 Two points are captured at time t2 with an angle Φ c +ΔΦ. Three points are captured at the first point P in the 2D coordinate (Φ, λ) system. n Assuming that the coordinates of point P are known in advance, n+1 The order index o(P n+1 ) and point P n The order index o(P n ) as the difference between the first order index Δo n+1 Obtain another sequence point P n+2 The order index o(P n+2 ) and point P n+1 The order index o(P n ) as the difference between the second order index Δo n+2 and make inferences accordingly.

[0043] Next, the radius value r of the spherical coordinates associated with the ordered points of the point cloud n (essentially the r of point P n ) is encoded in the bit stream. 2D or r 3D is represented) is encoded in the bit stream.

[0044] The residual (x n of the three-dimensional Cartesian coordinates of the ordered point P res , n, y res,n , z res,n ) is encoded in the bit stream. These are the decoded azimuth angle Φ n obtained from their three-dimensional Cartesian coordinates, the azimuth angle Φ n,dec the decoded radius value r n obtained from the radius value r n,dec , and the sensor index λ n are obtained from.

[0045] Next, the residual azimuth angle Φ res,n associated with the ordered point is also encoded in the bit stream. Φ res,n = Φ(P n ) - Φ pred,n = Φ(P n ) - Φ n * ΔΦ (6)

[0046] In a modification, the azimuth angle Φ n is quantized by the following formula. Φ n = round(Φ(P n ) / ΔΦ)

[0047] In this case, the set of discrete angles Φ i (0 ≤ i < I) is essentially defined by Φ i = i * ΔΦ, and Φ i(n) = Φ n * ΔΦ is obtained. Therefore, the decoded azimuth angle Φ n,dec is obtained by the following formula. Φ n,dec = Φ res,n + Φ pred,n = Φ res,n + Φ n * ΔΦ

[0048] This variant offers an advantage since in practice one does not capture all points at each capture time because noise may be present, or the sensors may not all be perfectly aligned, or the laser beam of at least one of the laser radar sensor heads may not be reflected back, resulting in a residual azimuth angle Φ. res,n is intended to encode such noise or misalignment. The captured points can be distributed as shown in Figure 8. The azimuth angle Φ(P n Quantization of θ, θ = φ, λ, θ = 1 leads to a discrete representation of points in the 2D coordinate (Φ, λ) system, as shown in FIG. 9, which makes it possible to provide a clean route for sorting the points of a point cloud.

[0049] Preferably, the residual azimuth angle Φ is calculated by quantization and / or entropy coding. res,n is encoded into bitstream B.

[0050] It reduces the dynamics of the angles coded into the bitstream, since it only codes the residuals instead of the full range of values, achieving high compression performance.

[0051] Decoding the points of the point cloud from the bit stream yields information of the N points in the point cloud, the ordinal index o(P1) of the first point in the 2D coordinate (Φ, λ) system, and the sensor configuration parameters, e.g., the basic azimuth displacement ΔΦ or the elevation angle θ associated with each sensor k. k This information may be decoded from bitstream B, may be received by any other means, or may be known a priori by the decoder.

[0052] The N points of the point cloud can be decoded recursively.

[0053] First, extract at least one order index difference Δo from the bit stream. n Decode (n=2 to N) the current point P nFor each order index difference Δo n Decrypt the

[0054] Next, the current point P n The order index o(P n ) is obtained by the following formula: o(P n )=o(P n-1 )+Δo n

[0055] Order index difference Δo n is the ordinal index associated with the current point Pn and the previously decoded point P n-1 Another ordering index o(P n-1 )

[0056] Next, the current point P n The sensor index λ associated with the sensor that captured n and an azimuth angle Φ representing the capture angle of the sensor. n and the order index o(P n ) to obtain the

[0057] Then, the decoded azimuth angle Φ dec,n is given by the following formula: Φ dec,n =Φ res,n,dec +Φ n *ΔΦ (7)

[0058] Here, Φ res,n,dec is the residual azimuth decoded from the bitstream.

[0059] Next, the current point P n The radius value r of the spherical coordinates of n and the current point P n The 3D Cartesian residual of is decoded from the bitstream.

[0060] Finally, the current point P n The decoded residual of the 3D Cartesian coordinates of n, the decoded azimuth angle Φ n,dec , and the sensor index λ n Based on the current point P n Decode the 3D Cartesian coordinates (x,y,z) of

[0061] As is understood from the prior art, the residual azimuth angle Φ res,n (Equation 2 or 6) is encoded into the bitstream.

[0062] With these definitions of residual azimuth angles, the following inequality expresses the boundary attribute: |Φ res,n |≦ΔΦ / 2 (8)

[0063] This inequality indicates that the residual azimuth angle is bounded by a value that depends on the sensor characteristics (ie, the fundamental azimuth angle displacement ΔΦ between two detections of the self-rotating sensor head).

[0064] The problem to be solved is to benefit from boundary attributes (8) in the framework of capturing point cloud geometry using a self-rotating sensor head, and improve the encoding efficiency of this captured point cloud geometry data. Summary of the Invention

[0065] The following section presents a simplified summary of at least one exemplary embodiment in order to provide a basic understanding of some aspects of the present application. This summary is not a detailed overview of the exemplary embodiment. It is not intended to identify key or critical elements of the embodiment. The following summary presents only some aspects of at least one exemplary embodiment in a simplified form as a prelude to the more detailed description provided elsewhere in the document.

[0066] According to a first aspect of the present application, there is provided a method for encoding a point cloud into a bitstream of encoded point cloud data representing a physical object, comprising the step of encoding azimuth angle data into the bitstream representing an azimuth angle responsive to a capture angle of a sensor that captured a point of the point cloud, said encoding being based on a boundary value dependent on a characteristic of the sensor, such that an absolute value of said azimuth angle data is limited by said boundary value.

[0067] In one exemplary embodiment, the azimuth data is obtained by quantizing a first order residual azimuth angle between the azimuth angle and a prediction of the azimuth angle.

[0068] In one exemplary embodiment, azimuth angle data is obtained by adding an offset value that depends on a boundary value and intermediate azimuth angle data, the intermediate azimuth angle data depending on a second-order residual azimuth angle between a first-order residual azimuth angle and a prediction of the first-order residual azimuth angle.

[0069] In one exemplary embodiment, the offset value is an integer value multiplied by 2B+1, where B is a boundary value, and the integer value ensures that the absolute value of the azimuth angle data is limited by the boundary value B.

[0070] In one exemplary embodiment, the boundary value depends on the base azimuth angle displacement and a quantization parameter for quantizing the first order residual azimuth angle.

[0071] In one exemplary embodiment, encoding the azimuth angle data further includes binarizing the azimuth angle data into a series of binary data, and encoding only the binary data whose two possible values ​​do not violate the condition that the absolute value of the data is limited by a boundary value B.

[0072] According to a second aspect of the present application, there is provided a method for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object, comprising the steps of decoding azimuth angle data from the bitstream representing an azimuth angle responsive to a capture angle of a sensor that captured a point of the point cloud, wherein said decoding is based on a boundary value dependent on a characteristic of the sensor, such that an absolute value of the azimuth angle data is limited by said boundary value.

[0073] In one exemplary embodiment, decoding the azimuth angle data includes obtaining, for each binary data, a sequence of binary data representing the azimuth angle data by either decoding the binary data from the bit stream if neither of the two possible values ​​violates a condition that the absolute value of the azimuth angle data is limited by a boundary value, or by inferring the value of the binary data to be the only value that does not violate said condition.

[0074] In one exemplary embodiment, the azimuth angle data is a quantized residual azimuth angle between the azimuth angle and a prediction of the azimuth angle.

[0075] In one exemplary embodiment, the method further includes the steps of obtaining an intermediate residual azimuth angle from azimuth angle data and a prediction of a first residual azimuth angle between the azimuth angle and the predicted azimuth angle, obtaining a first-order residual azimuth angle by adding an offset value that depends on a boundary value and the intermediate residual azimuth angle, and inverse quantizing the first-order residual azimuth angle.

[0076] In one exemplary embodiment, the offset value is a product of an integer value and 2B+1, where B is a boundary value, and the integer value ensures that the absolute value of the intermediate residual azimuth angle is limited by the boundary value B.

[0077] In one exemplary embodiment, the boundary values ​​depend on the base azimuthal displacements and a quantization parameter for dequantizing the residual.

[0078] According to a third aspect of the present application, there is provided a bitstream of encoded point cloud data representing a physical object, comprising azimuth angle data representing an azimuth angle responsive to a capture angle of a sensor that captured a point of the point cloud, and data representing a boundary value (B), the boundary value (B) depending on a characteristic of the sensor, for decoding said azimuth angle data such that an absolute value of said azimuth angle data is limited by said boundary value.

[0079] According to a fourth aspect of the present application, there is provided an apparatus for encoding a point cloud into a bitstream of encoded point cloud data representing a physical object, the apparatus comprising one or more processors configured to perform a method according to the first aspect of the present application.

[0080] According to a fifth aspect of the present application, there is provided an apparatus for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object, the apparatus comprising one or more processors configured to perform a method according to the second aspect of the present application.

[0081] According to a sixth aspect of the present application, Provide computer programs This program, when executed by one or more processors, causes the one or more processors to perform the method according to the first aspect of the present application.

[0082] According to a seventh aspect of the present application, there is provided a non-transitory storage medium carrying program code instructions for performing the method according to the first aspect of the present application.

[0083] According to an eighth aspect of the present application, Provide computer programs This program, when executed by one or more processors, causes the one or more processors to carry out the method according to the second aspect of the present application.

[0084] According to a ninth aspect of the present application, there is provided a non-transitory storage medium carrying program code instructions for performing the method according to the second aspect of the present application.

[0085] The specific nature of at least one of the exemplary embodiments, as well as other objects, advantages, features, and applications of at least one of said exemplary embodiments, will become apparent from the following description of examples taken in conjunction with the drawings. [Brief description of the drawings]

[0086] Reference is now made, by way of example, to the drawings illustrating exemplary embodiments of the present application, wherein: [Figure 1] FIG. 1 shows a side view of a sensor head and some of its parameters according to the prior art. [Diagram 2] FIG. 1 shows a plan view of a sensor head and some of its parameters according to the prior art. [Diagram 3] 1 shows a regular distribution of data captured with a self-rotating sensor head according to the prior art. [Figure 4] 1 illustrates a representation of a point in 3D space according to the prior art. [Diagram 5] 1 shows predictive coding of azimuth angles according to the prior art; [Figure 6] 4 illustrates an example of capture points represented in 2D space according to an exemplary embodiment of the present application. [Figure 7] 4 illustrates an example of encoded sequence points according to an exemplary embodiment of the present application. [Figure 8] 4 illustrates an example of a capture point according to an exemplary embodiment of the present application. [Figure 9] 4 illustrates an example of sorted and quantized capture points according to an exemplary embodiment of the present application. [Figure 10] FIG. 1 shows a block diagram of steps of a method 100 for encoding a point cloud from a bitstream of encoded point cloud data representing a physical object, in accordance with at least one example embodiment. [Figure 11] 1 illustrates an advantage of the method 100 in accordance with at least one example embodiment. [Figure 12] 1 illustrates an advantage of the method 100 in accordance with at least one example embodiment. [Figure 13]FIG. 2 shows a block diagram of steps of a method 200 for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object, in accordance with at least one example embodiment. [Figure 14] 1 shows a schematic block diagram of an example of a system for implementing various aspects and example embodiments.Like reference numerals used in different figures may represent like components. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0087] At least one example of the exemplary embodiment will be described below with reference to the drawings, and at least one example of the exemplary embodiment will be illustrated. However, the exemplary embodiment may be implemented in many alternative forms and should not be construed as being limited to the examples set forth herein. It should therefore be understood that the exemplary embodiment is not intended to be limited to the particular forms disclosed. On the contrary, the present application is intended to cover all modifications, equivalents and alternatives falling within the spirit and scope of the present application.

[0088] It should be understood that when a drawing is presented in the form of a flow chart, a block diagram of the corresponding apparatus is also provided. Similarly, it should be understood that when a drawing is presented in the form of a block diagram, a flow chart of the corresponding method / process is also provided.

[0089] At least one of these aspects relates generally to encoding and decoding of point clouds, and at least one other aspect relates generally to transmitting generated or encoded bitstreams.

[0090] Additionally, the aspects are not limited to MPEG standards such as MPEG-I Part 5 or Part 9 relating to point cloud compression, etc., but may be applied, for example, to other standards and recommendations, whether existing or developed in the future, and extensions of such standards and recommendations, including MPEG-I Part 5 and Part 9. Unless otherwise indicated or technically excluded, the aspects described in this application may be used alone or in combination.

[0091] The present invention relates to the field of encoding and decoding technology, and aims to provide a technical solution for encoding / decoding point cloud data. Point cloud is a collection of a large amount of data, so storing the point cloud may consume a large amount of memory, and the point cloud cannot be directly transmitted in the network layer without compressing the point cloud, so the point cloud needs to be compressed. Therefore, as point clouds are increasingly widely used in fields such as autonomous navigation, real-time patrol inspection, geographic information services, cultural heritage / architecture protection, 3D immersive communication and interaction, the present invention can be used in many application scenarios.

[0092] The present invention is particularly directed to encoding / decoding azimuth data based on sensor characteristics, which can improve the codec of captured point cloud geometry data.

[0093] The present invention relates to a method 100 for encoding a point cloud into a bitstream of encoded point cloud data representing a physical object. n The azimuth angle data Φ represents the azimuth angle corresponding to the capture angle of the sensor that captured coded,n into a bit stream, said encoding being based on a boundary value B that depends on the characteristics of the sensor, and said azimuth angle data Φ coded,n The absolute value of is limited by the boundary value B.

[0094] In fact, the azimuth angle data Φ coded,n is an integer value bounded by a boundary value B. |Φ coded,n |≦B (9)

[0095] FIG. 10 illustrates a block diagram of steps of a method 100 in accordance with at least one example embodiment.

[0096] The method 100 includes steps 110 and 120 .

[0097] In step 110, a point P n The azimuth angle Φ(P n ) azimuth angle data Φ coded,n Get the.

[0098] In a first exemplary embodiment of step 110, the azimuth angle Φ(P n ) and the predicted azimuth angle Φ pred,n The first-order residual azimuth angle Φ between res,n The azimuth angle data Φ is calculated by quantizing coded,n Get the.

[0099] For example, the first order residual azimuth angle is the residual azimuth angle Φ given by equation (2) or (6) and, optionally, subsequent quantization by a quantization operator Q(.) res,n may be also possible.

[0100] The boundary value B is given by the following equation: B = Q(ΔΦ / 2) (10) For any quantization operator Q(.), uniform or non-uniform step sizes and / or dead zones can be used.

[0101] In a variant, the quantized first order residual azimuth angle is given by: Φ coded,n =Q(Φ res,n )=Φ res,n,Q =round(Φ res,n / dΦ)(11) where Φ is the quantization step size.

[0102] Next, the boundary value B is derived from equation (10). B = round(ΔΦ / (2 * dΦ)) (12) And since the error of the reconstructed angle after inverse quantization reaches dΦ / 2, the error e in Cartesian coordinate space is 2D radius r 2D (That is, the sensor and point P n is proportional to the distance from the e≒r 2D * dΦ / 2

[0103] Therefore, in terms of compression efficiency, it is somewhat optimal to choose a quantization step size dΦ that yields a uniform error e regardless of the 2D radius of the points. Essentially, we can use dΦ=dQ / 2 * r 2D where dQ is the user-selected quantization parameter. Typically, for lossless coding, dQ is equal to 1. This reduces equation (12) to: B = round(r 2D * ΔΦ / dQ) (13)

[0104] Then, the small radius r 2D For radii, the boundary value B can be made small. In extreme cases, for very small radii, B may eventually become 0. In this case, the azimuth data Φ coded,n Since it can be seen from equation (9) that its value is always zero, it does not need to be coded.

[0105] In a second exemplary embodiment of step 110, an offset value that depends on the boundary value B and a first-order residual azimuth angle Φ res,n and the first-order residual azimuth prediction Φ res,n,pred Second-order residual azimuth angle Φ between res,n,res The intermediate azimuth data Φ' depends on coded,n By adding and, the azimuth angle data Φ coded,n Get the. Φres,n,res =Φ res,n -Φ res,n,pred (14)

[0106] In a variant, the prediction Φ of the first-order residual azimuth angle res,n,pred is the encoded point P of the point cloud. al The first-order residual azimuth angle Φ related to res,al is obtained by quantizing Φ res,pred,n =Q(Φ res,al )

[0107] In the single-chain coding scheme, the already existing point P al is the current point P in the ordered list of points. n In another variant, this predecessor is the current point P n is selected from among its predecessors having the same laser index λ.

[0108] In a variant, the intermediate azimuth data Φ′ coded,n is the second-order residual azimuth angle Φ res,n,res is given by quantizing Φ' coded,n =Q(Φ res,n,res )=Φ res,n,res,Q =Q(Φ res,n -Φ res,n,pred )

[0109] In another variant, the intermediate azimuth data Φ′ coded,n is the quantized first-order residual azimuth angle Φ res,n , Q and the first-order residual azimuth prediction Φ res,n,pred is given by the difference between Φ' coded,n =Φ res,n,Q -Φ res,n,pred (15) Here, Φ res,n,pred is the quantized first-order residual azimuth angle Φ res,n,Q Prediction or first-order residual azimuth angle Φ res,n is a quantized version of the prediction of

[0110] Intermediate azimuth data Φ' coded,nis not essentially restricted by B.

[0111] The added offset is an integer value n B,enc and 2B+1, where B is the boundary value. B,enc is the azimuth angle data Φ coded,n is bounded by a boundary value B (equation (9)). Φ coded,n =Φ' coded,n +n B,enc * (2B+1) (16) where B is the boundary value determined by equation (12).

[0112] In a variant, the integer value n B,enc can be obtained by the following formula: n B,enc =-round(Φ' coded,n / (2B+1)) (17)

[0113] In another variant, the integer value n B,enc can be obtained by iteratively applying (adding or subtracting) an offset of 2B+1 until the bounded relationship in equation (9) is satisfied.

[0114] A second embodiment of step 110 calculates the second-order residual azimuth angle Φ as described below in the context of single-chain encoding with the support of FIG. res,n,res By using the azimuth angle data Φ coded,n This provides an advantage since the amplitude of

[0115] Azimuth angle Φ(P n ) relative to the current point P n and the first-order residual azimuth angle Φ given by Eq. (6) res,n Let's think about it. Φ res,n =Φ(P n )-Φ pred,n =Φ(P n )-Φ0

[0116] The quantized first order azimuth residual to be coded (Eq. 11) is given by: Φ coded,n =Q(Φ res,n )=Φ res,n,Q

[0117] Currently, the azimuth angle Φ(P al ) the encoded point P al Let us consider the first-order residual azimuth angle Φ res,al is given by equation (6). Φ res,al =Φ(P al )-Φ pred,al =Φ(P al )-Φ -1

[0118] In a second embodiment of step 110, the encoded and quantized first-order azimuth angle residual Φ res,n,Q Instead of , the first-order residual azimuth angle Φ res,n and the first-order residual azimuth angle prediction Φ res,n,pred Second-order residual azimuth angle Φ between res,n,res and obtain the intermediate azimuth data Φ' given by Eq. (15). coded,n Get the. Φ' coded,n =Q(Φ res,n )-Φ res,n,pred =Q(Φ res,n )-Q(Φ res,al ) =Q(Φ(P n )-Φ0)-Q(Φ(P al )-Φ -1 )

[0119] Due to the rotational characteristics of the self-rotating sensor head 10, the following approximations can be obtained: Φ(P al )≒Φ(P n )-ΔΦ So Φ(P al )-Φ -1 ≒Φ(P n )-ΔΦ-Φ -1 =Φ(P n )-Φ0 Therefore, the intermediate azimuth angle data Φ' to be encodedcoded,n is very small and efficient compression is obtained.

[0120] Integer value n B,enc Using the intermediate azimuth angle data Φ' coded,n (Quantized second-order residual azimuth angle Φ res,n,res,Q ), provides the advantages explained below.

[0121] As shown in Fig. 12, the point capture may be subject to sensor noise. Compared to Fig. 11, the encoded point P al is shifted a little to the left with some noise ε. Therefore, the associated prediction angle is Φ -1 From Φ -2 and the first-order residual azimuth angle Φ res,al is significantly affected. Currently, the quantized first-order residual azimuth angle Φ res,al is the first-order residual azimuth angle Φ res,n This is a predictor of failure (Equation 15). Φ' coded,n =Q(Φ res,n )-Φ res,n,pred =Q(Φ res,n )-Q(Φ res,al ) =Q(Φ(P n )-Φ0)-Q(Φ(P al )-Φ -2 )

[0122] n B,enc Using the intermediate azimuth angle data Φ' coded,n By limiting res,al ) problem, and the azimuth angle is Φ(P al ) can be expressed as Φ(P al )≒Φ(P n )-ΔΦ-ε The following formula is then obtained: Φ(P al )-Φ -2 =Φ(P al )-ΔΦ-ε-Φ -2 =Φ(P n )-Φ0+ΔΦ-ε

[0123] After applying the quantized operator, the following approximation is obtained: Q(Φ(P al )-Φ -2 )≒Q(Φ(P n )-Φ0)+Q(ΔΦ)+Q(-ε)≒Q(Φ(P n )-Φ0)+Q(ΔΦ)

[0124] Unbounded intermediate azimuth data Φ' coded,n can be approximated by the following equation: Φ' coded,n =Q(Φ(P n )-Φ0)-Q(Φ(P al )-Φ -2 ) ≒ -Q(ΔΦ) ≒ -2B This equation clearly does not satisfy the constraints in equation (9).

[0125] Therefore, according to the present invention, the offset amount of a multiple of (2B+1) is multiplied by a factor n B,enc Applying (equation 16) with =+1 gives the following equation: Φ coded,n =Φ' coded,n +(2B+1)≒0

[0126] Azimuth data Φ coded,n is limited by the boundary integer value B. The azimuth angle data Φ coded,n is small in amplitude and can be efficiently compressed using entropy coding based on the boundary value B.

[0127] In step 120, the boundary value B is used to obtain the bounded azimuth angle data Φ coded into a bitstream.

[0128] In one exemplary embodiment of step 120, the azimuth angle data Φ coded,n is a sequence of binary data f i In step 122, both of the two possible values ​​are represented as data Φ coded,n Binary data f that does not violate the condition that the absolute value of is limited by the boundary value B i Only the

[0129] In one exemplary embodiment of steps 121 and 122, a sequence of binary data f i By azimuth angle data Φ coded,n Binarizing and encoding includes the following: Binary data f0 is added to the bitstream, and Φ coded,n is equal to 0 (f0=0) or Φ coded,n is not equal to 0 (f0=1), Φ coded,n If is not equal to 0, A symbol flag s is added to the bitstream, and Φ coded,n Signal the symbol of A series of N f Flags f1~f Nf is added to the bitstream and each flag f is checked until one of these flags is positive. j is |Φ coded,n Signals whether | is equal to j or not, If all flags are negative, i.e., Φ coded,n N f If it is greater than |Φ coded,n Remember that |-Nf-1 will be binarized into more binary data by the expGolomb code.

[0130] If the boundary value B is equal to 0, there is no need to encode the flag f0. Similarly, the data Φ coded,n B≦N f If it is equal to |Φ coded,n A flag f that signals whether | is equal to B or not B is detected by the decoder as positive (f B = 1), so it does not need to be coded. B =0 is |Φ coded,n This is because it means that | is at least B+1, which contradicts the boundary attribute of equation (9).

[0131] Similarly, if one of the potential values ​​(0 or 1) of the binary data that make up the expGolomb code is inconsistent with the boundary attribute in equation (9), it may not be necessary to encode the binary data, and the decoder can then infer the binary data as the inverse value.

[0132] It should be appreciated that the encoded flags or expGolomb codes may rely on arithmetic coding, such as a context-adaptive binary arithmetic encoder (CABAC) or other entropy encoders, to achieve better compression.

[0133] In some variants, following the same principle of not encoding unnecessary data, given a boundary value B, Φ coded,n Other binarization methods or decompositions of flags f1 to f2 may be used. Nf The series may be omitted (i.e., N f =0), and / or the expGolomb code may be replaced with another variable length coding representation, such as a Golomb-Rice or Huffman code.

[0134] As illustrated above, in step 122, both of the two possible values ​​are coded,n Binary data f that does not violate the condition that the absolute value of is limited by the boundary value B i We only encode binary data f for which one of the possible values ​​violates constraint (9). i is not coded because it is presumed (by the decoder) to be a unique value that does not violate any conditions. By not coding such binary data, we reduce the bitstream size and better compress the point cloud.

[0135] The present invention also relates to a method 200 for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object. The method 200 comprises decoding azimuth angle data Φ representing an azimuth angle responsive to a capture angle of a sensor that captured a point of the point cloud. coded,nfrom the bit stream, said decoding being based on a boundary value B that depends on the characteristics of the sensor, and said azimuth angle data Φ coded,n The absolute value of is limited by the boundary value B (equation (9)).

[0136] FIG. 13 illustrates a block diagram of steps of a method 200 in accordance with at least one example embodiment.

[0137] The method 200 includes steps 210, 220, and 230.

[0138] In step 210, the boundary value B is obtained by equation (10), (12), or (13) using the same method as the encoder.

[0139] In step 220, the azimuth angle data Φ coded,n Decode the azimuth angle data Φ coded,n Decoding is done by converting a sequence of binary data f i Then, the azimuth angle data Φ coded,n The decoded value of binary data f i Calculate based on the value of each binary data f i The value of is decoded or estimated from the bitstream. i If one of the two possible values ​​of violates constraint (9), then this value is inferred to be the other value that does not violate the constraint. If neither of the two possible values ​​violates constraint (9), then decode this value from the bitstream.

[0140] For example, azimuth angle data Φ coded,n Consider the first and second binary data f0, which indicates whether f0 is equal to 0 (f0=1) or not (f0=0). If the boundary B is 0, f0 is presumed to be 1. Otherwise, f0 is decoded.

[0141] Here, it is assumed that B>0 and f0 has already been decoded to 0, i.e., the azimuth angle data Φ coded,nAssume that is not equal to 0. Then, the azimuth angle data Φ coded,n Then, the absolute value |Φ coded,n Obtain the value of binary data f1 indicating whether | is equal to 1 (f0=1) or not (f0=0). If B=1, f1 is assumed to be 1, otherwise, if B>1, decode f1. The same process is applied to a set of binary data fi, each of which has an absolute value |Φ coded,n | is equal to i (f i =1) or not equal to i (f i = 0). If B = i, then f i is estimated to have a value of 1.

[0142] Step 220 converts the azimuth angle data Φ coded,n Alternatively, a non-binary word W may be used to encode the azimuth angle data Φ coded,n The constraint (9) is that the azimuth angle data Φ coded,n This means that the azimuth angle data Φ can take 2B+1 different values ​​within the range of -B to B. coded,n is length L W It can be represented by the word W, and L W is defined as follows: L W =ceil(log2(2B+1))

[0143] So, the word W may be part of a bitstream and is encoded by any known means (such as simply pushing or entropy encoding bits). With knowledge of the boundary B, the decoding method 200 determines in step 220 the length L of B. W Then, based on the decoded word W, the azimuth angle data Φ coded,n Recover.

[0144] In another embodiment of step 220, a sequence of binary data f i and length LW The azimuth data Φ is calculated using both the non-binary word W and the boundary B. coded,n For example, the azimuth angle data Φ coded,n The first part of can be encoded using binary data fi and the remaining part can be encoded using a non-binary word W.

[0145] In step 230, point P n The decoded azimuth angle Φ related to dec,n Decrypt the

[0146] In a first embodiment of step 230, the azimuth angle data Φ coded,n is the azimuth angle Φ(P n ) and the predicted azimuth angle Φ pred,n The quantized first-order residual azimuth angle Φ between res,n,Q is (Equation 11).

[0147] Then, the azimuth angle data Φ coded,n and predicted angle Φ pred,n Based on the point cloud point P n The azimuth angle (Φ dec,n ) to decrypt the Φ dec,n =Φ coded,n +Φ pred,n

[0148] Then, for small radii r2D, the boundary value B can be made small. In the extreme case, for very small radii, B may eventually become 0. In this case, the azimuth data Φ coded,n Since it can be seen from equation (9) that its value is always zero, it does not need to be coded and is estimated to be 0.

[0149] In a second embodiment of step 230, the boundary value B is given by equation (10). coded,n and prediction Φ res,n,pred Then, the intermediate residual azimuth angle Φ res,n,Q Get the. Φ res,n,Q =Φ coded,n+Φ res,n,pred

[0150] Here, Φ res,n,pred is the azimuth angle Φ(P n ) and the predicted azimuth angle Φ pred,n The first-order residual azimuth angle Φ between res,n This is a prediction.

[0151] In a variant, the prediction Φ of the first-order residual azimuth angle res,n,pred is the decoded point P of the point cloud. al The first-order residual azimuth angle Φ related to res,al is obtained by quantizing Φ res,n,pred =Q(Φ res,al )

[0152] In step 232, the offset value and the intermediate residual azimuth angle Φ, which depend on the boundary value B, are calculated. res,n,Q By adding and, the first-order residual azimuth angle Φ res,n,Q,dec Get the. Φ res,n,Q,dec =Φ res,n,Q +n B,dec * (2B+1) where n B,dec is an integer value that ensures that the first-order residual azimuth angle is bounded by the boundary value B (equation (9)). |Φ res,n,Q,dec |≦B (18)

[0153] In a variant, the integer value n B,dec During encoding, B、enc can be obtained in a similar manner. n B,dec =-round(Φ res,n,Q / (2B+1))

[0154] In another variant, the integer value n B,dec can be obtained by iteratively applying (adding or subtracting) an offset amount of 2B+1 until the bounded relationship of equation (18) is satisfied.

[0155] Therefore, the first-order residual azimuth angle Φ res,n,Q,decis the first-order residual azimuth angle Φ of the encoder shown below. res,n,Q corresponds exactly to. -n B,dec * (2B+1)=Φ res,n,Q -Φ res,n,Q,dec =Φ coded +Φ res,n,pred -Φ res,n,Q,dec =Φ' coded +n B,enc * (2B+1)+Φ res,n,pred -Φ res,n,Q,dec =Φ res,n,Q -Φ res,n,pred +n B,enc * (2B+1)+Φ res,n,pred -Φ res,n,Q,dec =n B,enc * (2B+1)+Φ res,n,Q -Φ res,n,Q,dec

[0156] Then divide by (2B+1) and take the absolute value to get: |n B,enc +n B,dec |=|Φ res,n,Q,dec / (2B+1)-Φ res,n,Q / (2B+1)|≦Φ res,n,Q / (2B+1)|+|Φ res,n,Q,dec / (2B+1)|≦B / (2B+1)+B / (2B+1)<1

[0157] Currently, |n B,enc +n B,dec Since | is a positive integer strictly less than 1, it follows that n B,dec =-n B,enc is obtained. This is because Φ res,n,Q =Φ res,n,Q,dec Prove that, and Φ res,n,Q -Φ res,n,Q,dec =-n B,dec * (2B+1)-n B,enc * (2B+1)=-(n B,dec +n B,enc )*(2B+1)=0.

[0158] Therefore, the first-order residual azimuth angle of the decoder, Φ res,n,Q,dec is the first-order residual azimuth angle of the encoder Φ res,n,Q In other words, adding multiples of 2B+1 during the decoding method does not affect the ability of the decoder to recover a sufficient value of the first order residual azimuth angle.

[0159] In step 233, the first-order residual azimuth angle Φ res,n,dec The decoded first-order residual azimuth angle Φ res,Q,dec Get the.

[0160] As shown in equation (3) or (7), point P n The decoded azimuth angle Φ related to dec,n is the decoded first-order residual azimuth angle Φ res,n,dec and the predicted angle Φ of the azimuth angle Φ(Pn) pred,n Obtained by. Φ dec,n =Φ res,n,dec +Φ pred,n

[0161] The encoding / decoding method can be used to encode / decode point clouds that can be used for various purposes, in particular to encode / decode azimuth angle data based on boundary values ​​that depend on the sensor characteristics, thereby improving the efficiency of the codec.

[0162] FIG. 14 shows a schematic block diagram of an embodiment of a system according to the present invention.

[0163] System 300 may be implemented as one or more devices and may include various components as described below. In various embodiments, system 300 may be configured to implement one or more aspects described herein.

[0164] Examples of devices that may comprise all or part of system 300 include personal computers, laptop computers, smartphones, tablets, digital multimedia set-top boxes, digital television receivers, personal video recording systems, connected home appliances, connected cars and their associated processing systems, head mounted displays (HMDs, see-through glasses), projectors, "caves" (systems including multiple displays), servers, video encoders, video decoders, post-processors that process output from video decoders, pre-processors that provide input to video encoders, web servers, set-top boxes, and any other devices for processing point clouds, videos, or images, or other communications devices. The elements of system 300 may be implemented singly or in combination on a single integrated circuit (IC), multiple ICs, and / or discrete components. For example, in at least one embodiment, the processing and encoder / decoder elements of system 300 may be distributed across multiple ICs and / or discrete components. In various embodiments, system 300 may be communicatively coupled to other similar systems or other electronic devices, for example, via a communications bus or dedicated input and / or output ports.

[0165] The system 300 includes at least one processor 310 configured to execute instructions loaded therein to, for example, implement aspects described herein. The processor 310 may include embedded memory, input / output interfaces, and various other circuits known in the art. The system 300 may include at least one memory 320 (e.g., volatile and / or non-volatile memory devices). The system 300 may include a storage device 340 including non-volatile and / or volatile memory, including, but not limited to, Electrically Erasable Programmable Read-Only Memory (EEPROM), Read-Only Memory (ROM), Programmable Read-Only Memory (PROM), Random Access Memory (RAM), Dynamic Random Access Memory (DRAM), Static Random Access Memory (SRAM), Flash memory, magnetic disk drives, and / or optical disk drives. By way of non-limiting example, the storage device 340 may include an internal storage device, an additional storage device, and / or a network-accessible storage device.

[0166] The system 300 may include an encoder / decoder module 330 configured to process data to provide encoded / decoded point cloud geometry shape data, for example, and the encoder / decoder module 330 may include its own processor and memory. The encoder / decoder module 330 may represent a module(s) included in a device to perform encoding and / or decoding functions. As is known, a device may include either one or both of an encoding and decoding module. Also, the encoder / decoder module 330 may be implemented as a separate element of the system 300 or may be coupled within the processor 310 as a combination of hardware and software known to those skilled in the art.

[0167] Program code loaded into the processor 310 or the encoder / decoder 330 to perform aspects described herein may be stored in the storage device 340 and subsequently loaded into the memory 320 and executed by the processor 310. According to various embodiments, during execution of processes described herein, one or more of the processor 310, the memory 320, the storage device 340, and the encoder / decoder module 330 may store one or more of the following items: point cloud frames, encoded / decoded geometry shapes / attributes videos / images or portions of encoded / decoded geometry shapes / attributes videos / images, bitstreams, matrices, variables, and equations, formulas, logic for operations or intermediate or final results of operations.

[0168] In some embodiments, memory within the processor 310 and / or the encoder / decoder module 330 may be used to store instructions and provide working memory for processes performed during encoding or decoding.

[0169] However, in other embodiments, memory external to the processing device (e.g., the processing device may be the processor 310 or the encoder / decoder module 330) is used for one or more of these functions. The external memory may be the memory 320 and / or the storage device 340, e.g., dynamic volatile memory and / or non-volatile flash memory. In some embodiments, the external non-volatile flash memory is used to store, for example, an operating system of a television. In at least one embodiment, a fast external dynamic volatile memory such as RAM may be utilized as working memory for video encoding / decoding and decoding operations, e.g., for MPEG-2 Part 2 (also known as ITU-T Recommendation H.262 and ISO / IEC 13818-2, also known as MPEG-2 Video), HEVC (High Efficiency Video Coding / Decoding), VVC (Versatile Video Coding / Decoding), or MPEG-I Parts 5 or 9.

[0170] As indicated in block 390, inputs can be provided to the elements of system 300 via various input devices. Such input devices include, but are not limited to, (i) an RF section capable of receiving RF signals transmitted wirelessly from a broadcast station or the like, (ii) a composite input terminal, (iii) a USB input terminal, and / or (iv) an HDMI input terminal.

[0171] In various embodiments, the input devices of block 390 have associated and corresponding input processing elements as known in the art. For example, the RF section may be associated with the following required elements: (i) selecting a desired frequency (also called signal selection, or limiting the signal within a frequency band), (ii) downconverting the selected signal, (iii) selecting a signal frequency band by controlling the frequency band back to a narrow frequency band, (for example) referred to as a channel in some embodiments, (iv) demodulating the downconverted and frequency band limited signals, (v) performing error correction, and (vi) demultiplexing to select a desired data packet flow. The RF section of various embodiments includes elements purposely performing these functions, such as frequency selectors, signal selectors, frequency band limiters, channel selectors, filters, downconverters, demodulators, error correction devices, and demultiplexers. The RF section may include a tuner that performs each of these functions, including, for example, downconverting the received signal to a lower frequency (e.g., intermediate frequency or near baseband) or to baseband.

[0172] In one set-top box embodiment, the RF section and its associated input processing elements can receive RF signals transmitted over a wired (e.g., cable) medium, after which the RF section can perform frequency selection by filtering, down-converting and re-filtering to obtain a desired frequency band.

[0173] In various embodiments, the order of these (and other) elements may be rearranged, some of these elements may be eliminated, and / or other elements that perform similar or different functions may be added.

[0174] Adding elements can include inserting elements between existing elements, such as amplifiers and analog-to-digital converters. In various embodiments, the RF section includes an antenna.

[0175] Additionally, the USB and / or HDMI terminals may include corresponding interface processors and are used to connect the system 300 to other electronic devices via USB and / or HDMI connections. It should be noted that, when necessary, aspects of the input processing (e.g., Reed-Solomon error correction) may be implemented, for example, in a separate input processing IC or in the processor 310. Thus, it should be understood that, when necessary, aspects of the USB or HDMI interface processing may be implemented in a separate interface IC or in the processor 310. Upon demodulation, the error corrected and demultiplexed stream may be provided to various processing elements, including the processor 310 and the encoder / decoder 330, which operates in combination with memory and storage elements, to process the data stream when necessary for display on an output device.

[0176] The various elements of system 300 may be provided within a unitary housing, where the elements may be interconnected and data transmitted between them using a suitable connection layout 390, such as internal buses (including I2C buses), wiring, and printed circuit boards, as are well known in the art.

[0177] System 300 may include a communication interface 350 such that it may communicate with other devices over a communication channel 700. Communication interface 350 may include, but is not limited to, a transceiver configured to transmit and receive data over communication channel 700. Communication interface 350 may include, but is not limited to, a modem or a network card, and communication channel 700 may be implemented within a wired and / or wireless medium, for example.

[0178] In various embodiments, a Wi-Fi network, such as IEEE 802.11, can be used to transmit the data stream to the system 300. The Wi-Fi signal in these embodiments can be received by a communication channel 700 suitable for Wi-Fi communication and the communication interface 350. The communication channel 700 in these embodiments can generally be connected to an access point or router that provides access to external networks, including the Internet, to enable streaming applications and other over-the-top communications.

[0179] Another embodiment may provide streaming data to the system 300 using a set-top box, which carries the data through an HDMI connection in the input block 390.

[0180] There are other embodiments in which the RF connection of input block 390 is used to provide streaming data to system 300 .

[0181] Streaming data can be used as a form of signaling information used by the system 300. The signaling information can be a bit stream of encoded point cloud data representing a physical object and / or information such as the number of points in the point cloud and / or sensor configuration parameters (e.g., basic azimuth displacements ΔΦ and / or boundary values ​​B and / or azimuth data Φ coded,n ).

[0182] It should be noted that signaling can be achieved in various manners, for example, in various embodiments, one or more syntax elements, flags, etc. can be used to transmit signaling information to a corresponding decoder.

[0183] System 300 can provide output signals to a variety of output devices, including a display 400, speakers 500, and other peripherals 600. In various example embodiments, other peripherals 600 can include one or more of a separate DVR, a disc player, a stereo system, a lighting system, and other devices that provide functionality based on the output of system 300.

[0184] In various embodiments, control signals may be communicated between system 300 and display 400, speaker 500 or other peripherals 600 using AV.Link (Audio / Video Link), CEC (Consumer Electronics Control) or other communication protocol signaling enabling device-to-device control, with or without a user.

[0185] Output devices can be communicatively connected to the system 300 via dedicated connections by corresponding interfaces 360, 370 and 380.

[0186] Alternatively, an output device can be connected to the system 300 using a communication channel 700 via the communication interface 350. The display 400 and the speaker 500 can be integrated into a single unit along with other components of the system 300 such as an electronic device (e.g., a television).

[0187] In various embodiments, the display interface 360 ​​can include a display driver, such as a timing controller (T Con) chip.

[0188] For example, if the RF portion of input 390 is part of a separate set-top box, then display 400 and speakers 500 may alternatively be separate from one or more of the other components. In various embodiments where display 400 and speakers 500 may be external components, output signals may be provided via dedicated output connections (including, for example, an HDMI port, a USB port, or a COMP output terminal).

[0189] 1-14 illustrate various methods, each of which includes one or more steps or actions to achieve the described method. Unless a specific order of steps or actions is required for the precise operation of the method, the order and / or use of specific steps and / or actions can be modified or combined.

[0190] Although some examples have been described with respect to block diagrams and / or operational flow charts, each block represents a circuit element, a module, or a portion including one or more executable instruction codes for implementing a specified logic function(s). It should be noted that in other embodiments, the function(s) shown in the blocks may not occur in the order shown. For example, two blocks shown one after the other may in fact be executed essentially in parallel, or the blocks may be executed in the reverse order, depending on the functions involved.

[0191] For example, the embodiments and aspects described herein may be implemented in a method or process, an apparatus, a computer program, a data stream, a bit stream, or a signal. Even if discussed only in the context of a single type of embodiment (e.g., discussed only as a method), embodiments of the discussed features may be implemented in other forms (e.g., an apparatus or a computer program).

[0192] The methods may be implemented, for example, in a processor, which generally refers to a processing device including, for example, a computer, a microprocessor, an integrated circuit, or a programmable logic device, etc. Processors further include communication devices.

[0193] Also, the method may be implemented with instructions executed by a processor, and such instructions (and / or data values ​​generated by the embodiments) may be stored in a computer-readable storage medium. The computer-readable storage medium may take the form of a computer-readable program product having computer-readable program code embodied in one or more computer-readable media and executable thereon by a computer. Given the inherent ability to store information therein and retrieve information provided thereby, the computer-readable storage medium as used herein may be considered as a non-transitory storage medium. The computer-readable storage medium may be, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Note that the following provides more specific examples of computer-readable storage media to which the present embodiment may be applied, but it should be understood that they are merely exemplary and not an exhaustive list, as can be easily recognized by those skilled in the art. A portable computer floppy disk, a hard disk, a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0194] The instructions may create an application tangibly embodied on a processor-readable medium.

[0195] For example, instructions may reside in hardware, firmware, software, or a combination thereof. For example, instructions may be found in an operating system, a separate application, or a combination of both. A processor may thus be characterized as, for example, a device configured to perform a process or a device that includes a processor-readable medium (e.g., a storage device) having instructions for performing a process. Additionally, in addition to or in lieu of instructions, the processor-readable medium may store data values ​​produced by an embodiment.

[0196] The devices may be implemented in, for example, suitable hardware, software, and firmware. Examples of such devices include personal computers, laptop computers, smartphones, tablets, digital multimedia set-top boxes, digital television receivers, personal video recording systems, connected home appliances, head mounted displays (HMDs, see-through glasses), projectors, "caves" (systems including multiple displays), servers, video encoders, video decoders, post-processors that process output from video decoders, pre-processors that provide input to video encoders, web servers, set-top boxes, and any other device for processing point clouds, video or images, or other communications devices. It is noted that the devices may be mobile and may be mounted in a moving vehicle.

[0197] The computer software may be implemented in the processor 310, hardware, or a combination of hardware and software. As a non-limiting example, an embodiment may be implemented in one or more integrated circuits. The memory 320 may be of any type suitable for the technology environment and may be implemented in any suitable data storage technology (as a non-limiting example, for example, optical memory devices, magnetic memory devices, semiconductor-based memory devices, fixed memories and removable memories). As a non-limiting example, the processor 310 may be of any type suitable for the technology environment and may cover one or more of a microprocessor, a general-purpose computer, a special-purpose computer, and a processor based on a multi-core architecture.

[0198] As will be apparent to one skilled in the art, the embodiments can generate various signals shaped to carry, for example, storable or transmittable information. The information can include, for example, instructions for performing a method or data generated by one of the described embodiments. For example, the signal can be shaped to carry a bit stream of the described embodiments. The signal can be shaped, for example, into an electromagnetic wave (e.g., a radio frequency portion of the frequency spectrum) or a baseband signal. The shaping can include, for example, encoding the data stream and modulating a carrier wave with the encoded data stream. The information carried by the signal can be, for example, analog or digital information. As is well known, the signal can be transmitted over different wired or wireless links. The signal can be stored in a processor readable medium.

[0199] The terms used herein are used only to describe particular embodiments and are not intended to be limiting. Unless the context clearly dictates otherwise, the singular forms "a," "an," and "the" as used herein include the plural forms. Furthermore, as used herein, the terms "include / comprise" and / or "including / comprising" may indicate the presence of a described feature, integer, step, operation, element, and / or component, etc., but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or combinations thereof. Also, when an element is said to be "responsive to" or "connected" to another element, it may be directly responsive to or connected to the other element, or intermediate elements may be present. Conversely, when an element is said to be "directly responsive to" or "directly connected" to another element, intermediate elements are not present.

[0200] For example, in the case of "A / B," "A and / or B," and "at least one of A and B," the use of any one of the symbols / terms " / ," "and / or," and "at least one of" is intended to cover the selection of the first listed option (A), or the selection of the second listed option (B), or the selection of two options (A and B). As a further example, in the case of "A, B, and / or C" and "at least one of A, B, and C," such language is intended to cover only the selection of the first listed option (A), or only the selection of the second listed option (B), or only the selection of the third listed option (C), or only the selection of the first and second listed options (A and B), or only the selection of the first and third listed options (A and C), or only the selection of the second and third listed options (B and C), or all three options (A, B, and C). This can be extended to any number of listed items as would be apparent to one of skill in the art.

[0201] Various numerical values ​​may be used in this application, and the specific values ​​are exemplary, and the embodiments described are not limited to these specific values.

[0202] It should be noted that terms such as first, second, etc. may be used to describe various elements in this specification, but are not limited to these terms. These terms are used only to distinguish one element from another element. For example, a first element can be referred to as a second element, and similarly, a second element can be referred to as a first element, without departing from the teachings of this application. No ordering is implied between the first element and the second element.

[0203] References to "one exemplary embodiment" or "exemplary embodiment" or "one embodiment" or "embodiment" and other variations are often used to convey that a particular feature, structure, characteristic, etc. (as described in conjunction with the embodiment) is included in at least one embodiment / embodiment. Thus, appearances of the terms "in one exemplary embodiment" or "in an exemplary embodiment" or "in one embodiment" or "in an embodiment" and any other variations appearing in various places in this application are not necessarily all referring to the same embodiment.

[0204] Similarly, references herein to "according to an exemplary embodiment" or "in an exemplary embodiment" and other variations are often used to convey that a particular feature, structure, or characteristic (as described in conjunction with an embodiment) may be included in at least one exemplary embodiment. Thus, the phrases "according to an exemplary embodiment" or "in an exemplary embodiment" appearing in various places in the specification do not necessarily refer to the same exemplary embodiment, nor are separate or alternative exemplary embodiments mutually exclusive of other exemplary embodiments.

[0205] The reference numerals of the drawings appearing in the claims are used for explanation only and do not limit the scope of the claims. Although not explicitly described, the present embodiment / examples and modifications can be used in any combination or partial combination.

[0206] It is understood that when a figure is presented as a flow chart, a corresponding apparatus block diagram is also provided. Similarly, it is understood that when a figure is presented as a block diagram, a flow chart of the corresponding method / process is also provided.

[0207] Some figures include arrows that indicate a primary direction of communication in a communication path, however, it should be understood that communication can occur in a direction opposite to that of the illustrated arrow.

[0208] Various embodiments relate to decoding. As used herein, "decoding" may cover all or part of a process, such as performing a received point cloud frame (which may include a received bitstream encoding one or more point cloud frames) to generate a final output suitable for display or further processing in a reconstructed point cloud domain. In various embodiments, such a process may include one or more of the processes typically performed by a decoder. In various embodiments, for example, such a process may alternatively include a process performed by a decoder of various embodiments described herein.

[0209] As a further example, in one embodiment, "decoding" may refer to only inverse quantization, in one embodiment, "decoding" may refer to entropy decoding, in another embodiment, "decoding" may refer to differential decoding, and in another embodiment, "decoding" may refer to a combination of inverse quantization, entropy decoding, and differential decoding. Depending on the context in which it is specifically described, it is obvious and easy to understand for those skilled in the art whether the term "decoding process" refers specifically to a subset of operations or to a more general decoding process.

[0210] Various embodiments relate to encoding. Similar to the discussion of "decoding" above, "encoding" as used herein can cover all or part of the process of, for example, executing an input point cloud frame to generate an encoding bitstream. In various embodiments, this type of process includes one or more of the processes typically performed by an encoder. In various embodiments, such processes can alternatively include the processes performed by the encoder of each embodiment described herein.

[0211] As a further example, in one embodiment, "encoding" may refer only to quantization, in one embodiment, "encoding" may refer only to entropy coding, in another embodiment, "encoding" may refer only to differential coding, and in another embodiment, "encoding" may refer to a combination of quantization, differential coding, and entropy coding. Depending on the context in which a particular description is made, it will be clear and easy to understand for one of ordinary skill in the art whether the term "encoding process" refers specifically to a subset of operations or to a more general encoding process.

[0212] This application has also referred to "determining" various pieces of information. Determining the information may include one or more of estimating the information, calculating the information, predicting the information, or looking up the information from a memory.

[0213] This application also refers to "accessing" various pieces of information, which may include one or more of receiving information, retrieving information (e.g., from a memory), storing information, moving information, copying information, calculating information, determining information, predicting information, or estimating information.

[0214] This application has also referred to "receiving" various pieces of information. Like "access," receiving is a broad term. Receiving information can include, for example, one or more of accessing information or retrieving information (e.g., from a memory). In another manner, terms of operations such as storing information, processing information, transmitting information, moving information, copying information, deleting information, calculating information, determining information, predicting information, or estimating information are typically associated with "receiving."

[0215] Additionally, as used herein, the term "signal" may refer to a particular signal that a corresponding decoder may instruct, etc. For example, in some embodiments, the encoder may instruct the decoder to transmit the number of points in the point cloud and / or sensor configuration parameters (e.g., base azimuth angle shifts ΔΦ and / or boundary values ​​B and / or azimuth angle data Φ coded,n ) to inform the decoder. In this manner, the same parameters can be used at the encoder side and the decoder side in the embodiment. Thus, for example, the encoder can send the specific parameters to the decoder (explicit signaling), so that the decoder can use the same specific parameters. Conversely, if the decoder has the specific parameters and other parameters, it can use signaling that does not require transmission (indirect signaling) to inform the decoder and facilitate the selection of the specific parameters. To avoid transmitting any actual functions, bit savings are achieved in various embodiments. It should be appreciated that the signaling can be accomplished in various ways. For example, in various embodiments, one or more grammatical elements, flags, etc. are used to transmit information to the corresponding decoder. Although the above relates to the verb form of the word "signal", the word "signal" may also be used as a noun in this specification.

[0216] Although several embodiments have been described above, it should be understood that various modifications may be made. For example, elements of different embodiments may be combined, supplemented, modified, or deleted to produce other embodiments. Also, as will be appreciated by those skilled in the art, other structures and processes may be substituted for the disclosed structures and processes, resulting in embodiments that perform essentially the same function(s) in essentially the same way(s) to achieve at least essentially the same result(s) as the disclosed embodiments. Accordingly, these and other embodiments are contemplated by the present application.

Claims

1. 1. A method for encoding a point cloud into a bitstream of encoded point cloud data representing a physical object, comprising: The azimuth angle (Φ(P n )) representing the azimuth angle data (Φ coded,n ) into a bitstream, said encoding being based on a boundary value (B) that depends on the characteristics of the sensor, and said azimuth angle data (Φ coded,n ) is limited by said boundary value; 20. A method for encoding a point cloud into a bitstream of encoded point cloud data representing a physical object, comprising:

2. The azimuth angle data (Φ coded,n ) is the azimuth angle (Φ(P n ) and the predicted azimuth angle (Φ pred,n ) the first-order residual azimuth angle (Φ res,n ), which is obtained by quantizing 10. The method of claim 1, wherein the point cloud is encoded into a bitstream of encoded point cloud data representing a physical object.

3. The azimuth angle data (Φ coded,n ) is an offset value that depends on the boundary value (B) and a first-order residual azimuth angle (Φ res,n ) and the first-order residual azimuth angle (Φ res,n ) prediction (Φ res,n,pred ) and the second-order residual azimuth angle (Φ res,n,res ) and intermediate azimuth data that depends on the azimuth angle (Φ(P n )), the first-order residual azimuth angle (Φ res,n ) being the first-order residual azimuth angle between the azimuth angle (Φ(P n )) and the predicted azimuth angle (Φ pred,n ).

10. The method of claim 1, wherein the point cloud is encoded into a bitstream of encoded point cloud data representing a physical object.

4. The offset value is an integer value (n B,enc) and 2B+1, where B is the boundary value, and the integer value (n B,enc ) is the azimuth angle data (Φ coded,n ) is limited by said boundary value B; 4. A method for encoding the point cloud of claim 3 into a bitstream of encoded point cloud data representing a physical object.

5. The boundary value (B) is the basic azimuth angle displacement and the first-order residual azimuth angle (Φ res,n ) and a quantization parameter for quantizing A method for encoding a point cloud according to any one of claims 2 to 4 into a bitstream of encoded point cloud data representing a physical object.

6. Azimuth data (Φ coded,n ) may further comprise: The azimuth angle data (Φ coded,n ) into a series of binary data (f i ) and Either of the two possible values ​​corresponds to the azimuth angle data (Φ coded,n The absolute value of the binary data (f i ) and A method for encoding a point cloud according to any one of claims 1 to 4 into a bitstream of encoded point cloud data representing a physical object.

7. 1. A method of decoding a point cloud from a bitstream of encoded point cloud data representing a physical object, comprising: The azimuth angle (Φ(P n )) representing the azimuth angle data (Φ coded,n ) from the bit stream, said decoding being based on a boundary value (B) that depends on the characteristics of the sensor, and said azimuth angle data (Φ coded,n ) is limited by the boundary value (B); 1. A method for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object, comprising:

8. The azimuth angle data (Φ coded,n ) is decoded as Each binary data (f i ) Both of the two possible values ​​are coded,n ) is limited by the boundary value B, the binary data (f i ) by decoding the Or, the binary data (f i ) to a unique value that does not violate the above conditions, The azimuth angle data (Φ coded,n ) i ) 8. A method for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object according to claim 7.

9. The azimuth angle data (Φ coded,n ) is the azimuth angle (Φ(P n ) and the predicted azimuth angle (Φ pred,n ) and the quantized residual azimuth angle (Φ res,n,Q ) 8. A method for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object according to claim 7.

10. The method comprises: The azimuth angle data (Φ coded,n ) and the azimuth angle (Φ(P n ) and the predicted azimuth angle (Φ pred,n ) and the first residual azimuth angle prediction (Φ res,n,pred ) and the intermediate residual azimuth angle (Φ res,n,Q ) and The offset value that depends on the boundary value (B) and the intermediate residual azimuth angle (Φ res,n,Q) to obtain the first-order residual azimuth angle (Φ res,n,Q,dec ) and The first residual azimuth angle (Φ res,n,Q,dec ) 8. A method for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object according to claim 7.

11. The offset value is an integer value (n B,dec ) and 2B+1, where B is the boundary value, and the integer value (n B,dec ) is the intermediate residual azimuth angle (Φ res,n,Q ) is limited by said boundary value B; 11. A method for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object according to claim 10.

12. The boundary value (B) depends on the base azimuth angle displacement and a quantization parameter for dequantizing the first-order residual azimuth angle (Φ res,n,Q,dec ). A method for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object according to claim 10 or 11.

13. 1. An apparatus for encoding a point cloud into a bitstream of encoded point cloud data representing a physical object, comprising: one or more processors configured to encode azimuth angle data into the bitstream representing an azimuth angle responsive to a capture angle of a sensor that captured a point of the point cloud, the encoding being based on boundary values ​​that depend on characteristics of the sensor, such that an absolute value of the azimuth angle data is limited by the boundary values.

16. An apparatus for encoding a point cloud into a bitstream of encoded point cloud data representing a physical object, comprising:

14. 1. An apparatus for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object, comprising: one or more processors configured to decode azimuth angle data from the bitstream representing an azimuth angle responsive to a capture angle of a sensor that captured a point of the point cloud, the decoding being based on boundary values ​​that are dependent on characteristics of a sensor, such that an absolute value of the azimuth angle data is limited by the boundary values.

1. An apparatus for decoding a point cloud from a bitstream of encoded point cloud data representing a physical object, comprising:

15. A computer program, which when executed by one or more processors, causes the one or more processors to perform a method for decoding a point cloud from a bit stream of encoded point cloud data representing a physical object, the method comprising: decoding azimuth angle data from the bit stream representing an azimuth angle responsive to a capture angle of a sensor that captured a point of the point cloud, the decoding being based on boundary values ​​that depend on characteristics of a sensor, such that an absolute value of the azimuth angle data is limited by the boundary values. A computer program comprising:

Citation Information

Patent Citations

  • System and method for ordered representation and feature extraction for point clouds obtained by detection and ranging sensor

    US20200302237A1

  • Method and apparatus for point cloud compression

    US20200394822A1

  • Coding of laser angles for angular and azimuthal modes in geometry-based point cloud compression

    US20210326734A1