WO2021197238A1 - Point cloud attribute prediction method and device, coding method and device, and decoding method and device - Google Patents

Point cloud attribute prediction method and device, coding method and device, and decoding method and device Download PDF

Info

Publication number
WO2021197238A1
WO2021197238A1 PCT/CN2021/083396 CN2021083396W WO2021197238A1 WO 2021197238 A1 WO2021197238 A1 WO 2021197238A1 CN 2021083396 W CN2021083396 W CN 2021083396W WO 2021197238 A1 WO2021197238 A1 WO 2021197238A1
Authority
WO
WIPO (PCT)
Prior art keywords
attribute
point
prediction
value
current node
Prior art date
Application number
PCT/CN2021/083396
Other languages
French (fr)
Chinese (zh)
Inventor
李革
何盈燊
王静
邵薏婷
高文
Original Assignee
鹏城实验室
北京大学深圳研究生院
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 鹏城实验室, 北京大学深圳研究生院 filed Critical 鹏城实验室
Publication of WO2021197238A1 publication Critical patent/WO2021197238A1/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/593Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/13Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/96Tree coding, e.g. quad-tree coding

Definitions

  • the present disclosure relates to the technical field of point cloud processing, and in particular to a point cloud attribute prediction method, encoding method, decoding method and equipment thereof.
  • Three-dimensional point cloud is an important form of digital representation of the real world. With the rapid development of three-dimensional scanning equipment (such as lasers, radars, etc.), the accuracy and resolution of point clouds have become higher. High-precision point clouds are widely used in the construction of urban digital maps, and play a technical support role in many popular researches such as smart cities, unmanned driving, and cultural relics protection.
  • the point cloud is obtained by sampling the surface of the object by a three-dimensional scanning device.
  • the number of points in a frame of point cloud is generally in the order of one million. Each point contains geometric information, color, reflectivity and other attribute information, and the amount of data is very large.
  • the huge data volume of 3D point cloud brings huge challenges to data storage and transmission, so it is very important to compress the point cloud.
  • Point cloud compression is mainly divided into geometric compression and attribute compression.
  • the point cloud attribute compression method described in the test platform PCEM provided by the Chinese AVS (Audio Video coding Standard) point cloud compression working group mainly uses the point cloud based on Morton order Prediction method, that is, the current node cloud is Morton sorted according to the position information of the point cloud, the attribute value of the previous point of the current node Morton order is selected as the attribute predicted value of the current node, and finally the actual attribute value of the current node is subtracted from the attribute The predicted value obtains the attribute residual value.
  • the above point cloud prediction method only considers the Morton order. There is a situation that the previous point of the Morton order cannot predict the attribute value of the current node well, which easily leads to low attribute prediction accuracy, which reduces the performance of encoding and decoding. .
  • the present disclosure provides a point cloud attribute prediction method, encoding method, decoding method and equipment, and aims to solve the problem that in the prior art, the neighbors found in the attribute encoding of the point cloud are not close enough to affect the attribute prediction value, which leads to the point cloud attribute encoding And the problem of poor decoding performance.
  • a point cloud attribute prediction method which includes the steps:
  • the adding an offset value to the original coordinates of the point cloud to obtain a new coordinate value includes:
  • the point cloud attribute prediction method wherein the determining a new sequence according to the new coordinate value includes the steps:
  • the offset Morton order is obtained.
  • the point cloud attribute prediction method wherein the determining the attribute prediction value of the current node according to the new order includes the steps:
  • the point cloud attribute prediction method wherein the determining the attribute prediction value of the current node according to the new order includes the steps:
  • the first existing node is searched forward as the first prediction point
  • the attribute value of the point with the smallest distance is used as the attribute prediction value of the current node, or K1 existing nodes are searched forward according to the offset Morton order as the first prediction point,
  • the attribute values of the K1 first prediction points are weighted as the attribute prediction values of the current node.
  • the point cloud attribute prediction method wherein the determining the attribute prediction value of the current node according to the new order includes the steps:
  • the first existing node is searched forward as the first prediction point
  • the first existing node is searched forward as the second predicted point
  • the original Morton order under the initial coordinates looks forward to K2 existing nodes as the second prediction point;
  • the attribute weighted value of the third predicted point is used as the attribute predicted value of the current node.
  • the step of calculating the distance from the first prediction point to the current node includes:
  • the sum of the difference between the coordinates of the current node and the first prediction point in the X, Y, and Z directions is calculated as the distance between the current node and the first prediction point.
  • a point cloud attribute prediction device which includes a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor;
  • the communication bus realizes connection and communication between the processor and the memory
  • a point cloud attribute coding method which includes the steps:
  • the prediction residual value of the current node is coded to obtain a point cloud code stream.
  • a point cloud attribute encoding device which includes a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor;
  • the communication bus realizes connection and communication between the processor and the memory
  • a point cloud attribute decoding method which includes the steps:
  • the attribute value of the current node is determined according to the sum of the attribute prediction value of the current node and the attribute residual value.
  • a point cloud attribute decoding device which includes a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor;
  • the communication bus realizes connection and communication between the processor and the memory
  • the present disclosure uses the offset Morton order to find the nearest neighbor point to the current node in the physical space, thereby determining the attribute prediction value of the current node, and finally performs the process according to the attribute prediction value.
  • the attribute coding or the attribute value of the current node is determined according to the attribute prediction value of the current node and the point cloud attribute code stream.
  • the point cloud attribute prediction method, encoding method, and decoding method provided by the present disclosure can improve the utilization of the geometric information and the attribute information correlation of the point cloud, thereby improving the compression performance of the point cloud attribute.
  • FIG. 1 is a schematic diagram of the original Morton sequence of nodes in a point cloud under an octree in an embodiment of the disclosure.
  • Fig. 2 is a flowchart of a preferred embodiment of a point cloud attribute prediction method provided by the present disclosure.
  • FIG. 3 is a schematic diagram of the Morton sequence of offsetting nodes in the point cloud under the octree in an embodiment of the disclosure.
  • FIG. 4 is a schematic diagram of the original Morton sequence of nodes in the point cloud under the quadtree in the embodiment of the disclosure.
  • FIG. 5 is a schematic diagram of the Morton sequence of offsetting nodes in a point cloud under a quadtree in an embodiment of the disclosure.
  • FIG. 6 is a flowchart of a preferred embodiment of a point cloud attribute encoding method provided by the present disclosure.
  • Fig. 7 is a schematic structural diagram of a point cloud attribute encoding device provided by the present disclosure.
  • FIG. 8 is a flowchart of a preferred embodiment of a point cloud attribute decoding method provided by the present disclosure.
  • the present disclosure provides a point cloud attribute prediction method, encoding method, decoding method, and equipment.
  • the present disclosure will be further described in detail below with reference to the drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present disclosure, and not used to limit the present disclosure.
  • the present invention provides a point cloud attribute prediction method, which includes the steps of: adding an offset value to the original coordinates of the point cloud to obtain a new coordinate value; determining a new order according to the new coordinate value; The sequence determines the predicted value of the attributes of the current node.
  • an offset value is added to the original coordinates of the point cloud, and the offset value added by different coordinates may be the same or different.
  • the prediction point of the current node is determined according to the new order, and finally the attribute prediction value of the current node is determined according to the prediction point.
  • the determining a new order according to the new coordinate value includes the steps of: generating a Morton code corresponding to the point cloud according to the new coordinate value; Pause order.
  • the Morton order after Morton sorting of each point in the point cloud can be specifically expressed as: the position coordinates (Xk, Yk, Zk) of the k-th point are expressed as: Then the Morton code corresponding to the k-th point is expressed as: Or use octal numbers to represent every three bits Then the Morton code corresponding to the k-th point can be expressed as:
  • Figure 1 is a partial schematic diagram of a three-dimensional point cloud. The numbers represent the Morton order in the three-dimensional point cloud. It is assumed that there are points in the Morton order 0, 2, 10, 16, and the three points are numbered with letters for the convenience of expression. It is A, B, C, D.
  • the method for searching the predicted point of the point cloud according to the Morton order is to find the first point in the Morton order as the current predicted point. Assuming that the current node is D(16), according to the PCEM search method, the first point C(10) in the Morton order is found as the predicted point of D(16), so there will be a problem, B(2) is The point closer to D(16) but the predicted point of D(16) is farther C(10). Using the attribute value of C(10) to predict D(16) will affect the point cloud compression performance.
  • FIG. 2 provides a flow chart of a preferred embodiment of a point cloud attribute prediction method, as shown in FIG. 2, which includes the steps:
  • this embodiment adds a fixed offset value (j1, j2, j3) to the original point cloud coordinates (x, y, z), and uses the new coordinates (x+j1, y+j2, z). +j3) Generate the Morton code corresponding to the point cloud, and obtain the offset Morton order according to the Morton order, and the value of the offset values j1, j2, and j3 is greater than or equal to 1.
  • This embodiment uses the offset Morton order to find the physically closest neighbor to the current node, thereby determining the attribute prediction value of the current node, and finally performing attribute encoding according to the attribute prediction value or according to the current node
  • the attribute prediction value of and the point cloud attribute code stream determine the attribute value of the current node, thereby improving the coding and decoding performance of the point cloud attribute.
  • the offset value (1, 1, 1) is added to the 0, 2, 10, and 16 points in the origin point cloud to obtain 7, 21, 29, and 29 in the new offset point cloud.
  • 23 points, as shown in Figure 3, that is, A, B, C, and D correspond to the points numbered 0, 2, 10, 16 in the original Morton order, and correspond to the points numbered 7, 21, 29 in the new Morton order.
  • this new Morton order is called the offset Morton order.
  • the first existing node is searched forward as the first prediction point according to the offset Morton order; the attribute value of the first prediction point is used as the attribute prediction value of the current node.
  • the current node D (23) looks for the offset Morton order
  • the first point is used as the predicted point
  • the predicted point found is B(21)
  • B(21) is used as the predicted point of the current node D(23).
  • K1 existing nodes are searched forward as the first prediction point according to the offset Morton order, and the point with the smallest distance from the current node is found at the K1 first prediction points;
  • the attribute value of the point is used as the attribute predicted value of the current node.
  • the current node D (23) looks for the first 2 points in the offset Morton order as prediction points, and the predicted point found is B (21), A(7), the first-order distance of the current nodes D(23) and B(21) is 1, and the first-order distance of the current nodes D(23) and A(7) is 2, choose the smaller distance B(21) is used as the prediction point of the current node D(23).
  • K1 existing nodes are searched forward as the first prediction point according to the offset Morton order, and the attribute values of the K1 first prediction points are weighted as the attribute prediction value of the current node.
  • the current node D (23) looks for the first 2 points in the offset Morton order as prediction points, and the predicted point found is B (21), A(7), use the average of the attribute values of B(21) and A(7) as the predicted value of the current node D(23).
  • the first existing node is searched forward according to the offset Morton order as the first prediction point; the first existing node is searched forward according to the original Morton order under the original coordinates of the point cloud as the second prediction point.
  • Prediction point calculate the distance d1 from the first prediction point to the current node; calculate the distance d2 from the second prediction point to the current node; compare the distance d1 and the distance d2, and select the smaller distance Point as the third predicted point; use the attribute value of the third predicted point as the attribute predicted value of the current node.
  • the found point is C(10), and C(10) is used as the predicted point 1.
  • the order distance is 3.
  • Compare the distance between predicted point 1 and predicted point 2 to the current node select predicted point 2 with a smaller distance as the predicted point of current node D (23), and use the attribute value of predicted point 2 to perform attribute prediction on the current node.
  • K1 existing nodes are searched forward as the first prediction point according to the offset Morton order; K2 existing nodes are searched forward as the second prediction point according to the original Morton order under the original coordinates of the point cloud Calculate the distance between the first prediction point and the second prediction point to the current node, and select the point with a small distance as the third prediction point; use the attribute value of the third prediction point as the current node The predicted value of the attribute.
  • find K1 existing points forward in the offset Morton order as shown in Figure 3 find K2 existing points forward in the original Morton order as shown in Figure 1, and choose from K1+K2 and The point with the smallest distance from the current point is used as the predicted point.
  • the current point D(16) looks for the first 2 points in the original Morton order as prediction points, and the predicted points found are C(10), B (2).
  • the current point D(23) looks for the first 2 points in the offset Morton order as the predicted points, and the predicted points found are B(21) and A(7).
  • the set of points found in the two Morton sequences is A, B, and C.
  • the first-order distances from the current point D are 2, 1, and 4 respectively.
  • the B with the smallest distance is selected as the predicted point of the current point D.
  • K1 existing nodes are searched forward as the first prediction point according to the offset Morton order; K2 existing nodes are searched forward as the second prediction point according to the original Morton order under the original coordinates of the point cloud Calculate the weighted distance d1 from the first predicted point to the current node; calculate the weighted distance d2 from the second predicted point to the current node; compare the distance d1 and the distance d2, and select the smaller distance Point as the third predicted point; use the attribute weighted value of the third predicted point as the attribute predicted value of the current node.
  • K1 existing points forward in the offset Morton order shown in Figure 3 find K2 existing points forward in the original Morton order shown in Figure 1, and calculate K1 points to The weighted distance of the current point and the weighted distance of K2 points to the current point, from which K1 points or K2 points with a smaller distance are selected as predicted points, and their attribute weighted values are used as predicted values.
  • K1 is set to 2
  • K2 is set to 2
  • the distance weighting method is the mean value.
  • the current point D(16) finds the first 2 points in the original Morton order as the predicted points.
  • the predicted points found are C(10), B(2), one distance from the current point D(16) The order distance is 4, 1, and the average value of the distance is 2.5.
  • the current point D(23) looks for the first 2 points in the offset Morton order as the predicted points, and the predicted points found are B(21), A(7) and the current point D(16) The first-order distance of is 1, 2, and the average value of the distance is 1.5. Select B(21) and A(7) in the offset Morton order with the smaller weighting distance as the predicted point, and the attribute weighted value of B(21) and A(7) as the predicted value.
  • K1 existing points are found forward in the offset Morton order
  • K2 existing points are found forward in the original Morton order
  • the KX points with the closest distance are selected from the K1+K2 points as
  • KX attribute weighted values are used as predicted values.
  • K1 is set to 2
  • K2 is set to 2
  • KX is set to 2
  • the distance weighting method is average.
  • the current point D(23) finds the first 2 points in the original Morton order as prediction points, and the predicted points found are C(10) and B(2).
  • the current point D(23) looks for the first 2 points in the offset Morton order as the predicted points, and the predicted points found are B(21) and A(7).
  • the collection of the points found in the two Morton sequences is A, B, C, and the first-order distances from the current point D are 2, 1, and 4 respectively.
  • the two points A and B with the smaller first-order distance are selected as the current
  • the predicted point of point D, the attribute weighted value of A and B are used as the predicted value.
  • the step of calculating the distance between the first prediction point and the current node includes: calculating the Euclidean distance between the current node and the first prediction point as the current node and the first prediction point.
  • the distance of the point; or, the sum of the difference between the coordinates of the current node and the first predicted point in the X, Y, and Z directions is calculated as the distance between the current node and the first predicted point.
  • the point cloud in the case of a quadtree, in the original Morton sequence as shown in FIG. 4, the point cloud has a total of 5 points, respectively Morton numbers 8, 14, 19, 24, 25, in order to It is convenient to express these points as A, B, C, D, E.
  • the previous Morton order prediction point found at the current point E(25) is D(24)
  • the first-order distance between D(24) and the current point E(25) is 4, D(24)
  • D(24) For the first prediction point. Add the coordinates of the point in Figure 4 to the offset (1, 1) to obtain the point in Figure 5, which forms the offset Morton sequence.
  • A, B, C, D, and E correspond to the offset Morton sequence in Figure 5
  • the points numbered 25, 27, 26, 30, 28 are then searched for the predicted point of the current point E(28) from the offset Morton order, and then B(27), C( 26).
  • the previous Morton order prediction point found by A(25) is B(27), the first-order distance from the current point is 1, and B(27) is used as the second prediction point.
  • B(27) is used as the second prediction point.
  • point B is selected as the current point E Point of prediction.
  • a point cloud attribute prediction device which includes a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor; the communication bus The connection and communication between the processor and the memory are realized; when the processor executes the computer-readable program, the steps in the point cloud attribute prediction method as described in the present disclosure are realized.
  • a point cloud attribute coding method is also provided, as shown in FIG. 6, which includes the steps:
  • S20 Determine the predicted residual value of the current node according to the difference between the attribute value of the current node and the predicted attribute value of the current node;
  • an offset Morton order is used to find the physically nearest neighbor to the current node, thereby determining the attribute prediction value of the current node, and finally performing attribute encoding according to the attribute prediction value.
  • the point cloud attribute coding method provided in this embodiment can improve the utilization of the geometric information and the attribute information correlation of the point cloud, thereby improving the coding and decoding performance of the point cloud attribute.
  • the present disclosure also provides a point cloud attribute encoding device, where, as shown in FIG. 7, it includes at least one processor (processor) 20; a display screen 21; and a memory (memory) 22, It may also include a communication interface (Communications Interface) 23 and a bus 24.
  • the processor 20, the display screen 21, the memory 22, and the communication interface 23 can communicate with each other through the bus 24.
  • the display screen 21 is set to display a user guide interface preset in the initial setting mode.
  • the communication interface 23 can transmit information.
  • the processor 20 can call the logic instructions in the memory 22 to execute the method in the foregoing embodiment.
  • logic instructions in the memory 22 can be implemented in the form of software functional units and when sold or used as independent products, they can be stored in a computer readable storage medium.
  • the memory 22 can be configured to store software programs and computer-executable programs, such as program instructions or modules corresponding to the methods in the embodiments of the present disclosure.
  • the processor 20 executes functional applications and data processing by running software programs, instructions, or modules stored in the memory 22, that is, implements the methods in the foregoing embodiments.
  • the memory 22 may include a program storage area and a data storage area, where the program storage area may store an operating system and an application program required by at least one function; the data storage area may store data created according to the use of the electronic device, and the like.
  • the memory 22 may include a high-speed random access memory, and may also include a non-volatile memory.
  • a point cloud attribute decoding method is also provided, as shown in FIG. 8, which includes the steps:
  • This embodiment uses the offset Morton order to find the physically closest neighbor to the current node, thereby determining the attribute predicted value of the current node, and finally determines the location based on the attribute predicted value of the current node and the point cloud attribute code stream. Describe the attribute value of the current node.
  • the point cloud attribute decoding method provided by the present disclosure can improve the utilization of the geometric information of the point cloud and the correlation of the attribute information, thereby improving the point cloud attribute decoding performance.
  • the present disclosure also provides a point cloud attribute decoding device, which includes a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor; The communication bus realizes the connection and communication between the processor and the memory; when the processor executes the computer-readable program, the steps in the point cloud attribute decoding method as described in the present disclosure are realized.
  • the point cloud attribute encoding method and decoding method provided in the present disclosure are used to compare the results obtained by point cloud compression with the benchmark results of the test platform PCEM.
  • the shift amount is (3, 3, 3)
  • Table 1 is a comparison table of rate-distortion data of brightness, chromaticity and reflectance under the condition of finite loss geometry and lossy attributes
  • Table 2 is a comparison table of rate-distortion data of brightness, chromaticity, and reflectivity under lossless geometry and lossy attribute conditions
  • Table 3 is a comparison table of rate-distortion data of luminance, chromaticity, and reflectivity under the condition of lossless geometry and limited loss properties
  • Table 4 is a comparison table of rate-distortion data of luminance, chromaticity, and reflectivity under the condition of lossless geometry and lossless attributes
  • Lossy attribute conditions, lossless geometry, lossy attribute conditions, lossless geometry, finite loss attribute conditions, the end-to-end rate distortion of the present disclosure saves 4.9%, 3.2%, and 6.9%, respectively, in the lossless geometry, lossless attribute conditions
  • the size of the lower code stream is 90% of the original; for the chrominance attribute, the end-to-end rate distortion of the present disclosure is under the condition of finite loss geometry, lossy attribute condition, lossless geometry, lossy attribute condition, lossless geometry, finite loss attribute condition
  • the present disclosure uses the offset Morton order to find the nearest neighbor point to the current node in the physical space, thereby determining the attribute prediction value of the current node, and finally performing attribute encoding or according to the attribute prediction value.
  • the attribute prediction value of the current node and the point cloud attribute code stream determine the attribute value of the current node.
  • the point cloud attribute prediction method, encoding method, and decoding method provided by the present disclosure can improve the utilization of the geometric information and the attribute information correlation of the point cloud, thereby improving the compression performance of the point cloud attribute.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

Disclosed are a point cloud attribute prediction method and device, a coding method and device, and a decoding method and device. The point cloud attribute prediction method comprises the steps of: adding an offset value to an original point cloud coordinate to obtain a new coordinate value; determining the offset Morton order according to the new coordinate value; and determining an attribute prediction value of a current node according to the offset Morton order. According to the present invention, an attribute prediction value of a current node is determined by using the offset Morton order to locate the closest neighboring point of the current node in a physical space, and finally, an attribute value of the current node is determined by performing attribute coding according to the attribute prediction value or according to the attribute prediction value of the current node and a point cloud attribute code stream. The point cloud attribute prediction method, the coding method, and the decoding method provided by the present invention can improve the utilization of the correlation between geometric information and attribute information of a point cloud, thereby improving the compressive property of the point cloud attribute.

Description

一种点云属性预测方法、编码方法、解码方法及其设备Point cloud attribute prediction method, encoding method, decoding method and equipment
优先权priority
所述PCT专利申请要求申请日为2020年3月30日,申请号为202010239384.8的中国专利优先权,本专利申请结合了上述专利的技术方案。The PCT patent application requires that the filing date is March 30, 2020, and the application number is 202010239384.8 Chinese patent priority. This patent application combines the technical solutions of the above-mentioned patents.
技术领域Technical field
本公开涉及点云处理技术领域,特别涉及一种点云属性预测方法、编码方法、解码方法及其设备。The present disclosure relates to the technical field of point cloud processing, and in particular to a point cloud attribute prediction method, encoding method, decoding method and equipment thereof.
背景技术Background technique
三维点云是现实世界数字化的重要表现形式。随着三维扫描设备(如激光、雷达等)的快速发展,点云的精度和分辨率变得更高。高精度点云广泛应用于城市数字化地图的构建,在智慧城市、无人驾驶、文物保护等众多热门研究中起技术支撑作用。点云是三维扫描设备对物体表面采样所获取的,一帧点云的点数一般是百万级别,其中每个点包含几何信息和颜色、反射率等属性信息,数据量十分庞大。三维点云庞大的数据量给数据存储、传输等带来了巨大挑战,因此对点云进行压缩变得十分重要。Three-dimensional point cloud is an important form of digital representation of the real world. With the rapid development of three-dimensional scanning equipment (such as lasers, radars, etc.), the accuracy and resolution of point clouds have become higher. High-precision point clouds are widely used in the construction of urban digital maps, and play a technical support role in many popular researches such as smart cities, unmanned driving, and cultural relics protection. The point cloud is obtained by sampling the surface of the object by a three-dimensional scanning device. The number of points in a frame of point cloud is generally in the order of one million. Each point contains geometric information, color, reflectivity and other attribute information, and the amount of data is very large. The huge data volume of 3D point cloud brings huge challenges to data storage and transmission, so it is very important to compress the point cloud.
点云压缩主要分为几何压缩和属性压缩,目前由中国AVS(Audio Video coding Standard)点云压缩工作组所提供的测试平台PCEM中描述的点云属性压缩方法主要采用基于莫顿顺序的点云预测方法,即将当前节点云按照点云的位置信息进行莫顿排序,选取当前节点莫顿顺序的前一个点的属性值作为当前节点的属性预测值,最后用当前节点的实际属性值减去属性预测值得到属性残差值。Point cloud compression is mainly divided into geometric compression and attribute compression. At present, the point cloud attribute compression method described in the test platform PCEM provided by the Chinese AVS (Audio Video coding Standard) point cloud compression working group mainly uses the point cloud based on Morton order Prediction method, that is, the current node cloud is Morton sorted according to the position information of the point cloud, the attribute value of the previous point of the current node Morton order is selected as the attribute predicted value of the current node, and finally the actual attribute value of the current node is subtracted from the attribute The predicted value obtains the attribute residual value.
然而,上述点云预测方法只考虑了莫顿顺序,其存在莫顿顺序的前一个点不能很好的预测当前节点属性值的情况,容易导致属性预测准确度不高,从而降低编码和解码性能。However, the above point cloud prediction method only considers the Morton order. There is a situation that the previous point of the Morton order cannot predict the attribute value of the current node well, which easily leads to low attribute prediction accuracy, which reduces the performance of encoding and decoding. .
因此,现有技术还有待于改进和发展。Therefore, the existing technology needs to be improved and developed.
公开内容Public content
本公开提供一种点云属性预测方法、编码方法、解码方法及其设备,旨在解决现有技术中由于点云在属性编码找到的邻居不够相近影响了属性预测值,从而导致点云属性 编码和解码性能较差的问题。The present disclosure provides a point cloud attribute prediction method, encoding method, decoding method and equipment, and aims to solve the problem that in the prior art, the neighbors found in the attribute encoding of the point cloud are not close enough to affect the attribute prediction value, which leads to the point cloud attribute encoding And the problem of poor decoding performance.
为了解决上述技术问题,本公开所采用的技术方案如下:In order to solve the above technical problems, the technical solutions adopted in the present disclosure are as follows:
一种点云属性预测方法,其中,包括步骤:A point cloud attribute prediction method, which includes the steps:
将点云原始坐标加上一个偏移值得到新的坐标值;Add an offset value to the original coordinates of the point cloud to obtain a new coordinate value;
根据所述新的坐标值确定新的顺序;Determining a new sequence according to the new coordinate value;
根据所述新的顺序确定当前节点的属性预测值。Determine the attribute prediction value of the current node according to the new order.
所述的点云属性预测方法,其中,所述将点云原始坐标加上一个偏移值得到新的坐标值,包括:In the point cloud attribute prediction method, the adding an offset value to the original coordinates of the point cloud to obtain a new coordinate value includes:
将点云原始坐标分别加上一个偏移值,不同坐标增加的偏移值相同或不同。Add an offset value to the original coordinates of the point cloud, and the offset value added by different coordinates is the same or different.
所述的点云属性预测方法,其中,所述根据所述新的坐标值确定新的顺序,包括步骤:The point cloud attribute prediction method, wherein the determining a new sequence according to the new coordinate value includes the steps:
根据所述新的坐标值生成点云对应的莫顿码;Generating a Morton code corresponding to the point cloud according to the new coordinate value;
按照所述莫顿码排序得到偏移莫顿顺序。According to the Morton code sorting, the offset Morton order is obtained.
所述的点云属性预测方法,其中,所述根据所述新的顺序确定当前节点的属性预测值,包括步骤:The point cloud attribute prediction method, wherein the determining the attribute prediction value of the current node according to the new order includes the steps:
根据所述新的顺序确定当前节点的预测点;Determine the prediction point of the current node according to the new sequence;
根据所述预测点确定当前节点的属性预测值。Determine the attribute predicted value of the current node according to the predicted point.
所述的点云属性预测方法,其中,所述根据所述新的顺序确定当前节点的属性预测值,包括步骤:The point cloud attribute prediction method, wherein the determining the attribute prediction value of the current node according to the new order includes the steps:
根据偏移莫顿顺序向前查找第一个存在的节点作为第一预测点;According to the offset Morton order, the first existing node is searched forward as the first prediction point;
将所述第一预测点的属性值作为当前节点的属性预测值;Use the attribute value of the first prediction point as the attribute prediction value of the current node;
或者,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点,在所述K1个第一预测点找到距离当前节点距离最小的点;Or, searching forward K1 existing nodes as the first prediction point according to the offset Morton order, and finding the point with the smallest distance from the current node at the K1 first prediction points;
将所述距离最小的点的属性值作为当前节点的属性预测值或者,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点,The attribute value of the point with the smallest distance is used as the attribute prediction value of the current node, or K1 existing nodes are searched forward according to the offset Morton order as the first prediction point,
将所述K1个第一预测点的属性值加权作为当前节点的属性预测值。The attribute values of the K1 first prediction points are weighted as the attribute prediction values of the current node.
所述的点云属性预测方法,其中,所述根据所述新的顺序确定当前节点的属性预测值,包括步骤:The point cloud attribute prediction method, wherein the determining the attribute prediction value of the current node according to the new order includes the steps:
根据偏移莫顿顺序向前查找第一个存在的节点作为第一预测点;According to the offset Morton order, the first existing node is searched forward as the first prediction point;
根据点云原始坐标下的原始莫顿顺序向前查找第一个存在的节点作为第二预测点;According to the original Morton order under the original coordinates of the point cloud, the first existing node is searched forward as the second predicted point;
计算所述第一预测点到所述当前节点的距离d1;Calculating the distance d1 from the first prediction point to the current node;
计算所述第二预测点到所述当前节点的距离d2;Calculating the distance d2 from the second prediction point to the current node;
比较所述距离d1和所述距离d2,选择距离小的点作为第三预测点;Compare the distance d1 and the distance d2, and select a point with a small distance as the third prediction point;
将所述第三预测点的属性值作为所述当前节点的属性预测值;Using the attribute value of the third prediction point as the attribute prediction value of the current node;
或者,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点;根据点云原Or, search forward K1 existing nodes as the first prediction point according to the offset Morton order; according to the original point cloud
始坐标下的原始莫顿顺序向前查找K2个存在的节点作为第二预测点;The original Morton order under the initial coordinates looks forward to K2 existing nodes as the second prediction point;
计算所述第一预测点和所述第二预测点到所述当前节点的距离,选择距离小的一个点或多个点作为第三预测点;Calculating the distance from the first prediction point and the second prediction point to the current node, and selecting one or more points with a smaller distance as the third prediction point;
将所述第三预测点的属性值或属性加权值作为所述当前节点的属性预测值;Using the attribute value or attribute weighted value of the third prediction point as the attribute prediction value of the current node;
或者,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点;Or, search forward K1 existing nodes as the first prediction point according to the offset Morton order;
根据点云原始坐标下的原始莫顿顺序向前查找K2个存在的节点作为第二预测点;According to the original Morton order under the original coordinates of the point cloud, look forward to K2 existing nodes as the second predicted point;
计算所述第一预测点到所述当前节点的加权距离d1;Calculating a weighted distance d1 from the first prediction point to the current node;
计算所述第二预测点到所述当前节点的加权距离d2;Calculating a weighted distance d2 from the second prediction point to the current node;
比较所述距离d1和所述距离d2,选择距离小的点作为第三预测点;Compare the distance d1 and the distance d2, and select a point with a small distance as the third prediction point;
将所述第三预测点的属性加权值作为所述当前节点的属性预测值。The attribute weighted value of the third predicted point is used as the attribute predicted value of the current node.
所述的点云属性预测方法,其中,所述计算所述第一预测点到所述当前节点的距离的步骤包括:In the point cloud attribute prediction method, the step of calculating the distance from the first prediction point to the current node includes:
计算所述当前节点与所述第一预测点的欧式距离作为所述当前节点与所述第一预测点的距离;Calculating the Euclidean distance between the current node and the first prediction point as the distance between the current node and the first prediction point;
或者,计算在X,Y,Z三个方向上所述当前节点与所述第一预测点的坐标差值绝对值的最大值作为所述当前节点与所述第一预测点的距离;Or, calculating the maximum value of the absolute value of the coordinate difference between the current node and the first prediction point in the three directions of X, Y, and Z as the distance between the current node and the first prediction point;
或者,计算在X,Y,Z三个方向上所述当前节点与所述第一预测点坐标的差值的和作为所述当前节点与所述第一预测点的距离。Alternatively, the sum of the difference between the coordinates of the current node and the first prediction point in the X, Y, and Z directions is calculated as the distance between the current node and the first prediction point.
一种点云属性预测设备,其中,包括处理器、存储器及通信总线;所述存储器上存储有可被所述处理器执行的计算机可读程序;A point cloud attribute prediction device, which includes a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor;
所述通信总线实现处理器和存储器之间的连接通信;The communication bus realizes connection and communication between the processor and the memory;
所述处理器执行所述计算机可读程序时实现如本公开所述的点云属性预测方法中的步骤。When the processor executes the computer-readable program, the steps in the point cloud attribute prediction method as described in the present disclosure are implemented.
一种点云属性编码方法,其中,包括步骤:A point cloud attribute coding method, which includes the steps:
采用本公开所述点云属性预测方法确定当前节点的属性预测值;Using the point cloud attribute prediction method of the present disclosure to determine the attribute prediction value of the current node;
根据所述当前节点的属性值与所述当前节点的属性预测值的差值确定所述当前节点的预测残差值;Determine the predicted residual value of the current node according to the difference between the attribute value of the current node and the attribute predicted value of the current node;
对所述当前节点的预测残差值进行编码,得到点云码流。The prediction residual value of the current node is coded to obtain a point cloud code stream.
一种点云属性编码设备,其中,包括处理器、存储器及通信总线;所述存储器上存储有可被所述处理器执行的计算机可读程序;A point cloud attribute encoding device, which includes a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor;
所述通信总线实现处理器和存储器之间的连接通信;The communication bus realizes connection and communication between the processor and the memory;
所述处理器执行所述计算机可读程序时实现如本公开所述的点云属性编码方法中的步骤。When the processor executes the computer-readable program, the steps in the point cloud attribute encoding method as described in the present disclosure are implemented.
一种点云属性解码方法,其中,包括步骤:A point cloud attribute decoding method, which includes the steps:
对点云属性码流进行解码,得到当前节点的属性残差值;Decode the point cloud attribute code stream to obtain the attribute residual value of the current node;
采用本公开所述点云属性预测方法确定当前节点的属性预测值;Using the point cloud attribute prediction method of the present disclosure to determine the attribute prediction value of the current node;
根据所述当前节点的属性预测值与所述属性残差值的和值确定所述当前节点的属性值。The attribute value of the current node is determined according to the sum of the attribute prediction value of the current node and the attribute residual value.
一种点云属性解码设备,其中,包括处理器、存储器及通信总线;所述存储器上存储有可被所述处理器执行的计算机可读程序;A point cloud attribute decoding device, which includes a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor;
所述通信总线实现处理器和存储器之间的连接通信;The communication bus realizes connection and communication between the processor and the memory;
所述处理器执行所述计算机可读程序时实现如本公开所述的点云属性解码方法中的步骤。When the processor executes the computer-readable program, the steps in the point cloud attribute decoding method as described in the present disclosure are implemented.
有益效果:与现有技术相比,本公开通过采用偏移莫顿顺序来找到与当前节点在物理空间中最近的邻居点,从而确定当前节点的属性预测值,最后根据所述属性预测值进行属性编码或根据所述当前节点的属性预测值以及点云属性码流确定所述当前节点的属性值。本公开提供的点云属性预测方法、编码方法和解码方法能够提升点云的几何信息和属性信息相关性的利用,从而提高点云属性的压缩性能。Beneficial effects: Compared with the prior art, the present disclosure uses the offset Morton order to find the nearest neighbor point to the current node in the physical space, thereby determining the attribute prediction value of the current node, and finally performs the process according to the attribute prediction value. The attribute coding or the attribute value of the current node is determined according to the attribute prediction value of the current node and the point cloud attribute code stream. The point cloud attribute prediction method, encoding method, and decoding method provided by the present disclosure can improve the utilization of the geometric information and the attribute information correlation of the point cloud, thereby improving the compression performance of the point cloud attribute.
附图说明Description of the drawings
图1为本公开实施例中八叉树下对点云中节点的原始莫顿顺序示意图。FIG. 1 is a schematic diagram of the original Morton sequence of nodes in a point cloud under an octree in an embodiment of the disclosure.
图2为本公开提供的一种点云属性预测方法较佳实施例的流程图。Fig. 2 is a flowchart of a preferred embodiment of a point cloud attribute prediction method provided by the present disclosure.
图3为本公开实施例中八叉树下对点云中节点的偏移莫顿顺序示意图。FIG. 3 is a schematic diagram of the Morton sequence of offsetting nodes in the point cloud under the octree in an embodiment of the disclosure.
图4为本公开实施例中四叉树下对点云中节点的原始莫顿顺序示意图。4 is a schematic diagram of the original Morton sequence of nodes in the point cloud under the quadtree in the embodiment of the disclosure.
图5为本公开实施例中四叉树下对点云中节点的偏移莫顿顺序示意图。FIG. 5 is a schematic diagram of the Morton sequence of offsetting nodes in a point cloud under a quadtree in an embodiment of the disclosure.
图6为本公开提供的一种点云属性编码方法较佳实施例的流程图。FIG. 6 is a flowchart of a preferred embodiment of a point cloud attribute encoding method provided by the present disclosure.
图7为本公开提供的一种点云属性编码设备的结构原理图。Fig. 7 is a schematic structural diagram of a point cloud attribute encoding device provided by the present disclosure.
图8为本公开提供的一种点云属性解码方法较佳实施例的流程图。FIG. 8 is a flowchart of a preferred embodiment of a point cloud attribute decoding method provided by the present disclosure.
具体实施方式Detailed ways
本公开提供一种点云属性预测方法、编码方法、解码方法及其设备,为使本公开的目的、技术方案及效果更加清楚、明确,以下参照附图并举实施例对本公开进一步详细说明。应当理解,此处所描述的具体实施例仅用以解释本公开,并不用于限定本公开。The present disclosure provides a point cloud attribute prediction method, encoding method, decoding method, and equipment. In order to make the objectives, technical solutions, and effects of the present disclosure clearer and clearer, the present disclosure will be further described in detail below with reference to the drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present disclosure, and not used to limit the present disclosure.
本技术领域技术人员可以理解,除非特意声明,这里使用的单数形式“一”、“一个”、“所述”和“该”也可包括复数形式。应该进一步理解的是,本公开的说明书中使用的措辞“包括”是指存在所述特征、整数、步骤、操作、元件和/或组件,但是并不排除存在或添加一个或多个其他特征、整数、步骤、操作、元件、组件和/或它们的组。应该理解,当我们称元件被“连接”或“耦接”到另一元件时,它可以直接连接或耦接到其他元件,或者也可以存在中间元件。此外,这里使用的“连接”或“耦接”可以包括无线连接或无线耦接。这里使用的措辞“和/或”包括一个或更多个相关联的列出项的全部或任一单元和全部组合。Those skilled in the art can understand that, unless specifically stated, the singular forms "a", "an", "said" and "the" used herein may also include plural forms. It should be further understood that the term "comprising" used in the specification of the present disclosure refers to the presence of the described features, integers, steps, operations, elements and/or components, but does not exclude the presence or addition of one or more other features, Integers, steps, operations, elements, components, and/or groups of them. It should be understood that when we refer to an element as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element, or intervening elements may also be present. In addition, “connected” or “coupled” used herein may include wireless connection or wireless coupling. The term "and/or" as used herein includes all or any unit and all combinations of one or more associated listed items.
本技术领域技术人员可以理解,除非另外定义,这里使用的所有术语(包括技术术语和科学术语),具有与本公开所属领域中的普通技术人员的一般理解相同的意义。还应该理解的是,诸如通用字典中定义的那些术语,应该被理解为具有与现有技术的上下文中的意义一致的意义,并且除非像这里一样被特定定义,否则不会用理想化或过于正式的含义来解释。Those skilled in the art can understand that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meanings as those commonly understood by those of ordinary skill in the art to which this disclosure belongs. It should also be understood that terms such as those defined in general dictionaries should be understood to have a meaning consistent with the meaning in the context of the prior art, and unless specifically defined as here, they will not be idealized or overly Explain the formal meaning.
下面结合附图,通过对实施例的描述,对公开内容作进一步说明。In the following, the disclosure will be further explained through the description of the embodiments in conjunction with the accompanying drawings.
本发明提供了一种点云属性预测方法,其包括步骤:将点云原始坐标加上一个偏移值得到新的坐标值;根据所述新的坐标值确定新的顺序;根据所述新的顺序确定当前节 点的属性预测值。The present invention provides a point cloud attribute prediction method, which includes the steps of: adding an offset value to the original coordinates of the point cloud to obtain a new coordinate value; determining a new order according to the new coordinate value; The sequence determines the predicted value of the attributes of the current node.
在本实施例中,将点云原始坐标分别加上一个偏移值,不同坐标增加的偏移值可以相同,也可以不相同。当获取到新的顺序后,则根据所述新的顺序确定当前节点的预测点,最终根据所述预测点确定当前节点的属性预测值。In this embodiment, an offset value is added to the original coordinates of the point cloud, and the offset value added by different coordinates may be the same or different. When the new order is obtained, the prediction point of the current node is determined according to the new order, and finally the attribute prediction value of the current node is determined according to the prediction point.
在一些实施方式中,所述根据所述新的坐标值确定新的顺序,包括步骤:根据所述新的坐标值生成点云对应的莫顿码;按照所述莫顿码排序得到偏移莫顿顺序。In some embodiments, the determining a new order according to the new coordinate value includes the steps of: generating a Morton code corresponding to the point cloud according to the new coordinate value; Pause order.
具体来讲,对点云中的各个点进行莫顿排序后的莫顿顺序可具体表示为:将第k个点的位置坐标(Xk,Yk,Zk)表示为:
Figure PCTCN2021083396-appb-000001
则第k个点对应的莫顿码表示为:
Figure PCTCN2021083396-appb-000002
或者用八进制数表示每三个比特
Figure PCTCN2021083396-appb-000003
则第k个点对应的莫顿码可以表示为:
Figure PCTCN2021083396-appb-000004
图1为三维点云的局部示意图,数字代表三维点云中的莫顿顺序,假设在莫顿顺序为0、2、10、16的位置存在点,为了表达方便把这三个点用字母编号为A、B、C、D。在PCEM编码器的属性编码中,按照所述莫顿顺序点云预测点的查找方式为,查找莫顿顺序前1个点作为当前的预测点。假设当前节点为D(16),按照PCEM的查找方式,则找到莫顿顺序的前1个点C(10)作为D(16)的预测点,这样就会存在一个问题,B(2)是距离D(16)更近的点但是D(16)的预测点却是更远的C(10),使用C(10)的属性值来预测D(16)会影响点云压缩性能。
Specifically, the Morton order after Morton sorting of each point in the point cloud can be specifically expressed as: the position coordinates (Xk, Yk, Zk) of the k-th point are expressed as:
Figure PCTCN2021083396-appb-000001
Then the Morton code corresponding to the k-th point is expressed as:
Figure PCTCN2021083396-appb-000002
Or use octal numbers to represent every three bits
Figure PCTCN2021083396-appb-000003
Then the Morton code corresponding to the k-th point can be expressed as:
Figure PCTCN2021083396-appb-000004
Figure 1 is a partial schematic diagram of a three-dimensional point cloud. The numbers represent the Morton order in the three-dimensional point cloud. It is assumed that there are points in the Morton order 0, 2, 10, 16, and the three points are numbered with letters for the convenience of expression. It is A, B, C, D. In the attribute coding of the PCEM encoder, the method for searching the predicted point of the point cloud according to the Morton order is to find the first point in the Morton order as the current predicted point. Assuming that the current node is D(16), according to the PCEM search method, the first point C(10) in the Morton order is found as the predicted point of D(16), so there will be a problem, B(2) is The point closer to D(16) but the predicted point of D(16) is farther C(10). Using the attribute value of C(10) to predict D(16) will affect the point cloud compression performance.
基于上述技术所存在的问题,本公开提供了一种点云属性预测方法较佳实施例的流程图,如图2所示,其包括步骤:Based on the problems of the above-mentioned technology, the present disclosure provides a flow chart of a preferred embodiment of a point cloud attribute prediction method, as shown in FIG. 2, which includes the steps:
S1、将点云原始坐标加上一个偏移值得到新的坐标值;S1. Add an offset value to the original coordinates of the point cloud to obtain a new coordinate value;
S2、根据所述新的坐标值确定偏移莫顿顺序;S2. Determine the offset Morton order according to the new coordinate value;
S3、根据所述偏移莫顿顺序确定当前节点的属性预测值。S3. Determine the attribute prediction value of the current node according to the offset Morton order.
具体来讲,本实施例通过将点云原始坐标(x,y,z)加上一个固定的偏移值(j1,j2, j3),用新的坐标(x+j1,y+j2,z+j3)生成点云对应的莫顿码,按照莫顿排序得到偏移莫顿顺序,所述偏移值j1、j2、j3的取值为大于等于1。本实施例通过采用所述偏移莫顿顺序来找到与当前节点在物理上最近的邻居点,从而确定当前节点的属性预测值,最后根据所述属性预测值进行属性编码或根据所述当前节点的属性预测值以及点云属性码流确定所述当前节点的属性值,从而提高点云属性的编码和解码性能。Specifically, this embodiment adds a fixed offset value (j1, j2, j3) to the original point cloud coordinates (x, y, z), and uses the new coordinates (x+j1, y+j2, z). +j3) Generate the Morton code corresponding to the point cloud, and obtain the offset Morton order according to the Morton order, and the value of the offset values j1, j2, and j3 is greater than or equal to 1. This embodiment uses the offset Morton order to find the physically closest neighbor to the current node, thereby determining the attribute prediction value of the current node, and finally performing attribute encoding according to the attribute prediction value or according to the current node The attribute prediction value of and the point cloud attribute code stream determine the attribute value of the current node, thereby improving the coding and decoding performance of the point cloud attribute.
在一些具体的实施方式中,对原点云中的0、2、10、16点加上偏移值(1,1,1),得到偏移后的新点云中的7、21、29、23点,如图3所示,即A、B、C、D在原莫顿顺序下对应是编号0、2、10、16的点,在新的莫顿顺序下对应是编号7、21、29、23的点,这个新的莫顿顺序叫做偏移莫顿顺序。In some specific implementations, the offset value (1, 1, 1) is added to the 0, 2, 10, and 16 points in the origin point cloud to obtain 7, 21, 29, and 29 in the new offset point cloud. 23 points, as shown in Figure 3, that is, A, B, C, and D correspond to the points numbered 0, 2, 10, 16 in the original Morton order, and correspond to the points numbered 7, 21, 29 in the new Morton order. , 23, this new Morton order is called the offset Morton order.
在一些实施方式中,根据偏移莫顿顺序向前查找第一个存在的节点作为第一预测点;将所述第一预测点的属性值作为当前节点的属性预测值。In some embodiments, the first existing node is searched forward as the first prediction point according to the offset Morton order; the attribute value of the first prediction point is used as the attribute prediction value of the current node.
作为举例,按偏移莫顿顺序向前找到第一个存在的点的作为预测点,在如图3所示的偏移莫顿顺序中,当前节点D(23)查找偏移莫顿顺序下前1个点作为预测点,找到的预测点是B(21),使用B(21)的作为当前节点D(23)的预测点。As an example, according to the offset Morton order to find the first existing point as the predicted point, in the offset Morton order shown in Figure 3, the current node D (23) looks for the offset Morton order The first point is used as the predicted point, the predicted point found is B(21), and B(21) is used as the predicted point of the current node D(23).
在一些实施方式中,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点,在所述K1个第一预测点找到距离当前节点距离最小的点;将所述距离最小的点的属性值作为当前节点的属性预测值。In some embodiments, K1 existing nodes are searched forward as the first prediction point according to the offset Morton order, and the point with the smallest distance from the current node is found at the K1 first prediction points; The attribute value of the point is used as the attribute predicted value of the current node.
作为举例,假设K1设为2,在如图3所示的偏移莫顿顺序中,当前节点D(23)查找偏移莫顿顺序下前2个点作为预测点,找到的预测点是B(21)、A(7),当前节点D(23)和B(21)的一阶距离为1,当前节点D(23)和A(7)的一阶距离为2,选择距离较小的B(21)作为当前节点D(23)的预测点。As an example, suppose K1 is set to 2. In the offset Morton order shown in Figure 3, the current node D (23) looks for the first 2 points in the offset Morton order as prediction points, and the predicted point found is B (21), A(7), the first-order distance of the current nodes D(23) and B(21) is 1, and the first-order distance of the current nodes D(23) and A(7) is 2, choose the smaller distance B(21) is used as the prediction point of the current node D(23).
在一些实施方式中,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点,将所述K1个第一预测点的属性值加权作为当前节点的属性预测值。In some embodiments, K1 existing nodes are searched forward as the first prediction point according to the offset Morton order, and the attribute values of the K1 first prediction points are weighted as the attribute prediction value of the current node.
作为举例,假设K1设为2,在如图3所示的偏移莫顿顺序中,当前节点D(23)查找偏移莫顿顺序下前2个点作为预测点,找到的预测点是B(21)、A(7),使用B(21)和A(7)的属性值的均值作为当前节点D(23)的预测值。As an example, suppose K1 is set to 2. In the offset Morton order shown in Figure 3, the current node D (23) looks for the first 2 points in the offset Morton order as prediction points, and the predicted point found is B (21), A(7), use the average of the attribute values of B(21) and A(7) as the predicted value of the current node D(23).
在一些实施方式中,根据偏移莫顿顺序向前查找第一个存在的节点作为第一预测点;根据点云原始坐标下的原始莫顿顺序向前查找第一个存在的节点作为第二预测点;计算所述第一预测点到所述当前节点的距离d1;计算所述第二预测点到所述当前节点的距离 d2;比较所述距离d1和所述距离d2,选择距离小的点作为第三预测点;将所述第三预测点的属性值作为所述当前节点的属性预测值。In some embodiments, the first existing node is searched forward according to the offset Morton order as the first prediction point; the first existing node is searched forward according to the original Morton order under the original coordinates of the point cloud as the second prediction point. Prediction point; calculate the distance d1 from the first prediction point to the current node; calculate the distance d2 from the second prediction point to the current node; compare the distance d1 and the distance d2, and select the smaller distance Point as the third predicted point; use the attribute value of the third predicted point as the attribute predicted value of the current node.
作为举例,在如图1所示的原始莫顿顺序中查找当前节点D(16)的第一个存在的节点,找到的点是C(10),把C(10)作为预测点1,一阶距离为3。在如图3所示的偏移莫顿顺序查找当前节点D(23)的第一个存在的点,当前节点D(23)查找莫顿顺序下前1个点作为预测点,找到的预测点是B(21),把B(21)作为预测点2,一阶距离为1。对比预测点1和预测点2到当前节点的距离,选择距离较小的预测点2作为当前节点D(23)的预测点,使用预测点2的属性值对当前节点进行属性预测。As an example, look for the first existing node of the current node D(16) in the original Morton order as shown in Figure 1. The found point is C(10), and C(10) is used as the predicted point 1. The order distance is 3. Find the first existing point of the current node D (23) in the offset Morton order shown in Figure 3, and the current node D (23) finds the first point in the Morton order as the predicted point, and the predicted point found It is B(21), using B(21) as the predicted point 2, and the first-order distance is 1. Compare the distance between predicted point 1 and predicted point 2 to the current node, select predicted point 2 with a smaller distance as the predicted point of current node D (23), and use the attribute value of predicted point 2 to perform attribute prediction on the current node.
在一些实施方式中,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点;根据点云原始坐标下的原始莫顿顺序向前查找K2个存在的节点作为第二预测点;计算所述第一预测点和所述第二预测点到所述当前节点的距离,选择距离小的点作为第三预测点;将所述第三预测点的属性值作为所述当前节点的属性预测值。In some embodiments, K1 existing nodes are searched forward as the first prediction point according to the offset Morton order; K2 existing nodes are searched forward as the second prediction point according to the original Morton order under the original coordinates of the point cloud Calculate the distance between the first prediction point and the second prediction point to the current node, and select the point with a small distance as the third prediction point; use the attribute value of the third prediction point as the current node The predicted value of the attribute.
作为举例,按如图3所示的偏移莫顿顺序向前找到K1个存在的点,按如图1所示原始莫顿顺序向前找到K2个存在的点,从K1+K2中选择与当前点距离最小的点作为预测点。在本实例中设置K1为2、K2为2,在原莫顿顺序中,当前点D(16)查找原莫顿顺序下前2个点作为预测点,找到的预测点是C(10)、B(2)。在偏移莫顿顺序中,当前点D(23)查找偏移莫顿顺序下前2个点作为预测点,找到的预测点是B(21)、A(7)。两个莫顿顺序中找到的点的合集为A、B、C,与当前点D的一阶距离分别为2、1、4,选择距离最小的B作为当前点D的预测点。As an example, find K1 existing points forward in the offset Morton order as shown in Figure 3, find K2 existing points forward in the original Morton order as shown in Figure 1, and choose from K1+K2 and The point with the smallest distance from the current point is used as the predicted point. In this example, set K1 to 2 and K2 to 2. In the original Morton order, the current point D(16) looks for the first 2 points in the original Morton order as prediction points, and the predicted points found are C(10), B (2). In the offset Morton order, the current point D(23) looks for the first 2 points in the offset Morton order as the predicted points, and the predicted points found are B(21) and A(7). The set of points found in the two Morton sequences is A, B, and C. The first-order distances from the current point D are 2, 1, and 4 respectively. The B with the smallest distance is selected as the predicted point of the current point D.
在一些实施方式中,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点;根据点云原始坐标下的原始莫顿顺序向前查找K2个存在的节点作为第二预测点;计算所述第一预测点到所述当前节点的加权距离d1;计算所述第二预测点到所述当前节点的加权距离d2;比较所述距离d1和所述距离d2,选择距离小的点作为第三预测点;将所述第三预测点的属性加权值作为所述当前节点的属性预测值。In some embodiments, K1 existing nodes are searched forward as the first prediction point according to the offset Morton order; K2 existing nodes are searched forward as the second prediction point according to the original Morton order under the original coordinates of the point cloud Calculate the weighted distance d1 from the first predicted point to the current node; calculate the weighted distance d2 from the second predicted point to the current node; compare the distance d1 and the distance d2, and select the smaller distance Point as the third predicted point; use the attribute weighted value of the third predicted point as the attribute predicted value of the current node.
作为举例,按如图3所示的偏移莫顿顺序向前找到K1个存在的点,按如图1所示的原始莫顿顺序向前找到K2个存在的点,分别计算K1个点到当前点的加权距离及K2个点到当前点的加权距离,从中选择距离较小的K1个点或K2个点作为预测点,其属性加权值作为预测值。在本实例中K1设置为2,K2设置为2,距离加权方式为均值。在原莫顿顺序中,当前点D(16)查找原莫顿顺序下前2个点作为预测点,找到的预测 点是C(10)、B(2),距离当前点D(16)的一阶距离为4、1,距离的均值为2.5。在偏移莫顿顺序中,当前点D(23)查找偏移莫顿顺序下前2个点作为预测点,找到的预测点是B(21)、A(7)距离当前点D(16)的一阶距离为1、2,距离的均值为1.5。选择加权距离较小的偏移莫顿顺序的B(21)、A(7)作为预测点,B(21)、A(7)的属性加权值作为预测值。As an example, find K1 existing points forward in the offset Morton order shown in Figure 3, find K2 existing points forward in the original Morton order shown in Figure 1, and calculate K1 points to The weighted distance of the current point and the weighted distance of K2 points to the current point, from which K1 points or K2 points with a smaller distance are selected as predicted points, and their attribute weighted values are used as predicted values. In this example, K1 is set to 2, K2 is set to 2, and the distance weighting method is the mean value. In the original Morton order, the current point D(16) finds the first 2 points in the original Morton order as the predicted points. The predicted points found are C(10), B(2), one distance from the current point D(16) The order distance is 4, 1, and the average value of the distance is 2.5. In the offset Morton order, the current point D(23) looks for the first 2 points in the offset Morton order as the predicted points, and the predicted points found are B(21), A(7) and the current point D(16) The first-order distance of is 1, 2, and the average value of the distance is 1.5. Select B(21) and A(7) in the offset Morton order with the smaller weighting distance as the predicted point, and the attribute weighted value of B(21) and A(7) as the predicted value.
在一些实施方式中,按偏移莫顿顺序向前找到K1个存在的点,按原始莫顿顺序向前找到K2个存在的点,从K1+K2个点选择其中距离最近的KX个点作为预测点,KX个属性加权值作为预测值。在本实例中K1设置为2,K2设置为2,KX设置为2,距离加权方式为均值。在原莫顿顺序中,当前点D(23)查找原莫顿顺序下前2个点作为预测点,找到的预测点是C(10)、B(2)。在偏移莫顿顺序中,当前点D(23)查找偏移莫顿顺序下前2个点作为预测点,找到的预测点是B(21)、A(7)。两个莫顿顺序中找到的点的合集为A、B、C,与当前点D的一阶距离分别为2、1、4,选择一阶距离较小的2个点A、B作为作为当前点D的预测点,A、B的属性加权值作为预测值。In some embodiments, K1 existing points are found forward in the offset Morton order, K2 existing points are found forward in the original Morton order, and the KX points with the closest distance are selected from the K1+K2 points as For predicted points, KX attribute weighted values are used as predicted values. In this example, K1 is set to 2, K2 is set to 2, KX is set to 2, and the distance weighting method is average. In the original Morton order, the current point D(23) finds the first 2 points in the original Morton order as prediction points, and the predicted points found are C(10) and B(2). In the offset Morton order, the current point D(23) looks for the first 2 points in the offset Morton order as the predicted points, and the predicted points found are B(21) and A(7). The collection of the points found in the two Morton sequences is A, B, C, and the first-order distances from the current point D are 2, 1, and 4 respectively. The two points A and B with the smaller first-order distance are selected as the current The predicted point of point D, the attribute weighted value of A and B are used as the predicted value.
在一些实施方式中,所述计算所述第一预测点到所述当前节点的距离的步骤包括:计算所述当前节点与所述第一预测点的欧式距离作为所述当前节点与所述第一预测点的距离;或者,计算在X,Y,Z三个方向上所述当前节点与所述第一预测点的坐标差值绝对值的最大值作为所述当前节点与所述第一预测点的距离;或者,计算在X,Y,Z三个方向上所述当前节点与所述第一预测点坐标的差值的和作为所述当前节点与所述第一预测点的距离。In some embodiments, the step of calculating the distance between the first prediction point and the current node includes: calculating the Euclidean distance between the current node and the first prediction point as the current node and the first prediction point. The distance between a predicted point; or, calculate the maximum absolute value of the coordinate difference between the current node and the first predicted point in the X, Y, and Z directions as the current node and the first predicted The distance of the point; or, the sum of the difference between the coordinates of the current node and the first predicted point in the X, Y, and Z directions is calculated as the distance between the current node and the first predicted point.
在一些实施方式中,在四叉树情况下,在如图4所示的原始莫顿顺序中,该点云共有5个点,分别的莫顿编号8、14、19、24、25,为了表达方便把这些点称为A、B、C、D、E。在原始莫顿顺序中,当前点E(25)找到的前一个莫顿顺序预测点是D(24),D(24)与当前点E(25)的一阶距离为4,D(24)为第一预测点。把图4的点的坐标加上偏移量(1,1)后得到图5的点,形成偏移莫顿顺序,A、B、C、D、E在图5中对应偏移莫顿顺序的编号为25、27、26、30、28的点,接下来从偏移莫顿顺序中查找当前点E(28)的预测点,按照偏移莫顿顺序依次查找B(27),C(26),A(25)找到的前一个莫顿顺序预测点是B(27),与当前点的的一阶距离为1,B(27)作为第二预测点。按照找最近的预测点的原则,选择距离最近的B(27)为当前点的预测点,比在原莫顿顺序中查找到的预测点D(24)要近,因此选择点B作为当前点E的预测点。In some embodiments, in the case of a quadtree, in the original Morton sequence as shown in FIG. 4, the point cloud has a total of 5 points, respectively Morton numbers 8, 14, 19, 24, 25, in order to It is convenient to express these points as A, B, C, D, E. In the original Morton order, the previous Morton order prediction point found at the current point E(25) is D(24), the first-order distance between D(24) and the current point E(25) is 4, D(24) For the first prediction point. Add the coordinates of the point in Figure 4 to the offset (1, 1) to obtain the point in Figure 5, which forms the offset Morton sequence. A, B, C, D, and E correspond to the offset Morton sequence in Figure 5 The points numbered 25, 27, 26, 30, 28 are then searched for the predicted point of the current point E(28) from the offset Morton order, and then B(27), C( 26). The previous Morton order prediction point found by A(25) is B(27), the first-order distance from the current point is 1, and B(27) is used as the second prediction point. According to the principle of finding the nearest predicted point, select the nearest B(27) as the predicted point of the current point, which is closer than the predicted point D(24) found in the original Morton order, so point B is selected as the current point E Point of prediction.
在一些实施方式中,还提供一种点云属性预测设备,其中,包括处理器、存储器及 通信总线;所述存储器上存储有可被所述处理器执行的计算机可读程序;所述通信总线实现处理器和存储器之间的连接通信;所述处理器执行所述计算机可读程序时实现如本公开所述的点云属性预测方法中的步骤。In some embodiments, a point cloud attribute prediction device is also provided, which includes a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor; the communication bus The connection and communication between the processor and the memory are realized; when the processor executes the computer-readable program, the steps in the point cloud attribute prediction method as described in the present disclosure are realized.
在一些实施方式中,还提供一种点云属性编码方法,如图6所示,其包括步骤:In some embodiments, a point cloud attribute coding method is also provided, as shown in FIG. 6, which includes the steps:
S10、采用所述点云属性预测方法确定当前节点的属性预测值;S10. Using the point cloud attribute prediction method to determine the attribute prediction value of the current node;
S20、根据所述当前节点的属性值与所述当前节点的属性预测值的差值确定所述当前节点的预测残差值;S20: Determine the predicted residual value of the current node according to the difference between the attribute value of the current node and the predicted attribute value of the current node;
S30、对所述当前节点的预测残差值进行编码,得到点云码流。S30. Encode the prediction residual value of the current node to obtain a point cloud code stream.
本实施例通过采用偏移莫顿顺序来找到与当前节点在物理上最近的邻居点,从而确定当前节点的属性预测值,最后根据所述属性预测值进行属性编码。本实施例提供的点云属性编码方法能够提升点云的几何信息和属性信息相关性的利用,从而提高点云属性的编码和解码性能。In this embodiment, an offset Morton order is used to find the physically nearest neighbor to the current node, thereby determining the attribute prediction value of the current node, and finally performing attribute encoding according to the attribute prediction value. The point cloud attribute coding method provided in this embodiment can improve the utilization of the geometric information and the attribute information correlation of the point cloud, thereby improving the coding and decoding performance of the point cloud attribute.
基于上述点云属性编码方法,本公开还提供一种点云属性编码设备,其中,如图7所示,其包括至少一个处理器(processor)20;显示屏21;以及存储器(memory)22,还可以包括通信接口(Communications Interface)23和总线24。其中,处理器20、显示屏21、存储器22和通信接口23可以通过总线24完成相互间的通信。显示屏21设置为显示初始设置模式中预设的用户引导界面。通信接口23可以传输信息。处理器20可以调用存储器22中的逻辑指令,以执行上述实施例中的方法。Based on the above point cloud attribute encoding method, the present disclosure also provides a point cloud attribute encoding device, where, as shown in FIG. 7, it includes at least one processor (processor) 20; a display screen 21; and a memory (memory) 22, It may also include a communication interface (Communications Interface) 23 and a bus 24. Among them, the processor 20, the display screen 21, the memory 22, and the communication interface 23 can communicate with each other through the bus 24. The display screen 21 is set to display a user guide interface preset in the initial setting mode. The communication interface 23 can transmit information. The processor 20 can call the logic instructions in the memory 22 to execute the method in the foregoing embodiment.
此外,上述的存储器22中的逻辑指令可以通过软件功能单元的形式实现并作为独立的产品销售或使用时,可以存储在一个计算机可读取存储介质中。In addition, the aforementioned logic instructions in the memory 22 can be implemented in the form of software functional units and when sold or used as independent products, they can be stored in a computer readable storage medium.
存储器22作为一种计算机可读存储介质,可设置为存储软件程序、计算机可执行程序,如本公开实施例中的方法对应的程序指令或模块。处理器20通过运行存储在存储器22中的软件程序、指令或模块,从而执行功能应用以及数据处理,即实现上述实施例中的方法。As a computer-readable storage medium, the memory 22 can be configured to store software programs and computer-executable programs, such as program instructions or modules corresponding to the methods in the embodiments of the present disclosure. The processor 20 executes functional applications and data processing by running software programs, instructions, or modules stored in the memory 22, that is, implements the methods in the foregoing embodiments.
存储器22可包括存储程序区和存储数据区,其中,存储程序区可存储操作系统、至少一个功能所需的应用程序;存储数据区可存储根据电子设备的使用所创建的数据等。此外,存储器22可以包括高速随机存取存储器,还可以包括非易失性存储器。例如,U盘、移动硬盘、只读存储器(Read-Only Memory,ROM)、随机存取存储器(Random Access Memory,RAM)、磁碟或者光盘等多种可以存储程序代码的介质,也可以是暂态存储介 质。The memory 22 may include a program storage area and a data storage area, where the program storage area may store an operating system and an application program required by at least one function; the data storage area may store data created according to the use of the electronic device, and the like. In addition, the memory 22 may include a high-speed random access memory, and may also include a non-volatile memory. For example, U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or CD-ROM and other media that can store program code, or temporary State storage medium.
此外,上述存储介质以及点云属性编码设备中的多条指令处理器加载并执行的具体过程在上述方法中已经详细说明,在这里就不再一一陈述。In addition, the specific process of loading and executing the multiple instruction processors in the foregoing storage medium and the point cloud attribute encoding device has been described in detail in the foregoing method, and will not be described here.
在一些实施方式中,还提供一种点云属性解码方法,如图8所示,其包括步骤:In some embodiments, a point cloud attribute decoding method is also provided, as shown in FIG. 8, which includes the steps:
S100、对点云属性码流进行解码,得到当前节点的属性残差值;S100. Decode the point cloud attribute code stream to obtain the attribute residual value of the current node;
S200、采用本公开所述点云属性预测方法确定当前节点的属性预测值;S200. Use the point cloud attribute prediction method described in the present disclosure to determine the attribute prediction value of the current node;
S300、根据所述当前节点的属性预测值与所述属性残差值的和值确定所述当前节点的属性值。S300. Determine the attribute value of the current node according to the sum of the attribute prediction value of the current node and the attribute residual value.
本实施例通过采用偏移莫顿顺序来找到与当前节点在物理上最近的邻居点,从而确定当前节点的属性预测值,最后根据所述当前节点的属性预测值以及点云属性码流确定所述当前节点的属性值。本公开提供的点云属性解码方法能够提升点云的几何信息和属性信息相关性的利用,从而提高点云属性解码性能。This embodiment uses the offset Morton order to find the physically closest neighbor to the current node, thereby determining the attribute predicted value of the current node, and finally determines the location based on the attribute predicted value of the current node and the point cloud attribute code stream. Describe the attribute value of the current node. The point cloud attribute decoding method provided by the present disclosure can improve the utilization of the geometric information of the point cloud and the correlation of the attribute information, thereby improving the point cloud attribute decoding performance.
基于上述点云属性解码方法,本公开还提供一种点云属性解码设备,其中,包括处理器、存储器及通信总线;所述存储器上存储有可被所述处理器执行的计算机可读程序;所述通信总线实现处理器和存储器之间的连接通信;所述处理器执行所述计算机可读程序时实现如本公开所述的点云属性解码方法中的步骤。Based on the foregoing point cloud attribute decoding method, the present disclosure also provides a point cloud attribute decoding device, which includes a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor; The communication bus realizes the connection and communication between the processor and the memory; when the processor executes the computer-readable program, the steps in the point cloud attribute decoding method as described in the present disclosure are realized.
在一些实施方式中,将本公开提供的点云属性编码方法及解码方法用于点云压缩得到的结果与测试平台PCEM的基准结果进行比较得到的数据如表1-表4所示,使用偏移量为(3,3,3),搜索范围为N=8,M=8:In some embodiments, the point cloud attribute encoding method and decoding method provided in the present disclosure are used to compare the results obtained by point cloud compression with the benchmark results of the test platform PCEM. The shift amount is (3, 3, 3), the search range is N=8, M=8:
表1为在有限损几何、有损属性条件下的亮度、色度以及反射率的率失真数据对比表Table 1 is a comparison table of rate-distortion data of brightness, chromaticity and reflectance under the condition of finite loss geometry and lossy attributes
Figure PCTCN2021083396-appb-000005
Figure PCTCN2021083396-appb-000005
表2为在无损几何、有损属性条件下的亮度、色度以及反射率的率失真数据对比表Table 2 is a comparison table of rate-distortion data of brightness, chromaticity, and reflectivity under lossless geometry and lossy attribute conditions
Figure PCTCN2021083396-appb-000006
Figure PCTCN2021083396-appb-000006
表3为在无损几何、有限损属性条件下的亮度、色度以及反射率的率失真数据对比表Table 3 is a comparison table of rate-distortion data of luminance, chromaticity, and reflectivity under the condition of lossless geometry and limited loss properties
Figure PCTCN2021083396-appb-000007
Figure PCTCN2021083396-appb-000007
表4为在无损几何、无损属性条件下的亮度、色度以及反射率的率失真数据对比表Table 4 is a comparison table of rate-distortion data of luminance, chromaticity, and reflectivity under the condition of lossless geometry and lossless attributes
Figure PCTCN2021083396-appb-000008
Figure PCTCN2021083396-appb-000008
从表1-表4中的数据可以看出,相比与测试平台PCEM的基准结果,对于反射率属性,在有限损几何、有损属性条件,无损几何、有损属性条件,无损几何、有限损属性条件下,本公开的端到端率失真分别节约了8.5%、5.0%和5.5%;对于亮度属性,在无损几何、无损属性条件下码流大小为原来的94.7%,在有限损几何、有损属性条件,无损几何、有损属性条件,无损几何、有限损属性条件下,本公开的端到端率失真分别节约了4.9%、3.2%和6.9%,在无损几何、无损属性条件下码流大小为原来的 90%;对于色度属性,在有限损几何、有损属性条件,无损几何、有损属性条件,无损几何、有限损属性条件下,本公开的端到端率失真最高分别节约了5.2%、4.0%、6.9%。From the data in Table 1 to Table 4, it can be seen that compared with the benchmark results of the test platform PCEM, for the reflectivity properties, in the condition of finite loss geometry, lossy attribute, lossless geometry, lossy attribute condition, lossless geometry, finite Under the condition of loss attribute, the end-to-end rate distortion of the present disclosure saves 8.5%, 5.0%, and 5.5% respectively; for the brightness attribute, the code stream size is 94.7% of the original under the condition of lossless geometry and lossless attribute. , Lossy attribute conditions, lossless geometry, lossy attribute conditions, lossless geometry, finite loss attribute conditions, the end-to-end rate distortion of the present disclosure saves 4.9%, 3.2%, and 6.9%, respectively, in the lossless geometry, lossless attribute conditions The size of the lower code stream is 90% of the original; for the chrominance attribute, the end-to-end rate distortion of the present disclosure is under the condition of finite loss geometry, lossy attribute condition, lossless geometry, lossy attribute condition, lossless geometry, finite loss attribute condition The highest savings were 5.2%, 4.0%, and 6.9%.
综上所述,本公开通过采用偏移莫顿顺序来找到与当前节点在物理空间中最近的邻居点,从而确定当前节点的属性预测值,最后根据所述属性预测值进行属性编码或根据所述当前节点的属性预测值以及点云属性码流确定所述当前节点的属性值。本公开提供的点云属性预测方法、编码方法和解码方法能够提升点云的几何信息和属性信息相关性的利用,从而提高点云属性的压缩性能。In summary, the present disclosure uses the offset Morton order to find the nearest neighbor point to the current node in the physical space, thereby determining the attribute prediction value of the current node, and finally performing attribute encoding or according to the attribute prediction value. The attribute prediction value of the current node and the point cloud attribute code stream determine the attribute value of the current node. The point cloud attribute prediction method, encoding method, and decoding method provided by the present disclosure can improve the utilization of the geometric information and the attribute information correlation of the point cloud, thereby improving the compression performance of the point cloud attribute.
最后应说明的是:以上实施例仅用以说明本公开的技术方案,而非对其限制;尽管参照前述实施例对本公开进行了详细的说明,本领域的普通技术人员应当理解:其依然可以对前述各实施例所记载的技术方案进行修改,或者对其中部分技术特征进行等同替换;而这些修改或者替换,并不使相应技术方案的本质脱离本公开各实施例技术方案的精神和范围。Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present disclosure, not to limit them; although the present disclosure has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: The technical solutions recorded in the foregoing embodiments are modified, or some of the technical features are equivalently replaced; these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present disclosure.

Claims (12)

  1. 一种点云属性预测方法,其特征在于,包括步骤:A point cloud attribute prediction method is characterized in that it comprises the steps:
    将点云原始坐标加上一个偏移值得到新的坐标值;Add an offset value to the original coordinates of the point cloud to obtain a new coordinate value;
    根据所述新的坐标值确定新的顺序;Determining a new sequence according to the new coordinate value;
    根据所述新的顺序确定当前节点的属性预测值。Determine the attribute prediction value of the current node according to the new order.
  2. 根据权利要求1所述的点云属性预测方法,其特征在于,所述将点云原始坐标加上一个偏移值得到新的坐标值,包括:The point cloud attribute prediction method according to claim 1, wherein the adding an offset value to the original coordinates of the point cloud to obtain a new coordinate value comprises:
    将点云原始坐标分别加上一个偏移值,不同坐标增加的偏移值相同或不同。Add an offset value to the original coordinates of the point cloud, and the offset value added by different coordinates is the same or different.
  3. 根据权利要求1所述的点云属性预测方法,其特征在于,所述根据所述新的坐标值确定新的顺序,包括步骤:The point cloud attribute prediction method according to claim 1, wherein the determining a new order according to the new coordinate value comprises the steps of:
    根据所述新的坐标值生成点云对应的莫顿码;Generating a Morton code corresponding to the point cloud according to the new coordinate value;
    按照所述莫顿码排序得到偏移莫顿顺序。According to the Morton code sorting, the offset Morton order is obtained.
  4. 根据权利要求1所述的点云属性预测方法,其特征在于,所述根据所述新的顺序确定当前节点的属性预测值,包括步骤:The point cloud attribute prediction method according to claim 1, wherein the determining the attribute prediction value of the current node according to the new sequence comprises the steps of:
    根据所述新的顺序确定当前节点的预测点;Determine the prediction point of the current node according to the new sequence;
    根据所述预测点确定当前节点的属性预测值。Determine the attribute predicted value of the current node according to the predicted point.
  5. 根据权利要求1或3所述的点云属性预测方法,其特征在于,所述根据所述新的顺序确定当前节点的属性预测值,包括步骤:The point cloud attribute prediction method according to claim 1 or 3, wherein the determining the attribute prediction value of the current node according to the new order comprises the steps of:
    根据偏移莫顿顺序向前查找第一个存在的节点作为第一预测点;According to the offset Morton order, the first existing node is searched forward as the first prediction point;
    将所述第一预测点的属性值作为当前节点的属性预测值;Use the attribute value of the first prediction point as the attribute prediction value of the current node;
    或者,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点,在所述K1个第一预测点找到距离当前节点距离最小的点;Or, searching forward K1 existing nodes as the first prediction point according to the offset Morton order, and finding the point with the smallest distance from the current node at the K1 first prediction points;
    将所述距离最小的点的属性值作为当前节点的属性预测值或者,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点,The attribute value of the point with the smallest distance is used as the attribute prediction value of the current node, or K1 existing nodes are searched forward according to the offset Morton order as the first prediction point,
    将所述K1个第一预测点的属性值加权作为当前节点的属性预测值。The attribute values of the K1 first prediction points are weighted as the attribute prediction values of the current node.
  6. 根据权利要求1或3所述的点云属性预测方法,其特征在于,所述根据所述新的顺序确定当前节点的属性预测值,包括步骤:The point cloud attribute prediction method according to claim 1 or 3, wherein the determining the attribute prediction value of the current node according to the new order comprises the steps of:
    根据偏移莫顿顺序向前查找第一个存在的节点作为第一预测点;According to the offset Morton order, the first existing node is searched forward as the first prediction point;
    根据点云原始坐标下的原始莫顿顺序向前查找第一个存在的节点作为第二预测点;According to the original Morton order under the original coordinates of the point cloud, the first existing node is searched forward as the second predicted point;
    计算所述第一预测点到所述当前节点的距离d1;Calculating the distance d1 from the first prediction point to the current node;
    计算所述第二预测点到所述当前节点的距离d2;Calculating the distance d2 from the second prediction point to the current node;
    比较所述距离d1和所述距离d2,选择距离小的点作为第三预测点;Compare the distance d1 and the distance d2, and select a point with a small distance as the third prediction point;
    将所述第三预测点的属性值作为所述当前节点的属性预测值;Using the attribute value of the third prediction point as the attribute prediction value of the current node;
    或者,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点;根据点云原始坐标下的原始莫顿顺序向前查找K2个存在的节点作为第二预测点;Or, search forward K1 existing nodes as the first prediction point according to the offset Morton order; search forward K2 existing nodes as the second prediction point according to the original Morton order under the original coordinates of the point cloud;
    计算所述第一预测点和所述第二预测点到所述当前节点的距离,选择距离小的一个点或多个点作为第三预测点;Calculating the distance from the first prediction point and the second prediction point to the current node, and selecting one or more points with a smaller distance as the third prediction point;
    将所述第三预测点的属性值或属性加权值作为所述当前节点的属性预测值;Using the attribute value or attribute weighted value of the third prediction point as the attribute prediction value of the current node;
    或者,根据偏移莫顿顺序向前查找K1个存在的节点作为第一预测点;Or, search forward K1 existing nodes as the first prediction point according to the offset Morton order;
    根据点云原始坐标下的原始莫顿顺序向前查找K2个存在的节点作为第二预测点;According to the original Morton order under the original coordinates of the point cloud, look forward to K2 existing nodes as the second predicted point;
    计算所述第一预测点到所述当前节点的加权距离d1;Calculating a weighted distance d1 from the first prediction point to the current node;
    计算所述第二预测点到所述当前节点的加权距离d2;Calculating a weighted distance d2 from the second prediction point to the current node;
    比较所述距离d1和所述距离d2,选择距离小的点作为第三预测点;Compare the distance d1 and the distance d2, and select a point with a small distance as the third prediction point;
    将所述第三预测点的属性加权值作为所述当前节点的属性预测值。The attribute weighted value of the third predicted point is used as the attribute predicted value of the current node.
  7. 根据权利要求6所述的点云属性预测方法,其特征在于,所述计算所述第一预测点到所述当前节点的距离的步骤包括:The point cloud attribute prediction method according to claim 6, wherein the step of calculating the distance from the first prediction point to the current node comprises:
    计算所述当前节点与所述第一预测点的欧式距离作为所述当前节点与所述第一预测点的距离;Calculating the Euclidean distance between the current node and the first prediction point as the distance between the current node and the first prediction point;
    或者,计算在X,Y,Z三个方向上所述当前节点与所述第一预测点的坐标差值绝对值的最大值作为所述当前节点与所述第一预测点的距离;Or, calculating the maximum value of the absolute value of the coordinate difference between the current node and the first prediction point in the three directions of X, Y, and Z as the distance between the current node and the first prediction point;
    或者,计算在X,Y,Z三个方向上所述当前节点与所述第一预测点坐标的差值的和作为所述当前节点与所述第一预测点的距离。Alternatively, the sum of the difference between the coordinates of the current node and the first prediction point in the X, Y, and Z directions is calculated as the distance between the current node and the first prediction point.
  8. 一种点云属性预测设备,其特征在于,包括处理器、存储器及通信总线;所述存储器上存储有可被所述处理器执行的计算机可读程序;A point cloud attribute prediction device, which is characterized by comprising a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor;
    所述通信总线实现处理器和存储器之间的连接通信;The communication bus realizes connection and communication between the processor and the memory;
    所述处理器执行所述计算机可读程序时实现如权利要求1-7任意一项所述的点云属性预测方法中的步骤。When the processor executes the computer-readable program, the steps in the point cloud attribute prediction method according to any one of claims 1-7 are realized.
  9. 一种点云属性编码方法,其特征在于,包括步骤:A point cloud attribute coding method, which is characterized in that it comprises the steps:
    采用权利要求1-7任一所述点云属性预测方法确定当前节点的属性预测值;Using the point cloud attribute prediction method of any one of claims 1-7 to determine the attribute prediction value of the current node;
    根据所述当前节点的属性值与所述当前节点的属性预测值的差值确定所述当前节点的预测残差值;Determine the predicted residual value of the current node according to the difference between the attribute value of the current node and the attribute predicted value of the current node;
    对所述当前节点的预测残差值进行编码,得到点云码流。The prediction residual value of the current node is coded to obtain a point cloud code stream.
  10. 一种点云属性编码设备,其特征在于,包括处理器、存储器及通信总线;所述存储器上存储有可被所述处理器执行的计算机可读程序;A point cloud attribute encoding device, which is characterized by comprising a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor;
    所述通信总线实现处理器和存储器之间的连接通信;The communication bus realizes connection and communication between the processor and the memory;
    所述处理器执行所述计算机可读程序时实现如权利要求9所述的点云属性编码方法中的步骤。When the processor executes the computer-readable program, the steps in the point cloud attribute encoding method according to claim 9 are implemented.
  11. 一种点云属性解码方法,其特征在于,包括步骤:A point cloud attribute decoding method, which is characterized in that it comprises the steps:
    对点云属性码流进行解码,得到当前节点的属性残差值;Decode the point cloud attribute code stream to obtain the attribute residual value of the current node;
    采用权利要求1-7任一所述点云属性预测方法确定当前节点的属性预测值;Using the point cloud attribute prediction method of any one of claims 1-7 to determine the attribute prediction value of the current node;
    根据所述当前节点的属性预测值与所述属性残差值的和值确定所述当前节点的属性值。The attribute value of the current node is determined according to the sum of the attribute prediction value of the current node and the attribute residual value.
  12. 一种点云属性解码设备,其特征在于,包括处理器、存储器及通信总线;所述存储器上存储有可被所述处理器执行的计算机可读程序;A point cloud attribute decoding device, characterized by comprising a processor, a memory, and a communication bus; the memory stores a computer readable program that can be executed by the processor;
    所述通信总线实现处理器和存储器之间的连接通信;The communication bus realizes connection and communication between the processor and the memory;
    所述处理器执行所述计算机可读程序时实现如权利要求11所述的点云属性解码方法中的步骤。When the processor executes the computer-readable program, the steps in the point cloud attribute decoding method according to claim 11 are implemented.
PCT/CN2021/083396 2020-03-30 2021-03-26 Point cloud attribute prediction method and device, coding method and device, and decoding method and device WO2021197238A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010239384.8A CN113473153B (en) 2020-03-30 2020-03-30 Point cloud attribute prediction method, encoding method, decoding method and equipment thereof
CN202010239384.8 2020-03-30

Publications (1)

Publication Number Publication Date
WO2021197238A1 true WO2021197238A1 (en) 2021-10-07

Family

ID=77865096

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/083396 WO2021197238A1 (en) 2020-03-30 2021-03-26 Point cloud attribute prediction method and device, coding method and device, and decoding method and device

Country Status (2)

Country Link
CN (1) CN113473153B (en)
WO (1) WO2021197238A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2024011472A1 (en) * 2022-07-13 2024-01-18 Oppo广东移动通信有限公司 Point cloud encoding and decoding methods, encoder and decoder, and computer storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190116372A1 (en) * 2017-10-16 2019-04-18 Mitsubishi Electric Research Laboratories, Inc. Systems and Methods for Compressing, Representing and Processing Point Clouds
CN110418135A (en) * 2019-08-05 2019-11-05 北京大学深圳研究生院 A kind of the point cloud intra-frame prediction method and equipment of the weight optimization based on neighbours
CN110708560A (en) * 2018-07-10 2020-01-17 腾讯美国有限责任公司 Point cloud data processing method and device
CN112218079A (en) * 2020-08-24 2021-01-12 北京大学深圳研究生院 Point cloud layering method based on spatial sequence, point cloud prediction method and point cloud prediction equipment

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9772848B2 (en) * 2014-11-14 2017-09-26 Intel Corporation Three-dimensional morton coordinate conversion processors, methods, systems, and instructions
US9772850B2 (en) * 2014-11-14 2017-09-26 Intel Corporation Morton coordinate adjustment processors, methods, systems, and instructions
CN106126919A (en) * 2016-06-23 2016-11-16 武汉大学 A kind of accurate Hausdorff distance computational methods between any type point set data
GB201717012D0 (en) * 2017-10-17 2017-11-29 Nokia Technologies Oy An apparatus a method and a computer program for coding volumetric video
US10853447B2 (en) * 2018-01-19 2020-12-01 8i Limited Bezier volume representation of point cloud attributes
EP3579194A1 (en) * 2018-06-08 2019-12-11 My Virtual Reality Software AS Indexation of massive point cloud data for efficient visualization
US10911787B2 (en) * 2018-07-10 2021-02-02 Apple Inc. Hierarchical point cloud compression
US11151748B2 (en) * 2018-07-13 2021-10-19 Electronics And Telecommunications Research Institute 3D point cloud data encoding/decoding method and apparatus
CN110572655B (en) * 2019-09-30 2023-01-10 北京大学深圳研究生院 Method and equipment for encoding and decoding point cloud attribute based on neighbor weight parameter selection and transmission

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190116372A1 (en) * 2017-10-16 2019-04-18 Mitsubishi Electric Research Laboratories, Inc. Systems and Methods for Compressing, Representing and Processing Point Clouds
CN110708560A (en) * 2018-07-10 2020-01-17 腾讯美国有限责任公司 Point cloud data processing method and device
CN110418135A (en) * 2019-08-05 2019-11-05 北京大学深圳研究生院 A kind of the point cloud intra-frame prediction method and equipment of the weight optimization based on neighbours
CN112218079A (en) * 2020-08-24 2021-01-12 北京大学深圳研究生院 Point cloud layering method based on spatial sequence, point cloud prediction method and point cloud prediction equipment

Also Published As

Publication number Publication date
CN113473153B (en) 2023-04-25
CN113473153A (en) 2021-10-01

Similar Documents

Publication Publication Date Title
CN111145090B (en) Point cloud attribute coding method, point cloud attribute decoding method, point cloud attribute coding equipment and point cloud attribute decoding equipment
US11409998B2 (en) Trimming search space for nearest neighbor determinations in point cloud compression
WO2022042539A1 (en) Spatial order-based point cloud layering method, point cloud prediction method and device
US11252441B2 (en) Hierarchical point cloud compression
US11454710B2 (en) Point cloud compression using a space filling curve for level of detail generation
US11727603B2 (en) Adaptive distance based point cloud compression
US11276203B2 (en) Point cloud compression using fixed-point numbers
CN111405281A (en) Point cloud attribute information encoding method, point cloud attribute information decoding method, storage medium and terminal equipment
US20190080483A1 (en) Point Cloud Compression
WO2021196392A1 (en) Point cloud geometry encoding method, decoding method, encoding apparatus, and decoding apparatus
CN109257604A (en) A kind of color attribute coding method based on TMC3 point cloud encoder
WO2021023206A1 (en) Point cloud attribute prediction, encoding, and decoding method and device based on neighbor weight optimization
CN113014903B (en) Point cloud neighbor determination, point cloud prediction, point cloud coding and point cloud decoding methods and equipment
US20220329833A1 (en) Nearest neighbor search method, apparatus, device, and storage medium
EP4038577A1 (en) Techniques and apparatus for inter-channel prediction and transform for point-cloud attribute coding
WO2021197238A1 (en) Point cloud attribute prediction method and device, coding method and device, and decoding method and device
WO2022121650A1 (en) Point cloud attribute predicting method, encoder, decoder, and storage medium
WO2021218509A1 (en) Nearest neighbour search method, encoder, decoder and storage medium
WO2021115466A1 (en) Point cloud data encoding method, point cloud data decoding method, storage medium and device
JP2023510081A (en) Attribute information prediction method, encoder, decoder and storage medium
CN113395506A (en) Point cloud neighbor searching method, encoding method, decoding method and equipment based on segmentation
JP2023549021A (en) Point cloud encoding method, point cloud decoding method and related devices
CN117176959B (en) Processing method, processing apparatus, and storage medium
WO2023024842A1 (en) Point cloud encoding/decoding method, apparatus and device, and storage medium
WO2022116118A1 (en) Prediction method, encoder, decoder and storage medium

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21782030

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21782030

Country of ref document: EP

Kind code of ref document: A1