Intra-frame prediction method and device, codec, device, and storage medium
By using the weighted average calculation method of coplanar nodes and interpolation nodes in point cloud processing, the accuracy of intra prediction is improved, the limitation of point cloud data storage and transmission bandwidth is solved, and the encoding and decoding efficiency is improved.
Patent Information
- Application Number
- CN202080107272.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-12-03
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2040-12-03
AI Technical Summary
The prior art has limitations on storage space and transmission bandwidth in point cloud data processing, which leads to point cloud compression becoming a key issue in promoting industrial development, especially when intra prediction accuracy affects encoding and decoding efficiency.
By weighted average calculation based on the attribute values of the coplanar node and the interpolated node of the current node, the accuracy of intra prediction is improved, thereby improving the encoding and decoding efficiency of the point cloud.
It improves the accuracy of intra prediction, reduces the storage space and transmission traffic requirements, and improves the encoding efficiency of point cloud data.
Smart Images

Figure CN116458158B_ABST
Abstract
Description
Technical Field
[0001] The embodiments of the present application relate to point cloud processing technology, and are related to but not limited to intra-frame prediction methods and devices, codecs, devices, and storage media. Background Art
[0002] Point cloud is a set of irregularly distributed discrete points in space that express the spatial structure and surface properties of a three-dimensional object or scene. Point cloud data usually includes geometric information (x, y, z) composed of three-dimensional position information, attribute information composed of three-dimensional color information (r, g, b) and one-dimensional reflectivity information (r).
[0003] Point clouds can flexibly and conveniently express the spatial structure and surface properties of three-dimensional objects or scenes. Point clouds are obtained by directly sampling real objects, and can provide a strong sense of reality while ensuring accuracy. Therefore, they are widely used, including virtual reality games, computer-aided design, geographic information systems, automatic navigation systems, digital cultural heritage, free viewpoint broadcasting, three-dimensional immersive remote presentation, and three-dimensional reconstruction of biological tissues and organs.
[0004] With the growth of application demand, the processing of massive three-dimensional (3D) point cloud data has encountered bottlenecks in storage space and transmission bandwidth. In order to better realize data management, save server storage space, and reduce the transmission flow and transmission time between the server and the client, point cloud compression has become a key issue in promoting the development of the point cloud industry.
[0005] Point cloud compression is mainly divided into geometric compression and attribute compression. The accuracy of intra-frame prediction (i.e., prediction of node attribute values) in attribute compression directly affects the encoding and decoding efficiency. Summary of the invention
[0006] In view of this, the intra-frame prediction method and apparatus, codec, device, and storage medium provided in the embodiments of the present application can improve the accuracy of intra-frame prediction, thereby improving the encoding and decoding efficiency of point clouds. The intra-frame prediction method and apparatus, codec, device, and storage medium provided in the embodiments of the present application are implemented as follows:
[0007] The intra-frame prediction method provided by the embodiment of the present application includes: obtaining an attribute prediction value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer; wherein the attribute value of the coplanar node that meets the condition is an attribute reconstruction value, and for the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to the attribute reconstruction value of the interpolation node, and the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a colinear node of the current node, and the condition is a non-empty node decoded before the current node; or, the attribute value of the coplanar node that meets the condition is an attribute reconstruction value, and for the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to a preset first constant, and the condition is a non-empty node decoded before the current node.
[0008] In some embodiments, the attribute values of the coplanar nodes that do not meet the conditions are obtained based on the attribute reconstruction values of the interpolation nodes, including: determining the weight value of each of the interpolation nodes; and performing weighted average calculation on the attribute reconstruction values of each of the interpolation nodes based on the weight value of each of the interpolation nodes to obtain the attribute values of the coplanar nodes that do not meet the conditions.
[0009] In some embodiments, determining the weight value of each interpolation node includes: determining the weight value of the interpolation node that does not meet the condition as a preset second constant; and determining the weight value of the interpolation node that meets the condition as a preset third constant.
[0010] In some embodiments, obtaining the attribute value of the coplanar node that does not meet the condition based on the attribute reconstruction value of the interpolation node includes: using the attribute reconstruction value of one node among all the interpolation nodes of the coplanar node that does not meet the condition as the attribute value of the coplanar node that does not meet the condition.
[0011] In some embodiments, obtaining a predicted attribute value of the current node based on the attribute values of M coplanar nodes of the current node includes: taking the M coplanar nodes as prediction nodes; and predicting the attributes of the current node based on the attribute values of the prediction nodes to obtain a predicted attribute value of the current node.
[0012] In some embodiments, obtaining a predicted attribute value of the current node based on the attribute values of M coplanar nodes of the current node includes: obtaining K predicted nodes based on the M coplanar nodes; wherein K is an integer greater than 0; and predicting the attributes of the current node based on the attribute values of the predicted nodes to obtain a predicted attribute value of the current node.
[0013] In some embodiments, obtaining K prediction nodes according to the M coplanar nodes includes: obtaining K prediction nodes according to a specific coding order of the M coplanar nodes; wherein, when the coplanar node is the coplanar node that meets the condition or the coplanar node that does not meet the condition and has at least one interpolation node that meets the condition, the coplanar node is determined as the prediction node; when the total number of the coplanar nodes that meet the condition and the coplanar nodes that do not meet the condition and has at least one interpolation node that meets the condition is greater than or equal to K, the first K nodes sorted in a specific coding order among the nodes corresponding to the total number of nodes are determined as the prediction nodes; when the total number of nodes is greater than 0 and less than K, determining the attribute value of the filler node; and determining the node corresponding to the total number of nodes and the filler node as the prediction node.
[0014] In some embodiments, determining the attribute value of the filler node includes: determining the attribute value of the first node among the nodes corresponding to the total number of nodes and sorted according to the specific coding order as the attribute value of the filler node; or, determining the average of the attribute values of the nodes corresponding to the total number of nodes as the attribute value of the filler node; or, determining the average of the attribute values of the coplanar nodes and / or colinear nodes of the first node as the attribute value of the filler node; or, determining a preset fourth constant as the attribute value of the filler node.
[0015] In some embodiments, predicting the attribute of the current node based on the attribute value of the prediction node to obtain the attribute prediction value of the current node includes: determining the weight value of each prediction node when any of the prediction nodes satisfies the condition, or when any of the prediction nodes is a coplanar node that does not satisfy the condition and at least one interpolation node of the coplanar node that does not satisfy the condition satisfies the condition; and performing weighted average calculation on the attribute value of each prediction node based on the weight value of each prediction node to obtain the attribute prediction value of the current node.
[0016] In some embodiments, determining the weight value of each prediction node includes: determining the weight value of each prediction node that meets the condition as a preset fifth constant; determining the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and all interpolation nodes do not meet the condition as a preset sixth constant; determining the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and at least one interpolation node meets the condition as the preset seventh constant.
[0017] In some embodiments, the attribute value of each prediction node is weighted averaged according to the weight value of each prediction node to obtain the attribute prediction value of the current node, including: when the number of prediction nodes is a power of 2, multiplying the attribute value of each prediction node by the corresponding weight value through a multiplier to obtain a first operation result; adding the first operation result corresponding to each prediction node through an adder to obtain a second operation result; shifting the second operation result and the number of prediction nodes through a shifter to obtain the attribute prediction value of the current node.
[0018] In some embodiments, the attribute of the current node is predicted based on the attribute value of each of the prediction nodes to obtain the attribute prediction value of the current node, and also includes: when each of the prediction nodes belongs to the coplanar node that does not meet the condition and all interpolation nodes of each of the prediction nodes do not meet the condition, the attribute prediction value of the current node is determined based on the attribute reconstruction value of at least one node that has been decoded before the current node.
[0019] In some embodiments, determining the attribute prediction value of the current node based on the attribute reconstruction value of at least one node that has been decoded before the current node includes: determining the attribute reconstruction value of the node that has been decoded before the current node as the attribute prediction value of the current node.
[0020] In some embodiments, the method further includes: parsing the residual of the current node from the received attribute code stream; and determining the attribute reconstruction value of the current node according to the attribute prediction value of the current node and the residual.
[0021] An embodiment of the present application provides a point cloud decoding method, the method comprising: parsing a received attribute code stream to obtain a residual of a current node; executing the steps in the method described in the embodiment of the present application on the current node to obtain an attribute prediction value of the current node; and determining an attribute reconstruction value of the current node based on the attribute prediction value of the current node and the residual.
[0022] An intra-frame prediction method provided by an embodiment of the present application includes: obtaining an attribute prediction value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer; wherein the attribute value of the coplanar node that meets the condition is an attribute reconstruction value, and for the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to the attribute reconstruction value of the interpolation node, and the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a colinear node of the current node, and the condition is a non-empty node encoded before the current node; or, the attribute value of the coplanar node that meets the condition is an attribute reconstruction value, and for the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to a preset first constant, and the condition is a non-empty node encoded before the current node.
[0023] In some embodiments, the attribute values of the coplanar nodes that do not meet the conditions are obtained based on the attribute reconstruction values of the interpolation nodes, including: determining the weight value of each of the interpolation nodes; and performing weighted average calculation on the attribute reconstruction values of each of the interpolation nodes based on the weight value of each of the interpolation nodes to obtain the attribute values of the coplanar nodes that do not meet the conditions.
[0024] In some embodiments, determining the weight value of each interpolation node includes: determining the weight value of the interpolation node that does not meet the condition as a preset second constant; and determining the weight value of the interpolation node that meets the condition as a preset third constant.
[0025] In some embodiments, the interpolation node satisfies the condition.
[0026] In some embodiments, obtaining the attribute value of the coplanar node that does not meet the condition based on the attribute reconstruction value of the interpolation node includes: using the attribute reconstruction value of one node among all the interpolation nodes of the coplanar node that does not meet the condition as the attribute value of the coplanar node that does not meet the condition.
[0027] In some embodiments, obtaining a predicted attribute value of the current node based on the attribute values of M coplanar nodes of the current node includes: taking the M coplanar nodes as prediction nodes; and predicting the attributes of the current node based on the attribute values of the prediction nodes to obtain a predicted attribute value of the current node.
[0028] In some embodiments, obtaining a predicted attribute value of the current node based on the attribute values of M coplanar nodes of the current node includes: obtaining K predicted nodes based on the M coplanar nodes; wherein K is an integer greater than 0; and predicting the attributes of the current node based on the attribute values of the predicted nodes to obtain a predicted attribute value of the current node.
[0029] In some embodiments, K is a power of 2.
[0030] In some embodiments, obtaining K prediction nodes according to the M coplanar nodes includes: obtaining K prediction nodes according to a specific coding order of the M coplanar nodes; wherein, when the coplanar node is the coplanar node that meets the condition or the coplanar node that does not meet the condition and has at least one interpolation node that meets the condition, the coplanar node is determined as the prediction node; when the total number of the coplanar nodes that meet the condition and the coplanar nodes that do not meet the condition and has at least one interpolation node that meets the condition is greater than or equal to K, the first K nodes sorted in a specific coding order among the nodes corresponding to the total number of nodes are determined as the prediction nodes; when the total number of nodes is greater than 0 and less than K, determining the attribute value of the filler node; and determining the node corresponding to the total number of nodes and the filler node as the prediction node.
[0031] In some embodiments, determining the attribute value of the filler node includes: determining the attribute value of the first node among the nodes corresponding to the total number of nodes and sorted according to the specific coding order as the attribute value of the filler node; or, determining the average of the attribute values of the nodes corresponding to the total number of nodes as the attribute value of the filler node; or, determining the average of the attribute values of the coplanar nodes and / or colinear nodes of the first node as the attribute value of the filler node; or, determining a preset fourth constant as the attribute value of the filler node.
[0032] In some embodiments, predicting the attribute of the current node based on the attribute value of the prediction node to obtain the attribute prediction value of the current node includes: determining the weight value of each prediction node when any of the prediction nodes satisfies the condition, or when any of the prediction nodes is a coplanar node that does not satisfy the condition and at least one interpolation node of the coplanar node that does not satisfy the condition satisfies the condition; and performing weighted average calculation on the attribute value of each prediction node based on the weight value of each prediction node to obtain the attribute prediction value of the current node.
[0033] In some embodiments, determining the weight value of each prediction node includes: determining the weight value of each prediction node that meets the condition as a preset fifth constant; determining the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and all interpolation nodes do not meet the condition as a preset sixth constant; determining the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and at least one interpolation node meets the condition as the preset seventh constant.
[0034] In some embodiments, the attribute value of each prediction node is weighted averaged according to the weight value of each prediction node to obtain the attribute prediction value of the current node, including: when the number of prediction nodes is a power of 2, multiplying the attribute value of each prediction node by the corresponding weight value through a multiplier to obtain a first operation result; adding the first operation result corresponding to each prediction node through an adder to obtain a second operation result; shifting the second operation result and the number of prediction nodes through a shifter to obtain the attribute prediction value of the current node.
[0035] In some embodiments, predicting the attribute of the current node based on the attribute value of each of the prediction nodes to obtain the attribute prediction value of the current node also includes: when each of the prediction nodes belongs to the coplanar node that does not meet the condition and all interpolation nodes of each of the prediction nodes do not meet the condition, determining the attribute prediction value of the current node based on the attribute reconstruction value of at least one node that has been encoded before the current node.
[0036] In some embodiments, determining the attribute prediction value of the current node based on the attribute reconstruction value of at least one node that has been encoded before the current node includes: determining the attribute reconstruction value of the node that has been encoded before the current node as the attribute prediction value of the current node.
[0037] In some embodiments, the M coplanar nodes are all coplanar nodes of the current node.
[0038] An embodiment of the present application provides a point cloud encoding method, which includes: executing the steps in the method described in the embodiment of the present application on a current node of the point cloud to obtain an attribute prediction value of the current node; determining a residual between the attribute prediction value of the current node and an original attribute value of the current node; and encoding the residual of the current node into an attribute code stream.
[0039] An intra-frame prediction device provided by an embodiment of the present application includes: a prediction module, used to obtain an attribute prediction value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer; wherein the attribute value of the coplanar node that meets the condition is an attribute reconstruction value, and for the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to the attribute reconstruction value of the interpolation node, and the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a colinear node of the current node, and the condition is a non-empty node decoded before the current node; or, the attribute value of the coplanar node that meets the condition is an attribute reconstruction value, and for the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to a preset first constant, and the condition is a non-empty node decoded before the current node.
[0040] A decoding device provided in an embodiment of the present application includes: a parsing module, used to parse a received attribute code stream to obtain a residual of a current node; an intra-frame prediction module, used to execute the steps in the method described in the embodiment of the present application to obtain an attribute prediction value of the current node; and a decoding module, used to determine an attribute reconstruction value of the current node based on the attribute prediction value of the current node and the residual.
[0041] A decoder provided in an embodiment of the present application includes a memory and a processor; wherein the memory is used to store a computer program that can be run on the processor; and the processor is used to execute the method described in the embodiment of the present application when running the computer program.
[0042] An intra-frame prediction device provided by an embodiment of the present application includes: a prediction module, used to obtain an attribute prediction value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer; wherein the attribute value of the coplanar node that meets the condition is an attribute reconstruction value, and for the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to the attribute reconstruction value of the interpolation node, and the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a colinear node of the current node, and the condition is a non-empty node encoded before the current node; or, the attribute value of the coplanar node that meets the condition is an attribute reconstruction value, and for the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to a preset first constant, and the condition is a non-empty node encoded before the current node.
[0043] An encoding device provided by an embodiment of the present application includes: an intra-frame prediction module, used to execute the steps in the method described in the embodiment of the present application to obtain an attribute prediction value of a current node; a determination module, used to determine the residual between the attribute prediction value of the current node and the original attribute value of the current node; and an encoding module, used to encode the residual of the current node into an attribute code stream.
[0044] An encoder provided in an embodiment of the present application includes a memory and a processor; wherein the memory is used to store a computer program that can be run on the processor; and the processor is used to execute the method described in the embodiment of the present application when running the computer program.
[0045] An electronic device provided in an embodiment of the present application includes a memory and a processor; wherein the memory is used to store a computer program that can be run on the processor; and the processor is used to execute the method described in the embodiment of the present application when running the computer program.
[0046] The computer-readable storage medium provided in the embodiment of the present application stores a computer program thereon, and when the computer program is executed by a processor, the method described in the embodiment of the present application is implemented.
[0047] In an embodiment of the present application, the attribute value of the coplanar node that does not meet the condition of the current node is obtained by interpolating the attribute value of the interpolation node of the coplanar node that does not meet the condition; in this way, the electronic device can use the attribute value of the coplanar node that does not meet the condition to predict the attribute of the current node, that is, when the electronic device performs attribute prediction, it not only performs intra-frame prediction based on the coplanar nodes that meet the condition and the collinear nodes that meet the condition, but also combines the attribute values of the coplanar nodes that do not meet the condition. It can be seen that this method takes into account more information for the attribute prediction of the current node, which can improve the accuracy of intra-frame prediction, thereby improving coding efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0048] The drawings herein are incorporated into the specification and constitute a part of the specification. These drawings illustrate embodiments consistent with the present application and are used together with the specification to illustrate the technical solution of the present application.
[0049] Figure 1 It is a schematic diagram of a three-dimensional point cloud image and a local magnified image;
[0050] Figure 2 A schematic diagram of a point cloud image and its corresponding data storage format;
[0051] Figure 3AA schematic diagram of the coding framework of the Point Cloud Reference Model (PCRM), a point cloud compression reference platform provided by the Audio Video Standard (AVS) Point Cloud Compression Task Force;
[0052] Figure 3B Schematic diagram of the decoding framework of PCRM, the point cloud compression reference platform provided by the AVS point cloud compression task force;
[0053] Figure 4A A schematic diagram of placing the entire point cloud in a cube bounding box;
[0054] Figure 4B Schematic diagram of the octree partitioning process for point clouds;
[0055] Figure 5 Schematic diagram of the encoding order of Morton code in two-dimensional space;
[0056] Figure 6 Schematic diagram of the encoding order of Morton code in three-dimensional space;
[0057] Fig. 7A A schematic diagram of the current node and its coplanar nodes;
[0058] Figure 7B A schematic diagram of the current node and its co-linear nodes;
[0059] Figure 8 This is a schematic diagram of the implementation flow of the intra-frame prediction method according to an embodiment of the present application;
[0060] Fig. 9 This is a schematic diagram of the implementation flow of the intra-frame prediction method according to an embodiment of the present application;
[0061] Fig.10 This is a schematic diagram of the implementation flow of the intra-frame prediction method according to an embodiment of the present application;
[0062] Fig.11 This is a schematic diagram of the implementation flow of the intra-frame prediction method according to an embodiment of the present application;
[0063] Fig.12 This is a schematic diagram of the implementation flow of the intra-frame prediction method according to an embodiment of the present application;
[0064] Fig.13 This is a schematic diagram of the implementation flow of the intra-frame prediction method according to an embodiment of the present application;
[0065] Fig.14 A schematic diagram of all coplanar nodes of the current node;
[0066] Fig.15A schematic diagram of interpolation nodes for coplanar nodes that do not meet the conditions;
[0067] Fig.16 This is a schematic diagram of the structure of an intra-frame prediction device according to an embodiment of the present application;
[0068] Fig.17 This is a schematic diagram of the structure of the encoding device according to an embodiment of the present application;
[0069] Fig.18 This is a schematic diagram of the structure of an intra-frame prediction device according to an embodiment of the present application;
[0070] Fig.19 This is a schematic diagram of the structure of a decoding device according to an embodiment of the present application;
[0071] Fig. 20 A schematic diagram of the hardware entity of an electronic device according to an embodiment of the present application;
[0072] Fig.21 A schematic diagram of the hardware entity of the encoder according to an embodiment of the present application;
[0073] Fig. 22 A schematic diagram of the hardware entity of the decoder according to an embodiment of the present application. DETAILED DESCRIPTION
[0074] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the specific technical solution of the present application will be further described in detail below in conjunction with the drawings in the embodiments of the present application. The following embodiments are used to illustrate the present application, but are not used to limit the scope of the present application.
[0075] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which this application belongs. The terms used herein are only for the purpose of describing the embodiments of this application and are not intended to limit this application.
[0076] In the following description, reference is made to “some embodiments”, which describe a subset of all possible embodiments, but it will be understood that “some embodiments” may be the same subset or different subsets of all possible embodiments and may be combined with each other without conflict.
[0077] It should be pointed out that the terms "first\second\third" involved in the embodiments of the present application are intended to distinguish similar or different objects and do not represent a specific ordering of the objects. It can be understood that "first\second\third" can be interchanged in a specific order or sequence where permitted, so that the embodiments of the present application described here can be implemented in an order other than that illustrated or described here.
[0078] The coding and decoding framework and business scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. It is known to those skilled in the art that with the evolution of the coding and decoding framework and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.
[0079] Before further describing the embodiments of the present application, the data format of the point cloud, the encoding and decoding framework, and the regularization processing of the point cloud involved in the embodiments of the present application are described. Among them, the encoding and decoding framework and the business scenario described in the embodiments of the present application are to more clearly illustrate the technical solution of the embodiments of the present application, and do not constitute a limitation on the technical solution provided in the embodiments of the present application. It is known to those skilled in the art that with the evolution of the encoding and decoding framework and the emergence of new business scenarios, the technical solution provided in the embodiments of the present application is also applicable to similar technical problems.
[0080] (1) Point cloud data format
[0081] Point cloud is a set of irregularly distributed discrete points in space that express the spatial structure and surface properties of a three-dimensional object or scene. Figure 1 As shown, 101 is a three-dimensional point cloud image, 102 is a local enlarged view of the point cloud image, and it can be seen that the point cloud surface is composed of densely distributed points.
[0082] The distribution of points in a point cloud in three-dimensional space is random and irregular, so it is necessary to record the position of each point in space in order to fully express a point cloud. Each position has corresponding attribute information, usually red, green, and blue (RGB) color values, which reflect the color of the object; reflectance values are also common attribute information, which reflect the surface material of the object. Therefore, point cloud data usually includes attribute information composed of geometric information (x, y, z) composed of three-dimensional position information, three-dimensional color information (r, g, b) and one-dimensional reflectance information (r).
[0083] like Figure 2 The figure shows a point cloud image and its corresponding data storage format, wherein 201 provides six viewing angles of the point cloud image; 202 shows the data storage format of the point cloud image, which consists of a file header information part and a data part. The header information includes the data format, data representation type, the total number of point cloud points, and the content represented by the point cloud. For example, the point cloud in 202 is in the ".ply" format, represented by ASCII code, with a total number of 207242 points, and each point has three-dimensional position information xyz and three-dimensional color information rgb.
[0084] (2) Introduction to point cloud compression
[0085] Point clouds are collected mainly through the following methods: computer generation, 3D laser scanning, and 3D photogrammetry. Computers can generate point clouds of virtual three-dimensional objects and scenes; 3D laser scanning can obtain point clouds of static real-world three-dimensional objects or scenes, and can obtain millions of point clouds per second; 3D photogrammetry can obtain point clouds of dynamic real-world three-dimensional objects or scenes, and can obtain tens of millions of point clouds per second. These technologies reduce the cost and time cycle of point cloud data acquisition and improve the accuracy of data. The change in the way point cloud data is acquired makes it possible to acquire a large amount of point cloud data. However, with the growth of application demand, the processing of massive 3D point cloud data encounters bottlenecks in storage space and transmission bandwidth limitations.
[0086] Taking a point cloud video with a frame rate of 30 frames per second (fps) as an example, the number of points in each point cloud frame is 700,000, and each point has floating point coordinate information xyz and uchar type color information RGB. The data volume of a 10s point cloud video is about 0.7 million (4Byte 3 + 1Byte 3) 30fps 10s = 3.15GB, while the YUV sampling format is 4:2:0, and the frame rate is 24fps. The 10s data volume of a 1280 720 two-dimensional video is about 1280 720 12bit 24frames 10s ≈ 0.33GB, and the data volume of a 10s two-view 3D video is about 0.33 2 = 0.66GB. It can be seen that the data volume of a point cloud video far exceeds the data volume of a two-dimensional video and a three-dimensional video of the same length. Therefore, in order to better realize data management, save server storage space, and reduce the transmission traffic and transmission time between the server and the client, point cloud compression has become a key issue in promoting the development of the point cloud industry.
[0087] Point cloud compression usually adopts the method of compressing the point cloud geometry information and point cloud attribute information separately. At the encoding end, the point cloud geometry information is first encoded in the geometry encoder to obtain the reconstructed geometry information; then the reconstructed geometry information is input into the attribute encoder as additional information to assist in the compression of the point cloud attribute information; at the decoding end, the point cloud geometry information is first decoded in the geometry decoder, and then the decoded geometry information is input into the attribute decoder as additional information to assist in the compression of the point cloud attribute information. The entire codec consists of pre-processing / post-processing, geometry encoding / decoding, and attribute encoding / decoding.
[0088] Figure 3A The coding framework of the point cloud compression reference platform PCRM provided by the AVS point cloud compression task force, Figure 3B The decoding framework of PCRM, the point cloud compression reference platform provided by the AVS Point Cloud Compression Task Force.
[0089] For PCRM reference software, such as Figure 3A As shown, in the geometric encoding part of the encoding end, first, the collected geometric information is preprocessed, the geometric origin is normalized to the minimum position in the point cloud space by coordinate translation, and the geometric information is converted from floating point type to integer type by coordinate quantization to obtain regularized geometric information, that is, a regularized point cloud space is obtained, so as to facilitate subsequent regularization processing; then, the regularized geometric information is geometrically encoded. For example, in some embodiments, an octree structure can be used to recursively divide the regularized point cloud space, each time the current node is divided into eight sub-blocks of the same size, and the occupation codeword of each sub-block is determined. When there is no point in the sub-block, it is recorded as empty, otherwise it is recorded as non-empty. The occupation codeword information of all blocks is recorded in the last layer of the recursive division and encoded.
[0090] like Figure 3A As shown in the figure, the geometric information expressed by the octree structure is input into the geometric entropy encoder to form a geometric code stream, and is geometrically reconstructed in the encoder. The reconstructed geometric information is input into the attribute encoder as additional information. In the attribute encoding part, the acquired attribute information is first preprocessed. Since the geometric information changes after geometric encoding, it is necessary to reallocate the attribute value to each point after geometric encoding. This process is called attribute recoloring. In addition, if the attribute information to be processed is color information, the original color needs to be transformed into a YUV color space that is more in line with the visual characteristics of the human eye. Then, the preprocessed attribute information is attribute encoded. In some embodiments, for attribute coding, the point cloud needs to be reordered first, and the reordering method is Morton code. Therefore, the traversal order of attribute coding is Morton order. The attribute prediction method in PCRM is single-point prediction based on Morton order, that is, one point is traced back from the current point to be encoded (current node) according to the Morton order, and the point found is the prediction reference point (prediction node) of the current point to be encoded, and then the attribute reconstruction value of the prediction reference point is used as the attribute prediction value, and the attribute residual is the difference between the preprocessed attribute value of the current point to be encoded and the attribute prediction value; finally, the residual is quantized, and the quantized residual is input into the attribute entropy encoder to form an attribute code stream.
[0091] On the decoding side, Figure 3BAs shown, the method of decoding the geometric code stream and the attribute code stream separately is adopted. In the decoding part of the geometric code stream, the geometric code stream is first entropy decoded to obtain the geometric information of each node, and then the octree structure is constructed in the same way as the geometric coding, and the geometric information expressed by the octree structure after the coordinate transformation is reconstructed. On the one hand, the coordinates of the information are dequantized and detranslated to obtain the decoded geometric information, and on the other hand, the decoded geometric information is input into the attribute decoder as additional information. In the decoding part of the attribute code stream, the Morton order is constructed in the same way as the encoding end, and the attribute code stream is first entropy decoded to obtain the quantized residual information; then the residual information is dequantized to obtain the residual value; similarly, in the same way as the attribute coding, the attribute prediction value of the current point to be decoded is obtained, and then the attribute prediction value is added to the residual value to restore the YUV attribute value of the current point to be decoded; finally, the decoded attribute information is obtained through the inverse transformation of the color space.
[0092] (3) Regularization of point clouds
[0093] Since the point cloud is irregularly distributed in space, it brings challenges to the encoding process. Therefore, a recursive octree structure is used to regularly express the points in the point cloud as the center of the cube. Figure 4A As shown, first place the entire point cloud in a cube bounding box, and the coordinates of the midpoint of the point cloud are expressed as (x q ,y q ,z q ),q=0,...,Q-1, where Q is the total number of points in the point cloud, and the boundary values of the point cloud in the x, y, and z directions are as shown in the following equations (1) to (6), respectively:
[0094] x min =min(x 0 ,x 1 ,...x q-1 ) Formula (1);
[0095] y min =min(y 0 ,y 1 ,...y q-1 ) Formula (2);
[0096] z min =min(z 0 ,z 1 ,...z q-1 ) Formula (3);
[0097] x max =max(x 0 ,x 1 ,...x q-1 ) Formula (4);
[0098] y max =max(y 0 ,y 1 ,...y q-1 ) Formula (5);
[0099] z max =max(z 0 ,z 1 ,...z q-1 ) Formula (6);
[0100] Then the origin of the bounding box (x origin ,y origin ,z origin ) can be calculated according to the following formulas (7) to (9):
[0101] x origin = int(floor(x min )) Formula (7);
[0102] y origin = int(floor(y min )) Formula (8);
[0103] z origin = int(floor(z min )) Formula (9);
[0104] The sizes of the bounding box in the x, y, and z directions can be calculated according to the following equations (10) to (12):
[0105] BoudingBoxSize x = int(x max -x origin )+1 formula (10);
[0106] BoudingBoxSize y = int(y max -y origin )+1 formula (11);
[0107] BoudingBoxSize z = int(z max -z origin )+1 formula (12);
[0108] Then, if Figure 4BAs shown in the figure, firstly, the cube bounding box is divided into eight sub-blocks each time by octree, and then the non-empty blocks in the sub-blocks (i.e., blocks containing points) are divided into octrees again. The division is recursively repeated until a certain depth. The non-empty sub-blocks of the final size are called voxels. Each voxel contains one or more points. The geometric positions of these points are normalized to the center point (node) of the voxel. The attribute value of the center point is the average attribute value of all the points in the voxel (original attribute value).
[0109] Understandably, regularizing the point cloud into blocks in space is conducive to describing the relationship between points in the point cloud, and then being able to express a specific coding order, encoding each voxel in a certain order, that is, encoding the point (or "node") represented by the voxel. A commonly used coding order is the cross-separated Morton order, Figure 5 The coding order of Morton code in two-dimensional space is shown, taking 8×8 block as an example, where the order of arrows indicates the coding order of nodes under Morton order. 501 is the "z"-shaped Morton coding order of 2×2 pixels in the block, 502 is the "z"-shaped Morton coding order between 4 2×2 blocks, and 503 is the "z"-shaped Morton coding order between 4 4×4 blocks, which together form the Morton coding order of the entire 8×8 block. The Morton coding order expanded to three-dimensional space is as follows Figure 6 As shown in the figure, 16 nodes are displayed. Inside each "z", the Morton coding order between each "z" and "z" is first encoded along the x-axis, then along the y-axis, and finally along the z-axis.
[0110] (4) Intra-frame prediction of attributes in point cloud compression
[0111] In the attribute intra-frame prediction part of point cloud compression, for color attributes, the current node is predicted mainly by referring to the adjacent nodes of the current node. The residual information is calculated based on the attribute prediction value and the original attribute value of the current node, and then quantized and encoded into the bitstream and transmitted to the decoder. After the decoder receives and parses the bitstream, it obtains the residual information through inverse transformation and inverse quantization. The decoder predicts the attribute prediction value through the same process, and obtains the attribute reconstruction value of the current node after superposition with the residual information.
[0112] In this process, attribute intra-frame prediction uses the geometric relationship between nodes, and uses the geometric coplanar and colinear nodes of the current node as prediction nodes. At the same time, the condition that the prediction node needs to meet is that it is encoded before the current node. Then the weight value is set to the inverse of the geometric Euclidean distance between the prediction node and the current node multiplied by 2, that is, the weight of the coplanar node is 2, and the weight of the colinear node is 1. The weighted average of the attribute reconstruction values of all prediction nodes is calculated as the attribute prediction value (especially for the first node encoded, there is no reference point for prediction, and its attribute prediction value is directly set to 0). The prediction node is determined according to the following two conditions, namely:
[0113] Condition a) It must be coplanar and colinear with the current node;
[0114] Condition b) is encoded before the current node.
[0115] Assume that the serial number of the current node O is 7, with 6 faces and 12 edges. Fig. 7A As shown, the coplanar nodes are 3, 5, 6, 14, 21 and 35. Figure 7B As shown, the collinear nodes are 1, 2, 4, 10, 12, 17, 20, 28, 33, 34, 42 and 49.
[0116] Among all these coplanar nodes and collinear nodes, no matter what the position of the current node is, the nodes that always meet the "encoded before the current node" condition are coplanar nodes 3, 5 and 6 and collinear nodes 1, 2 and 4. Therefore, the predicted nodes are coplanar nodes 3, 5 and 6 and collinear nodes 1, 2 and 4. The attribute prediction value of the current node is calculated according to the following formula (13), which is the weighted average of the attribute reconstruction values of all predicted nodes:
[0117]
[0118] in, Reconstruct the value of the attribute of the prediction node, w i is the weight of the prediction node. When the prediction node is an empty node, w i =0.
[0119] Assuming that all prediction nodes are empty nodes, the Morton predecessor of the current node (i.e., the previous node in the Morton coding order, which must be coded before the current node) is directly used as the prediction node, and the attribute prediction value is the attribute reconstruction value of the Morton predecessor.
[0120] (5) Position of attribute intra-frame prediction in the point cloud coding framework
[0121] like Figure 3A and Figure 3BAs shown, this technology acts on the intra-frame prediction part in the PCRM point cloud coding framework, and acts on both the encoding end and the decoding end. Since the encoding and decoding framework of the relevant PCRM only involves a single frame, the attribute prediction specifically refers to the intra-frame prediction.
[0122] The implementation method of the PCRM attribute encoder is as follows. The geometrically reconstructed point cloud is recursively divided into several cube voxels by the octree. The nodes in each voxel are subjected to the intra-frame prediction process to calculate the attribute prediction value according to the Morton coding order. The following a1), c1), and d1) processes are performed for the first node to be encoded, and b1), c1), and d1) processes are performed for the remaining nodes:
[0123] a1) When the current node is the first node to be encoded, there is no reference point for prediction, and its attribute prediction value is directly set to 0;
[0124] b1) Taking the coplanar nodes 3, 5 and 6 and the colinear nodes 1, 2 and 4 of the current node as prediction nodes, the weighted average of the attribute reconstruction values of all prediction nodes is calculated according to the following formula (14), and this value is used as the attribute prediction value of the current node:
[0125]
[0126] in, Reconstruct the value of the attribute of the prediction node, w i is the weight of the prediction node. When the prediction node is an empty node, w i =0.
[0127] When all prediction nodes are empty nodes, the Morton's predecessor point of the current node (i.e., the previous node in the Morton order, which is encoded before the current node) is directly used as the prediction node, and the attribute prediction value is the attribute reconstruction value of the Morton's predecessor point;
[0128] c1) The residual is the difference between the original attribute value of the current point and the attribute prediction value, and then the residual is transformed, quantized, and other operations are performed;
[0129] d1) The attribute prediction value is superimposed with the residual information after inverse quantization and other operations to obtain the attribute reconstruction value of the current node, which is used as reference information for subsequent coding units.
[0130] The implementation method of the attribute decoder of PCRM is as follows. The geometrically reconstructed point cloud is recursively divided into several cube voxels by the octree. The nodes in each voxel are subjected to the intra-frame prediction process to calculate the attribute prediction value according to the same Morton order as the encoding process. The first node to be decoded is executed with processes a2) and c2), and the remaining points are executed with processes b2) and c2):
[0131] a2) When the current node is the first node to be decoded, there is no reference point for prediction, and its attribute prediction value is directly set to 0;
[0132] b2) Taking the coplanar nodes 3, 5 and 6 and the colinear nodes 1, 2 and 4 of the current node as prediction nodes, the weighted average of the attribute reconstruction values of all prediction nodes is calculated according to the following formula (15), and this value is used as the attribute prediction value of the current node:
[0133]
[0134] in, Reconstruct the value of the attribute of the prediction node, w i is the weight of the prediction node. When the prediction node is an empty node, w i =0.
[0135] When all prediction nodes are empty nodes, the Morton's predecessor point of the current node (i.e., the previous node in the Morton order, which must be decoded before the current node) is directly used as the prediction node, and the attribute prediction value is the attribute reconstruction value of the Morton's predecessor point;
[0136] c2) Read the residual information of the current node from the bitstream, and superimpose it with the attribute prediction value of the current node after operations such as inverse quantization to obtain the attribute reconstruction value of the current node, which can be used as reference information for subsequent coding units.
[0137] However, the above-mentioned intra-frame prediction method adopted by PCRM partially uses the reference information of the coplanar and / or co-linear nodes of the current node, and only uses the coplanar nodes and co-linear nodes to the left, front and bottom of the current node as prediction nodes, and cannot use the reference information from the right, back and top, which results in inaccurate intra-frame prediction, thereby affecting the improvement of coding efficiency.
[0138] In view of this, an embodiment of the present application provides an intra-frame prediction method, which is applicable to an encoding end. The method can be applied to an electronic device with information processing capabilities, and the electronic device can be a television, a projector, a mobile phone, a computer, a tablet computer, a virtual reality (VR) head-mounted device, or any device with a point cloud video encoding and decoding function or only an encoding function. The function implemented by the intra-frame prediction method can be implemented by calling a program code by a processor in the electronic device, and of course the program code can be stored in a computer storage medium. It can be seen that the electronic device includes at least a processor and a storage medium.
[0139] Figure 8 Schematic diagram of the implementation flow of the intra-frame prediction method of the present application embodiment. Figure 8 As shown, the method may include the following steps 81 to 84:
[0140] Step 81, determining whether the coplanar node of the current node meets the condition; if so, executing step 82; otherwise, executing step 83; wherein the condition is a non-empty node encoded before the current node;
[0141] In some embodiments, step 81 can be executed when the current node is not the first node to be encoded; when the current node is the first node to be encoded, the attribute prediction value of the current node is assigned a constant to complete the intra-frame prediction of the node, wherein the constant can be any value, for example, the constant is 0.
[0142] It can be understood that the decoding order is consistent with the encoding order. Therefore, the first node to be encoded here refers to the first node sorted according to the specific encoding order.
[0143] Step 82, using the attribute reconstruction value of the coplanar node that meets the conditions as the attribute value;
[0144] It can be understood that if the coplanar node is a non-empty node encoded before the current node, it means that the attribute reconstruction value of the node is "available", so the attribute reconstruction value of the coplanar node can be used as the attribute value.
[0145] If the coplanar node does not meet the condition, that is, the coplanar node is an empty node or the coplanar node is not encoded before the current node, it means that the attribute reconstruction value of the node is "unavailable". At this time, the attribute value of the coplanar node that does not meet the condition can be obtained according to step 83, or the attribute value of the coplanar node that does not meet the condition can be obtained according to a preset first constant. For example, the preset first constant is used as the attribute value of the coplanar node that does not meet the condition. The first constant can be any value.
[0146] Step 83, reconstructing the value according to the attribute of the interpolation node to obtain the attribute value of the coplanar node that does not meet the condition; wherein the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a collinear node of the current node;
[0147] In some embodiments, step 83 can be implemented as follows: the attribute reconstruction value of one of all the interpolation nodes of the coplanar node that does not meet the condition is used as the attribute value of the coplanar node that does not meet the condition. It should be noted that the present application does not limit which of the attribute reconstruction values of all the interpolation nodes of the coplanar node that does not meet the condition is used as the attribute value of the coplanar node that does not meet the condition. For example, the attribute reconstruction value of the node whose distance (such as Euclidean distance) to the coplanar node is the smallest or less than the distance threshold among all the interpolation nodes can be used as the attribute value of the coplanar node that does not meet the condition.
[0148] Step 84, obtaining a predicted attribute value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer;
[0149] In some embodiments, step 84 can be implemented as follows: the M coplanar nodes are used as prediction nodes; and the attributes of the current node are predicted according to the attribute values of the prediction nodes to obtain the attribute prediction value of the current node. For example, the M coplanar nodes are all coplanar nodes of the current node, which is equivalent to determining all coplanar nodes that meet the conditions and all coplanar nodes that do not meet the conditions of the current node as the prediction nodes, which can improve the accuracy of intra-frame prediction of the current node, thereby improving coding efficiency.
[0150] In other embodiments, step 84 may also be implemented through steps 105 and 106 of the following embodiments.
[0151] It should be noted that M can be any value. In some embodiments, the M coplanar nodes are all coplanar nodes of the current node. In this way, when predicting the attribute of the current node, since the attribute values of all coplanar nodes are taken into account, the accuracy of intra-frame prediction can be further improved, thereby improving coding efficiency.
[0152] Of course, in other embodiments, the M coplanar nodes may not be all the coplanar nodes of the current node. For example, the M coplanar nodes include at least all the coplanar nodes encoded before the current node and one or more coplanar nodes not encoded before the current node; in this way, since the influence of one or more coplanar nodes not encoded before the current node on the attribute prediction is taken into account, the accuracy of intra-frame prediction can still be improved, thereby improving the coding efficiency.
[0153] It can be understood that in an embodiment of the present application, when predicting the attributes of the current node, the attribute reconstruction value of the coplanar node that does not meet the conditions of the current node is obtained by interpolating the attribute reconstruction value of the interpolation node of the coplanar node that does not meet the conditions; in this way, the electronic device can use the attribute reconstruction value of the coplanar node that does not meet the conditions to predict the attributes of the current node, that is, when the electronic device performs attribute prediction, compared with the related technology mentioned above, it not only performs intra-frame prediction based on the coplanar nodes that meet the conditions and the colinear nodes that meet the conditions, but also combines the attribute reconstruction values of the coplanar nodes that do not meet the conditions. It can be seen that this method takes into account more information for the attribute prediction of the current node, which can improve the accuracy of intra-frame prediction, thereby improving coding efficiency.
[0154] Accordingly, an embodiment of the present application provides an intra-frame prediction method, which is applicable to a decoding end. The method can be applied to an electronic device with information processing capabilities, and the electronic device can be a television, a projector, a mobile phone, a computer, a tablet computer, a virtual reality (VR) head-mounted device, or any other device with a point cloud video encoding and decoding function or only a decoding function. The function implemented by the intra-frame prediction method can be implemented by calling a program code by a processor in the electronic device, and of course the program code can be stored in a computer storage medium. It can be seen that the electronic device includes at least a processor and a storage medium.
[0155] Fig. 9 Schematic diagram of the implementation flow of the intra-frame prediction method of the present application embodiment. Fig. 9 As shown, the method may include the following steps 91 to 94:
[0156] Step 91, determining whether the coplanar node of the current node satisfies a condition; if so, executing step 92; otherwise, executing step 93; wherein the condition is a non-empty node decoded before the current node;
[0157] In some embodiments, step 91 can be executed when the current node is not the first node to be decoded; when the current node is the first node to be decoded, the attribute prediction value of the current node is assigned a constant to complete the intra-frame prediction of the node, wherein the constant can be any value, for example, the constant is 0.
[0158] It can be understood that the decoding order is consistent with the encoding order. Therefore, the first node to be decoded here refers to the first node sorted according to the specific encoding order.
[0159] Step 92, using the attribute reconstruction value of the coplanar node that meets the conditions as the attribute value;
[0160] It can be understood that if the coplanar node is a non-empty node decoded before the current node, it means that the attribute reconstruction value of the node is "available", so the attribute reconstruction value of the coplanar node can be used as the attribute value.
[0161] If the coplanar node does not meet the condition, that is, the coplanar node is an empty node or the coplanar node has not been decoded before the current node, it means that the attribute reconstruction value of the node is "unavailable". At this time, the attribute value of the coplanar node that does not meet the condition can be obtained according to step 93, or the attribute value of the coplanar node that does not meet the condition can be obtained according to a preset first constant. For example, the preset first constant is used as the attribute value of the coplanar node that does not meet the condition. The first constant can be any value.
[0162] Step 93, reconstructing the value according to the attribute of the interpolation node to obtain the attribute value of the coplanar node that does not meet the condition; wherein the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a collinear node of the current node;
[0163] In some embodiments, step 93 can be implemented as follows: the attribute reconstruction value of one of all the interpolation nodes of the coplanar node that does not meet the condition is used as the attribute value of the coplanar node that does not meet the condition. It should be noted that the present application does not limit which of the attribute reconstruction values of all the interpolation nodes of the coplanar node that does not meet the condition is used as the attribute value of the coplanar node that does not meet the condition. For example, the attribute reconstruction value of the node whose distance (such as Euclidean distance) to the coplanar node is the smallest or less than the distance threshold among all the interpolation nodes can be used as the attribute value of the coplanar node that does not meet the condition.
[0164] Step 94, obtaining a predicted attribute value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer;
[0165] In some embodiments, step 94 can be implemented as follows: the M coplanar nodes are used as prediction nodes; and the attributes of the current node are predicted according to the attribute values of the prediction nodes to obtain the attribute prediction value of the current node. For example, the M coplanar nodes are all coplanar nodes of the current node, which is equivalent to determining all coplanar nodes that meet the conditions and all coplanar nodes that do not meet the conditions of the current node as the prediction nodes, which can improve the accuracy of intra-frame prediction of the current node.
[0166] In other embodiments, step 94 may also be implemented through steps 115 and 116 of the following embodiments.
[0167] It should be noted that M can be any value. In some embodiments, the M coplanar nodes are all coplanar nodes of the current node. In this way, when predicting the attribute of the current node, the accuracy of intra-frame prediction can be further improved because the attribute values of all coplanar nodes are considered.
[0168] Of course, in other embodiments, the M coplanar nodes may not be all the coplanar nodes of the current node. For example, the M coplanar nodes at least include all the coplanar nodes decoded before the current node and one or more coplanar nodes not decoded before the current node; in this way, since the influence of one or more coplanar nodes not decoded before the current node on the attribute prediction is taken into account, the accuracy of intra-frame prediction can still be improved.
[0169] It can be understood that in the embodiment of the present application, when predicting the attributes of the current node, the attribute reconstruction value of the coplanar node that does not meet the conditions of the current node is obtained by interpolating the attribute reconstruction value of the interpolation node of the coplanar node that does not meet the conditions; in this way, the electronic device can use the attribute reconstruction value of the coplanar node that does not meet the conditions to predict the attributes of the current node, that is, when the electronic device performs attribute prediction, compared with the related technology mentioned above, it not only performs intra-frame prediction based on the coplanar nodes that meet the conditions and the colinear nodes that meet the conditions, but also combines the attribute reconstruction values of the coplanar nodes that do not meet the conditions. It can be seen that this method takes into account more information for the attribute prediction of the current node, which can improve the accuracy of intra-frame prediction.
[0170] The embodiment of the present application further provides an intra-frame prediction method, which is applied to an encoding end. Fig.10 Schematic diagram of the implementation flow of the intra-frame prediction method of the present application embodiment. Fig.10 As shown, the method may include the following steps 101 to 108:
[0171] Step 101, determine whether the coplanar node of the current node meets the condition; if yes, execute step 102; otherwise, execute step 103; wherein the condition is a non-empty node encoded before the current node;
[0172] Step 102, using the attribute reconstruction value of the coplanar node that meets the conditions as the attribute value;
[0173] Step 103, determining the weight value of each interpolation node of the coplanar node that does not meet the condition; wherein the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a collinear node of the current node;
[0174] In some embodiments, the interpolation node satisfies the condition. Thus, based on the weight value of each "available" interpolation node of the coplanar node that does not satisfy the condition, the attribute value of the coplanar node that does not satisfy the condition is obtained.
[0175] There are various methods for determining the weight value of the interpolation node. For example, the weight value of the interpolation node can be determined based on the Euclidean distance; or, for another example, a fixed constant can be assigned to the weight value of the interpolation node.
[0176] For example, in some embodiments, the weight value of the interpolation node that does not meet the condition is determined as a preset second constant; the weight value of the interpolation node that meets the condition is determined as a preset third constant. In this way, compared with the method of determining the weight value based on the Euclidean distance, this method of setting a fixed constant saves the weight value calculation process, thereby improving the coding efficiency.
[0177] It should be noted that the second constant and the third constant can be any value. For example, in some embodiments, the preset second constant is 0, and the preset third constant is 1; in this way, when determining the attribute value of the coplanar node that does not meet the condition, the interpolation node that does not meet the condition is not considered; in this way, the accuracy of the attribute reconstruction value of the coplanar node that does not meet the condition can be improved, thereby improving the accuracy of the attribute prediction value of the current node, thereby improving the coding efficiency.
[0178] Step 104, performing weighted average calculation on the attribute reconstruction value of each interpolation node according to the weight value of each interpolation node, to obtain the attribute value of the coplanar node that does not meet the condition;
[0179] Step 105, obtaining K predicted nodes according to the M coplanar nodes of the current node; wherein K is an integer greater than 0;
[0180] It should be noted that M can be any value. In some embodiments, the M coplanar nodes are all coplanar nodes of the current node.
[0181] In some embodiments, step 105 may be implemented by step 124 of the following embodiments.
[0182] It should be noted that the size of K is independent of the size of M. For different nodes, K may be greater than M, may be equal to M, or may be less than M. K can be any positive integer. For example, K is a power of 2. It can be understood that K is a power of 2, so that the weighted average operation can be quickly implemented through a divider composed of an adder, a multiplier, and a shifter, thereby improving the coding efficiency.
[0183] Step 106, predicting the attribute of the current node according to the attribute value of the predicted node to obtain the attribute prediction value of the current node;
[0184] In some embodiments, step 106 may be implemented by steps 125 to 128 of the following embodiments.
[0185] Step 107, parsing the residual of the current node from the received attribute code stream;
[0186] Step 108: Determine the attribute reconstruction value of the current node according to the attribute prediction value of the current node and the residual.
[0187] Accordingly, an embodiment of the present application further provides an intra-frame prediction method, which is applied to a decoding end. Fig.11 Schematic diagram of the implementation flow of the intra-frame prediction method of the present application embodiment. Fig.11 As shown, the method may include the following steps 111 to 118:
[0188] Step 111, determining whether the coplanar node of the current node meets the condition; if so, executing step 112; otherwise, executing step 113; wherein the condition is a non-empty node decoded before the current node;
[0189] Step 112, using the attribute reconstruction value of the coplanar node that meets the conditions as the attribute value;
[0190] Step 113, determining a weight value of each interpolation node of the coplanar node that does not meet the condition; wherein the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a collinear node of the current node;
[0191] In some embodiments, the interpolation node satisfies the condition. Thus, based on the weight value of each "available" interpolation node of the coplanar node that does not satisfy the condition, the attribute value of the coplanar node that does not satisfy the condition is obtained.
[0192] There are various methods for determining the weight value of the interpolation node. For example, the weight value of the interpolation node can be determined based on the Euclidean distance; or, for another example, a fixed constant can be assigned to the weight value of the interpolation node.
[0193] For example, in some embodiments, the weight value of the interpolation node that does not meet the condition is determined as a preset second constant; the weight value of the interpolation node that meets the condition is determined as a preset third constant. In this way, compared with the method of determining the weight value based on the Euclidean distance, this method of setting a fixed constant saves the calculation process of the weight value, thereby improving the decoding efficiency.
[0194] It should be noted that the second constant and the third constant can be any value. For example, in some embodiments, the preset second constant is 0, and the preset third constant is 1; in this way, when determining the attribute value of the coplanar node that does not meet the condition, the interpolation node that does not meet the condition is not considered; in this way, the accuracy of the attribute reconstruction value of the coplanar node that does not meet the condition can be improved, thereby improving the accuracy of the attribute prediction value of the current node.
[0195] Step 114, performing weighted average calculation on the attribute reconstruction value of each interpolation node according to the weight value of each interpolation node, to obtain the attribute value of the coplanar node that does not meet the condition;
[0196] Step 115, obtaining K predicted nodes according to the M coplanar nodes of the current node; wherein K is an integer greater than 0;
[0197] It should be noted that M can be any value. In some embodiments, the M coplanar nodes are all coplanar nodes of the current node.
[0198] In some embodiments, step 115 may be implemented by step 134 of the following embodiments.
[0199] It should be noted that the size of K is independent of the size of M. For different nodes, K may be greater than M, may be equal to M, or may be less than M. K can be any positive integer. For example, K is a power of 2. It can be understood that K is a power of 2, so that the weighted average operation can be quickly implemented through a divider composed of an adder, a multiplier, and a shifter, thereby improving the decoding efficiency.
[0200] Step 116, predicting the attribute of the current node according to the attribute value of the predicted node to obtain the attribute prediction value of the current node;
[0201] In some embodiments, step 116 may be implemented by steps 135 to 138 of the following embodiments.
[0202] Step 117, parsing the residual of the current node from the received attribute code stream;
[0203] Step 118: Determine the attribute reconstruction value of the current node according to the attribute prediction value of the current node and the residual.
[0204] The embodiment of the present application further provides an intra-frame prediction method, which is applied to an encoding end. Fig.12 Schematic diagram of the implementation flow of the intra-frame prediction method of the present application embodiment. Fig.12 As shown, the method may include the following steps 121 to 1210:
[0205] Step 121, determining whether the coplanar node of the current node meets the condition; if so, executing step 122; otherwise, executing step 123; wherein the condition is a non-empty node encoded before the current node;
[0206] Step 122, using the attribute reconstruction value of the coplanar node that meets the condition as the attribute value;
[0207] Step 123, reconstructing the value according to the attribute of the interpolation node to obtain the attribute value of the coplanar node that does not meet the condition; wherein the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a collinear node of the current node;
[0208] Step 124, according to the specific coding order of the M coplanar nodes of the current node, obtain K predicted nodes; wherein,
[0209] When the coplanar node is the coplanar node that meets the condition or the coplanar node that does not meet the condition and has at least one interpolation node that meets the condition, determining the coplanar node as the prediction node;
[0210] In the case where the total number of coplanar nodes that meet the condition and the coplanar nodes that do not meet the condition and at least one interpolation node that meets the condition is greater than or equal to K, the first K nodes in the nodes corresponding to the total number of nodes that are sorted in a specific coding order are determined as the predicted nodes; the specific coding order can be various. For example, the specific coding order is the Morton order. It can be understood that in most cases, the nodes that are closer to the front of the coding order may be closer to the attributes of the current node. Therefore, in an embodiment of the present application, the first K nodes in the nodes corresponding to the total number of nodes that are sorted in a specific coding order are used as predicted nodes, thereby improving the accuracy of intra-frame prediction.
[0211] When the total number of nodes is greater than 0 and less than K, the attribute value of the filling node is determined; the node corresponding to the total number of nodes and the filling node are determined as the predicted node. It can be understood that when the total number of nodes is insufficient, the number of nodes is supplemented by the filling method, and the attribute prediction value of the current node is determined based on this, which can improve the accuracy of the value.
[0212] For step 124, for example, assuming that K is a fixed number, such as K=2, assuming that M=6, and the M coplanar nodes are sorted in a specific coding order as 1, 2, 3, 4, 5 and 6, then step 124 can be implemented as follows: if coplanar node 1 is a coplanar node that meets the condition or a coplanar node that does not meet the condition and has at least one interpolation node that meets the condition, then the coplanar node 1 is used as a predicted node, and then the method for determining whether the coplanar node 1 is a predicted node is used to determine whether the coplanar node 2 is a second predicted node. If the coplanar node 2 is also a predicted node, then the coplanar node 1 is used as a predicted node. As prediction nodes, at this time, K prediction nodes have been selected, and the process ends without judging the subsequent coplanar nodes, but enters step 125; otherwise, if coplanar node 2 is a coplanar node that does not meet the conditions and all interpolation nodes of the node do not meet the conditions, the node will not be used as a prediction node, and it will continue to be judged whether coplanar node 3 can be used as a prediction node, and this process will continue until K prediction nodes are selected; of course, if after judging coplanar node 6, only one prediction node is finally selected, that is, less than K, then the filling method is used to make up the K prediction nodes.
[0213] There are many ways to fill. In some embodiments, the attribute value of the first node in the nodes corresponding to the total number of nodes sorted according to the specific coding order can be determined as the attribute value of the filling node; it can be understood that compared with using the attribute reconstruction values of other nodes as the filling value, the intra-frame prediction result is more accurate. Of course, in some embodiments, the attribute value of any one of the nodes corresponding to the total number of nodes can also be determined as the attribute value of the filling node.
[0214] In some other embodiments, the mean or weighted average of the attribute values of the nodes corresponding to the total number of nodes may be determined as the attribute value of the filling node; compared with the first embodiment, the intra-frame prediction result may be more accurate.
[0215] In some other embodiments, the average of the attribute values of the coplanar nodes and / or colinear nodes of the first node may be determined as the attribute value of the filling node; compared with the first embodiment, the intra-frame prediction result of this embodiment may be more accurate.
[0216] In other embodiments, a preset fourth constant may be determined as the attribute value of the filling node. Compared with the above three embodiments, using a fixed constant as the filling value can save the calculation process of the filling value while ensuring the accuracy of intra-frame prediction, thereby improving coding efficiency.
[0217] Step 125, determining whether each of the prediction nodes belongs to the coplanar node that does not meet the condition and whether all the interpolation nodes of each of the prediction nodes do not meet the condition; if yes, executing step 126; otherwise, executing step 127;
[0218] That is to say, when each of the prediction nodes belongs to the coplanar node that does not meet the condition and all the interpolation nodes of each of the prediction nodes do not meet the condition, step 126 is executed; it can be understood that in this case, the attribute prediction value of the current node is determined according to the attribute reconstruction value of the predecessor node of the current node; in this way, not only the intra-frame prediction of the current node can be realized, but also the prediction result is more accurate.
[0219] In the case where any of the predicted nodes is the coplanar node that meets the condition, or in the case where any of the predicted nodes is the coplanar node that does not meet the condition and at least one interpolation node of the coplanar node that does not meet the condition meets the condition, step 127 is performed.
[0220] Step 126 , determining the attribute prediction value of the current node according to the attribute reconstruction value of at least one node that has been encoded before the current node, and then proceeding to step 129 .
[0221] The number of attribute reconstruction values of nodes that have been encoded before the current node is used to predict the attribute, which is not limited in the embodiments of the present application. In some embodiments, the attribute reconstruction value of the node that has been encoded before the current node is determined as the attribute prediction value of the current node.
[0222] For example, when all prediction nodes are empty nodes, the Morton predecessor of the current node (i.e., the previous node in the Morton order, which must be encoded before the current node) is directly used as the prediction node, and the attribute prediction value is the attribute reconstruction value of the Morton predecessor.
[0223] It should be noted that M can be any value. In some embodiments, the M coplanar nodes are all coplanar nodes of the current node.
[0224] Step 127, determining a weight value of each prediction node;
[0225] The weight value of the prediction node can be determined based on the Euclidean distance, or it can be assigned a fixed constant. For example, in some embodiments, the weight value of each prediction node that meets the condition is determined as the preset fifth constant; the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and all interpolation nodes do not meet the condition is determined as the preset sixth constant; the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and at least one interpolation node meets the condition is determined as the preset seventh constant. In this way, compared with the method of determining the weight value based on the Euclidean distance, this method of setting a fixed constant saves the calculation process of the weight value, thereby improving the coding efficiency.
[0226] It should be noted that the fifth constant, the sixth constant and the seventh constant can be any values.
[0227] In some embodiments, the preset fifth constant and the preset seventh constant are 1, and the preset sixth constant is 0. In this way, when determining the attribute prediction value of the current node, the prediction node that belongs to the coplanar node that does not meet the condition and all interpolation nodes do not meet the condition is not considered; in this way, the accuracy of the attribute prediction value of the current node can be improved.
[0228] In some embodiments, the preset fifth constant is greater than or equal to the preset seventh constant. In this way, the accuracy of the attribute prediction value of the current node can be improved.
[0229] Step 128 , performing weighted average calculation on the attribute value of each prediction node according to the weight value of each prediction node, obtaining the attribute prediction value of the current node, and then proceeding to step 129 .
[0230] For step 128, in some embodiments, it can be implemented as follows: when the number of the prediction nodes is a power of 2, the attribute value of each prediction node is multiplied by the multiplier by the corresponding weight value to obtain a first operation result; the first operation result corresponding to each prediction node is added by the adder to obtain a second operation result; the second operation result and the number of the prediction nodes are shifted by the shifter to obtain the attribute prediction value of the current node. In this way, the weighted average calculation can be implemented by the multiplier, the adder and the shifter; thus, the attribute prediction value can be quickly obtained, thereby improving the coding efficiency.
[0231] Step 129, parsing the residual of the current node from the received attribute code stream;
[0232] Step 1210: Determine the attribute reconstruction value of the current node according to the attribute prediction value of the current node and the residual.
[0233] Accordingly, an embodiment of the present application further provides an intra-frame prediction method, which is applied to a decoding end. Fig.13 Schematic diagram of the implementation flow of the intra-frame prediction method of the present application embodiment. Fig.13 As shown, the method may include the following steps 131 to 1310:
[0234] Step 131, determine whether the coplanar node of the current node meets the condition; if yes, execute step 132; otherwise, execute step 133; wherein the condition is a non-empty node decoded before the current node;
[0235] Step 132, using the attribute reconstruction value of the coplanar node that meets the condition as the attribute value;
[0236] Step 133, reconstructing values according to the attributes of the interpolation nodes to obtain attribute values of the coplanar nodes that do not meet the conditions; wherein the interpolation nodes are both coplanar nodes of the coplanar nodes that do not meet the conditions and collinear nodes of the current node;
[0237] Step 134, according to the specific coding order of the M coplanar nodes of the current node, obtain K predicted nodes; wherein,
[0238] When the coplanar node is the coplanar node that meets the condition or the coplanar node that does not meet the condition and has at least one interpolation node that meets the condition, determining the coplanar node as the prediction node;
[0239] In the case where the total number of coplanar nodes that meet the condition and the coplanar nodes that do not meet the condition and at least one interpolation node that meets the condition is greater than or equal to K, the first K nodes in the nodes corresponding to the total number of nodes that are sorted in a specific coding order are determined as the predicted nodes; the specific coding order can be various. For example, the specific coding order is the Morton order. It can be understood that in most cases, the nodes that are closer to the front of the coding order may be closer to the attributes of the current node. Therefore, in an embodiment of the present application, the first K nodes in the nodes corresponding to the total number of nodes that are sorted in a specific coding order are used as predicted nodes, thereby improving the accuracy of intra-frame prediction.
[0240] When the total number of nodes is greater than 0 and less than K, the attribute value of the filling node is determined; the node corresponding to the total number of nodes and the filling node are determined as the predicted node. It can be understood that when the total number of nodes is insufficient, the number of nodes is supplemented by the filling method, and the attribute prediction value of the current node is determined based on this, which can improve the accuracy of the value.
[0241] For step 134, for example, assuming that K is a fixed number, such as K=2, assuming that M=6, and the M coplanar nodes are sorted in a specific coding order as 1, 2, 3, 4, 5 and 6, then step 134 can be implemented as follows: if coplanar node 1 is a coplanar node that meets the condition or a coplanar node that does not meet the condition and has at least one interpolation node that meets the condition, then the coplanar node 1 is used as a predicted node, and then the method for determining whether the coplanar node 1 is a predicted node is used to determine whether the coplanar node 2 is a second predicted node. If the coplanar node 2 is also a predicted node, then the coplanar node 1 is used as a predicted node. As prediction nodes, at this time, K prediction nodes have been selected, and the process ends without judging the subsequent coplanar nodes, but enters step 135; otherwise, if coplanar node 2 is a coplanar node that does not meet the conditions and all interpolation nodes of the node do not meet the conditions, the node will not be used as a prediction node, and it will continue to be judged whether coplanar node 3 can be used as a prediction node, and this process will continue until K prediction nodes are selected; of course, if after judging coplanar node 6, only one prediction node is finally selected, that is, less than K, then the filling method is used to make up the K prediction nodes.
[0242] There are many ways to fill. In some embodiments, the attribute value of the first node in the nodes corresponding to the total number of nodes sorted according to the specific coding order can be determined as the attribute value of the filling node; it can be understood that compared with using the attribute reconstruction values of other nodes as the filling value, the intra-frame prediction result is more accurate. Of course, in some embodiments, the attribute value of any one of the nodes corresponding to the total number of nodes can also be determined as the attribute value of the filling node.
[0243] In some other embodiments, the mean or weighted average of the attribute values of the nodes corresponding to the total number of nodes may be determined as the attribute value of the filling node; compared with the first embodiment, the intra-frame prediction result may be more accurate.
[0244] In some other embodiments, the average of the attribute values of the coplanar nodes and / or colinear nodes of the first node may be determined as the attribute value of the filling node; compared with the first embodiment, the intra-frame prediction result of this embodiment may be more accurate.
[0245] In some other embodiments, a preset fourth constant may also be determined as the attribute value of the filling node. Compared with the above three embodiments, using a fixed constant as the filling value can save the calculation process of the filling value while ensuring the accuracy of intra-frame prediction, thereby improving decoding efficiency.
[0246] Step 135, determining whether each of the predicted nodes belongs to the coplanar node that does not meet the condition and whether all interpolation nodes of each of the predicted nodes do not meet the condition; if yes, executing step 136; otherwise, executing step 137;
[0247] That is to say, when each of the prediction nodes belongs to the coplanar node that does not meet the conditions and all the interpolation nodes of each of the prediction nodes do not meet the conditions, step 136 is executed; it can be understood that in this case, the attribute prediction value of the current node is determined according to the attribute reconstruction value of the predecessor node of the current node; in this way, not only the intra-frame prediction of the current node can be realized, but also the prediction result is more accurate.
[0248] In the case where any of the predicted nodes is the coplanar node that meets the condition, or in the case where any of the predicted nodes is the coplanar node that does not meet the condition and at least one interpolation node of the coplanar node that does not meet the condition meets the condition, step 137 is performed.
[0249] Step 136 , determining the attribute prediction value of the current node according to the attribute reconstruction value of at least one node that has been decoded before the current node, and then proceeding to step 139 .
[0250] There is no limitation in the embodiments of the present application on how many attribute reconstruction values of nodes that have been decoded before the current node are used to predict the attribute. In some embodiments, the attribute reconstruction value of the node that has been decoded before the current node is determined as the attribute prediction value of the current node.
[0251] For example, when all prediction nodes are empty nodes, the Morton predecessor of the current node (i.e., the previous node in the Morton order, which must be decoded before the current node) is directly used as the prediction node, and the attribute prediction value is the attribute reconstruction value of the Morton predecessor.
[0252] It should be noted that M can be any value. In some embodiments, the M coplanar nodes are all coplanar nodes of the current node.
[0253] Step 137, determining a weight value of each prediction node;
[0254] The weight value of the prediction node can be determined based on the Euclidean distance, or it can be assigned a fixed constant. For example, in some embodiments, the weight value of each prediction node that meets the condition is determined as the preset fifth constant; the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and all interpolation nodes do not meet the condition is determined as the preset sixth constant; the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and at least one interpolation node meets the condition is determined as the preset seventh constant. In this way, compared with the method of determining the weight value based on the Euclidean distance, this method of setting a fixed constant saves the calculation process of the weight value, thereby improving the decoding efficiency.
[0255] It should be noted that the fifth constant, the sixth constant and the seventh constant can be any values.
[0256] In some embodiments, the preset fifth constant and the preset seventh constant are 1, and the preset sixth constant is 0. In this way, when determining the attribute prediction value of the current node, the prediction node that belongs to the coplanar node that does not meet the condition and all interpolation nodes do not meet the condition is not considered; in this way, the accuracy of the attribute prediction value of the current node can be improved.
[0257] In some embodiments, the preset fifth constant is greater than or equal to the preset seventh constant. In this way, the accuracy of the attribute prediction value of the current node can be improved.
[0258] Step 138 , performing weighted average calculation on the attribute value of each prediction node according to the weight value of each prediction node, obtaining the attribute prediction value of the current node, and then proceeding to step 139 .
[0259] For step 138, in some embodiments, it can be implemented as follows: when the number of the prediction nodes is a power of 2, the attribute value of each prediction node is multiplied by the multiplier by the corresponding weight value to obtain a first operation result; the first operation result corresponding to each prediction node is added by the adder to obtain a second operation result; the second operation result and the number of the prediction nodes are shifted by the shifter to obtain the attribute prediction value of the current node. In this way, the weighted average calculation can be implemented by the multiplier, the adder and the shifter; thus, the attribute prediction value can be quickly obtained, thereby improving the decoding efficiency.
[0260] Step 139, parsing the residual of the current node from the received attribute code stream;
[0261] Step 1310: Determine the attribute reconstruction value of the current node according to the attribute prediction value of the current node and the residual.
[0262] An embodiment of the present application provides a point cloud encoding method, which includes: executing the steps in the intra-frame prediction method described in the encoding end on the current node of the point cloud to obtain an attribute prediction value of the current node; determining the residual between the attribute prediction value of the current node and the original attribute value of the current node; and encoding the residual of the current node into an attribute code stream.
[0263] It should be noted that the description of the above encoding method embodiment is similar to the description of the above encoding end intra-frame prediction method embodiment, and has similar beneficial effects as the method embodiment. For technical details not disclosed in the encoding method embodiment of the present application, please refer to the description of the encoding end intra-frame prediction method embodiment of the present application for understanding.
[0264] An embodiment of the present application provides a point cloud decoding method, which includes: parsing a received attribute code stream to obtain a residual of a current node; executing the steps in the intra-frame prediction method described at the decoding end on the current node to obtain an attribute prediction value of the current node; and determining an attribute reconstruction value of the current node based on the attribute prediction value of the current node and the residual.
[0265] It should be noted that the description of the above decoding method embodiment is similar to the description of the above decoding end intra-frame prediction method embodiment, and has similar beneficial effects as the method embodiment. For technical details not disclosed in the decoding method embodiment of the present application, please refer to the description of the decoding end intra-frame prediction method embodiment of the present application for understanding.
[0266] The following describes an exemplary application of the embodiments of the present application in a practical application scenario.
[0267] The technical solution of the embodiment of the present application is implemented at both the encoding and decoding ends. The technical solution of the embodiment of the present application is implemented when performing intra-frame prediction. For all points, the technical solution proposes an intra-frame prediction enhancement algorithm based on the interpolation process.
[0268] The first concept that needs to be defined is the "availability" of the prediction node. When the prediction node of the current node can be encoded before the current node and is a non-empty node, the prediction node is said to be available. If any condition is not met, it is unavailable. For the decoding end, when the prediction node of the current node can be decoded before the current node and is a non-empty node, the prediction node is said to be available. If any condition is not met, it is unavailable.
[0269] An embodiment of the intra-frame prediction part at the encoding end is as follows, namely, the embodiment 1 referred to below. The geometrically reconstructed point cloud is recursively divided into a number of cube voxels by an octree, and the nodes in each voxel are subjected to the intra-frame prediction process according to the Morton coding order, so as to calculate the attribute prediction value. The first node to be encoded is subjected to the processes a3), e3) and f3), and the remaining points are subjected to the processes b3), c3), d3), e3) and f3):
[0270] a3) When the current node is the first node to be encoded, there is no reference point for prediction, and the attribute prediction value of the current node is directly set to 0;
[0271] b3) If Fig.14 As shown, all coplanar nodes 3, 5, 6, 14, 21 and 35 of the current node are used as prediction nodes. When the prediction node is available, the attribute value is reconstructed with reference to the attribute value of the available prediction node. When the prediction node is not available, step c3) is executed to interpolate the attribute value of the unavailable prediction node.
[0272] c3) The attribute value of the unavailable prediction node is interpolated through the attribute reconstruction value of the interpolation node of the unavailable prediction node (which is also the collinear node of the current node). The interpolation method is shown in the following formula (16). The weighted average of the attribute reconstruction values of all interpolation nodes is calculated according to this formula. Among them, the interpolation node of the unavailable prediction node is as follows Fig.15 shown.
[0273]
[0274] in, is the reconstructed value of the attribute of interpolation node j; the weight value is obtained as follows: if for an unavailable prediction node i, its interpolation node j is unavailable, then w j =0, otherwise w j = 1. When all interpolation nodes of an unavailable prediction node are unavailable, interpolation fails and the weight of this unavailable prediction node is 0;
[0275] d3) According to the following formula (17), the weighted average of the attribute values of all predicted nodes is calculated as the attribute prediction value of the current node:
[0276]
[0277] in, is the attribute value of the predicted node, w i is the weight of the predicted node. When the predicted node is an unavailable node and interpolation fails, w i =0, otherwise w i =1.
[0278] Assuming that all predicted nodes are coplanar nodes that do not meet the conditions and interpolation fails, the Morton predecessor of the current node (i.e., the previous node in the Morton order, which must be decoded before the current node) is directly used as the predicted node, and the attribute prediction value is the attribute reconstruction value of the Morton predecessor;
[0279] e3) The residual is the difference between the original attribute value of the current node and the attribute prediction value, and then the residual is transformed, quantized, and other operations are performed;
[0280] f3) The attribute prediction value is superimposed with the residual information after inverse quantization, inverse transformation and other operations to obtain the attribute reconstruction value of the current node, which is used as reference information for subsequent coding units.
[0281] The intra-frame prediction embodiment at the decoding end is as follows, namely, the embodiment 1 referred to below. The geometrically reconstructed point cloud is recursively divided into a number of cube voxels by an octree, and the nodes in each voxel are subjected to the intra-frame prediction process respectively according to the same Morton order as the encoding process, so as to calculate the attribute prediction value, and the following a4) and e4) processes are performed for the first decoded node, and the following b4), c4), d4) and e4) processes are performed for the remaining points:
[0282] a4) When the current node is the first node to be decoded, there is no reference point for prediction, and its attribute prediction value is directly set to 0;
[0283] b4) taking all coplanar nodes 3, 5, 6, 14, 21 and 35 of the current node as prediction nodes, when the prediction nodes are available, the attribute values are reconstructed with reference to the attribute values of the available prediction nodes, and when the prediction nodes are not available, executing step c4) to interpolate the attribute values of the unavailable prediction nodes;
[0284] c4) The attribute value of the unavailable prediction node is obtained by interpolating the attribute reconstruction value of the interpolation node of the unavailable prediction node (which is also the collinear node of the current node). The interpolation method is shown in the following formula (18). The weighted average value of the attribute reconstruction values of all interpolation nodes is calculated according to this formula:
[0285]
[0286] in, is the reconstructed value of the attribute of interpolation node j; the weight value is obtained as follows: if for an unavailable prediction node i, its interpolation node j is unavailable, then w j =0, otherwise w j = 1. When all interpolation nodes of an unavailable prediction node are unavailable, interpolation fails and the weight of this unavailable prediction node is 0;
[0287] d4) Calculate the weighted average of the attribute values of all predicted nodes according to the following formula (19), and use this value as the attribute prediction value of the current node:
[0288]
[0289] in, is the attribute value of the predicted node, w i is the weight of the predicted node. When the predicted node is an unavailable node and interpolation fails, w i =0, otherwise w i =1.
[0290] Assuming that all prediction nodes are unavailable and interpolation fails, the Morton predecessor of the current node (i.e., the previous node in the Morton order, which must be decoded before the current node) is directly used as the prediction node, and the attribute prediction value is the attribute reconstruction value of the Morton predecessor;
[0291] e4) Read the residual information of the current node from the bitstream, and superimpose it with the attribute prediction value of the current node after inverse quantization, inverse transformation and other operations to obtain the attribute reconstruction value of the current node, which is used as reference information for subsequent decoding units.
[0292] It should be noted that the technical solution of the above embodiment 1 is used in Figure 3A and 3B The intra prediction part in the coding and decoding framework shown.
[0293] The intra-frame prediction enhancement technology based on the interpolation process can adopt a variety of interpolation methods, including but not limited to weighted average, adjacent point copy, filling fixed value, etc.;
[0294] The intra-frame prediction enhancement technology based on the interpolation process can adopt a variety of weight value selection methods, including but not limited to weights based on Euclidean distance, fixed constant weights, etc.
[0295] Another embodiment of the intra-frame prediction part of the coding end of the present technical solution is as follows, namely, the embodiment 2 as referred to below. The geometrically reconstructed point cloud is recursively divided into a number of cube voxels by an octree, and the nodes in each voxel are subjected to the intra-frame prediction process respectively according to the Morton coding order, so as to calculate the attribute prediction value. The a5), f5) and g5) processes are performed for the first node to be coded, and the b5), c5), d5), e5), f5) and g5) processes are performed for the remaining points:
[0296] a5) When the current node is the first node to be encoded, there is no reference point for prediction, and its attribute prediction value is directly set to 0;
[0297] b5) taking K nodes among all coplanar nodes 3, 5, 6, 14, 21 and 35 of the current node as prediction nodes, the selection method is as described in step d5); when the node is available, reconstructing the value with reference to the attribute of the available node, and when the node is not available, executing step c5) to interpolate the attribute value of the unavailable node;
[0298] c5) The attribute value of the unavailable node is obtained by interpolating the attribute reconstruction value of the interpolation node of the unavailable node (which is also the collinear node of the current node). The interpolation method is shown in the following formula (20). The weighted average value of the attribute reconstruction values of all interpolation nodes is calculated according to this formula:
[0299]
[0300] in, is the reconstructed value of the attribute of interpolation node j; the weight value is obtained as follows: if for an unavailable node i, its interpolation node j is unavailable, then w j =0, otherwise w j = 1. When all interpolation nodes of the coplanar nodes that do not meet the conditions are unavailable, the interpolation fails and the weight of this unavailable node is 0;
[0301] d5) The reference range is the available nodes in 3, 5, 6, 14, 21 and 35 plus the unavailable nodes that have been successfully interpolated. If the reference range is greater than or equal to K, the first K nodes in the reference range are directly used as prediction nodes; if the reference range is greater than 0 and less than K, the attribute value of the first node in the reference range is used as the filling value, the reference range size is filled to K, and these K nodes are used as prediction nodes;
[0302] e5) Calculate the weighted average of the attribute values of all predicted nodes according to the following formula (21), and use this value as the attribute prediction value of the current node:
[0303]
[0304] in, is the attribute value of the predicted node, w i is the weight of the prediction node, w i =1.
[0305] Assuming that all prediction nodes are unavailable and interpolation fails, the Morton predecessor of the current node (i.e., the previous node in the Morton order, which must be decoded before the current node) is directly used as the prediction node, and the attribute prediction value is the attribute reconstruction value of the Morton predecessor;
[0306] f5) The residual is the difference between the original attribute value of the current node and the attribute prediction value, and then the residual is transformed, quantized, and other operations are performed;
[0307] g5) Superimpose the attribute prediction value with the residual information after inverse quantization, inverse transformation and other operations to obtain the attribute reconstruction value of the current node as reference information for subsequent coding units.
[0308] The intra-frame prediction implementation of the present technical solution at the decoding end is as follows, namely, the implementation 2 referred to below. The geometrically reconstructed point cloud is recursively divided into a number of cube voxels by an octree, and the nodes in each voxel are subjected to the intra-frame prediction process to calculate the attribute prediction value according to the same Morton order as the encoding process. The first decoded node is subjected to the a6) and f6) processes, and the remaining points are subjected to the b6), c6), d6), e6) and f6) processes:
[0309] a6) When the current node is the first node to be decoded, there is no reference point for prediction, and its attribute prediction value is directly set to 0;
[0310] b6) taking K nodes among all coplanar nodes 3, 5, 6, 14, 21 and 35 of the current node as prediction nodes, the selection method is as described in step d6); when the node is available, the attribute value is reconstructed with reference to the attribute value of the available node, and when the node is not available, the attribute value of the unavailable node is interpolated by executing step c6);
[0311] c6) The attribute value of the unavailable node is obtained by interpolating the attribute reconstruction value of the interpolation node of the unavailable node (which is also the collinear node of the current node). The interpolation method is shown in the following formula (22). The weighted average value of the attribute reconstruction values of all interpolation nodes is calculated according to this formula:
[0312]
[0313] in, is the reconstructed value of the attribute of interpolation node j; the weight value is obtained as follows: if for an unavailable node i, its interpolation node j is unavailable, then w j =0, otherwise w j= 1. When all interpolation nodes of an unavailable node are unavailable, the interpolation fails and the weight of this unavailable node is 0;
[0314] d6) The reference range is the available nodes in 3, 5, 6, 14, 21 and 35 plus the unavailable nodes that have been successfully interpolated. If the reference range is greater than or equal to K, the first K nodes in the reference range are directly used as prediction nodes; if the reference range is greater than 0 and less than K, the attribute value of the first node in the reference range is used as the filling value, the reference range size is filled to K, and these K nodes are used as prediction nodes;
[0315] e6) Calculate the weighted average of the attribute values of all predicted nodes according to the following formula (23), and use this value as the attribute prediction value of the current node:
[0316]
[0317] in, is the attribute value of the predicted node, w i is the weight of the prediction node, w i =1.
[0318] Assuming that all prediction nodes are unavailable and interpolation fails, the Morton predecessor of the current node (i.e., the previous node in the Morton order, which must be decoded before the current node) is directly used as the prediction node, and the attribute prediction value is the attribute reconstruction value of the Morton predecessor;
[0319] f6) Read the residual information of the current node from the bitstream, and superimpose it with the attribute prediction value of the current node after inverse quantization, inverse transformation and other operations to obtain the attribute reconstruction value of the current node, which is used as reference information for subsequent decoding units.
[0320] The technical solution of embodiment 2 acts on Figure 3A and Figure 3B The intra prediction part in the coding and decoding framework shown.
[0321] The intra-frame prediction enhancement technology based on the interpolation process can adopt a variety of interpolation methods, including but not limited to weighted average, adjacent point copy, filling fixed value, etc.;
[0322] The intra-frame prediction enhancement technology based on the interpolation process can adopt a variety of weight value selection methods, including but not limited to weights based on Euclidean distance, fixed constant weights, etc.
[0323] The intra-frame prediction enhancement technology based on the interpolation process can adopt a variety of filling methods, including but not limited to filling the attribute value of the first node, filling a fixed constant, filling the average value of the surrounding points, etc. The value of K can be any constant. If K is a power of 2, when calculating the attribute prediction value of the current node in the encoding and decoding steps e5) and e6), the division can use a binary shift operation.
[0324] The technical solution of the embodiment of the present application can be applied to the encoding and decoding part of intra-frame prediction, make full use of the reference information around the current node, use the interpolation algorithm to derive the reconstructed attribute value of the unavailable prediction node of the current node, optimize the intra-frame prediction scheme, improve the accuracy of intra-frame prediction, and thus improve the coding efficiency.
[0325] The technical solutions of the embodiments of the present application were tested on AVS's latest point cloud compression platform PCRM1.0. The test results obtained under the algorithm described in Example 1 are shown in Tables 1 to 4, and the test results obtained under the algorithm described in Example 2 are shown in Tables 5 to 8.
[0326] Among them, Table 1 shows the test results of Example 1 on two types of data sets, Cat1B and Cat3, under the condition C1 (C1-limit-lossy geometry, lossy attributes) of limited lossy geometry and lossy attributes. As shown in Table 1, compared with the performance of the PCRM benchmark platform, Example 1 has improved EtE BD-rate in the three dimensions of color attributes Y, Cb and Cr. For example, for the test results of Cat1B, on the Y attribute, the EtE BD-rate is improved by 2.8% compared with the performance of the PCRM benchmark platform. For another example, for the test results of Cat3, on the Cr attribute, the EtE BD-rate is improved by 5.4% compared with the performance of the PCRM benchmark platform.
[0327] Table 1C1-limit-lossy geometry,lossy attributes
[0328]
[0329] Table 2 shows the test results of Example 1 for two types of data sets, Cat1B and Cat3, under the condition C2 (C2-lossless geometry, lossy attributes). As shown in Table 2, compared with the performance of the PCRM benchmark platform, Example 1 has improved EtE BD-rate in the three dimensions of color attributes Y, Cb and Cr. For example, for the test results of Cat1B, on the Y attribute, the EtE BD-rate is improved by 1.6% compared with the performance of the PCRM benchmark platform. For another example, for the test results of Cat3, on the Cr attribute, the EtE BD-rate is improved by 10% compared with the performance of the PCRM benchmark platform.
[0330] Table 2C2-lossless geometry,lossy attributes
[0331]
[0332] Table 3 shows the test results of Example 1 for two types of data sets, Cat1B and Cat3, under the condition C3 (C3-lossless geometry, limit-lossy attributes) of lossless geometry and limited-lossy attributes. As shown in Table 3, compared with the performance of the PCRM benchmark platform, Example 1 has improved EtE BD-rate in the three dimensions of color attributes Y, Cb and Cr. For example, for the test results of Cat1B, on the Cb attribute, the EtE BD-rate is improved by 0.6% compared with the performance of the PCRM benchmark platform. For another example, for the test results of Cat3, on the Cr attribute, the EtE BD-rate is improved by 10.2% compared with the performance of the PCRM benchmark platform.
[0333] Table 3C3-lossless geometry,limit-lossy attributes
[0334]
[0335] Table 4 shows the test results of Example 1 on two types of data sets, Cat1B and Cat3, under the condition C4 (C4-lossless geometry, lossless attributes). As shown in Table 4, compared with the performance of the PCRM benchmark platform, Example 1 has improved bpip ratio in color attributes. For example, for the test results of Cat1B, the bpip ratio is 99.7% of the bit stream output by the PCRM benchmark platform, that is, the size of the bit stream is reduced by 0.3% compared to the size of the bit stream output by the PCRM benchmark platform. For another example, for the test results of Cat3, the bpip ratio is 98.5% of the bit stream output by the PCRM benchmark platform, that is, the size of the bit stream is reduced by 1.5% compared to the size of the bit stream output by the PCRM benchmark platform. It can be seen that Example 1 can obtain better distortion with fewer codewords.
[0336] Table 4C4-lossless geometry,lossless attributes
[0337]
[0338] Table 5 shows the test results of Example 2 on two types of data sets, Cat1B and Cat3, under the condition C1 (C1-limit-lossygeometry, lossy attributes) of limited-lossy geometry and lossy attributes.
[0339] Table 5C1-limit-lossy geometry,lossy attributes
[0340]
[0341] Table 6 shows the test results of Example 2 on two types of data sets, Cat1B and Cat3, under the condition C2 (lossless geometry, lossy attributes)
[0342] Table 6C2-lossless geometry,lossy attributes
[0343]
[0344] Table 7 shows the test results of Example 2 on two types of data sets, Cat1B and Cat3, under the condition C3 (C3-lossless geometry, limit-lossy attributes) of lossless geometry and limit-lossy attributes.
[0345] Table 7C3-lossless geometry,limit-lossy attributes
[0346]
[0347] Table 8 shows the test results of Example 2 on two types of data sets, Cat1B and Cat3, under the condition C4 (C4-lossless geometry, lossless attributes).
[0348] Table 8C4-lossless geometry,lossless attributes
[0349]
[0350] It can be seen from the above table that, compared with the PCRM benchmark platform, both embodiments have obvious performance improvements.
[0351] The technical solution of the embodiment of the present application proposes to use an interpolation algorithm to derive the predicted node attribute value of the current node during the intra-frame prediction process, optimize the intra-frame prediction scheme, improve the accuracy of intra-frame prediction, and effectively improve the coding efficiency; the key lies in:
[0352] (1) It is proposed to use the six coplanar nodes of the current node as prediction nodes;
[0353] (2) It is proposed to use interpolation method to obtain the attribute values of unavailable nodes;
[0354] (3) It is proposed to use the collinear nodes of the current node to interpolate the unavailable nodes of the current node;
[0355] (4) Propose a fixed number of prediction nodes and use a fill operation for insufficient number of prediction nodes;
[0356] (5) Based on the above 4, it is proposed that when the fixed number is a power of 2, the division can be simplified to a binary shift operation when calculating the attribute prediction value of the current node.
[0357] In some embodiments, the interpolation method using weighted average in Embodiment 1 may be replaced by other methods for generating interpolation values, such as adjacent point copying, filling with fixed values, etc.;
[0358] In some embodiments, the constant weight value in Embodiment 1 is set to other values, such as a weight based on Euclidean distance;
[0359] In some embodiments, the method of filling the attribute value of the first node in Example 2 is changed to fixed value filling, average value filling, adjacent point filling, etc.
[0360] Based on the foregoing embodiments, the intra-frame prediction device provided in the embodiments of the present application, including the modules included and the units included in the modules, can be implemented by an encoder or a processor in an electronic device; of course, it can also be implemented by a specific logic circuit; in the implementation process, the processor can be a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP), a field programmable gate array (FPGA) or a graphics processing unit (Graphics Processing Unit, GPU), etc.
[0361] Fig.16 Schematic diagram of the structure of the intra-frame prediction device according to the embodiment of the present application. Fig.16 As shown, the device 16 includes a determination module 161, an interpolation module 162 and a prediction module 163, wherein:
[0362] A determination module 161 is used to determine whether a coplanar node of a current node satisfies a condition; the condition is a non-empty node encoded before the current node; if yes, the attribute reconstruction value of the coplanar node that satisfies the condition is used as the attribute value; otherwise, the interpolation module 162 is executed;
[0363] The interpolation module 162 is used to reconstruct the value according to the attribute of the interpolation node, and obtain the attribute value of the coplanar node that does not meet the condition, wherein the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a colinear node of the current node, and the condition is a non-empty node encoded before the current node; or, according to a preset first constant, obtain the attribute value of the coplanar node that does not meet the condition, and the condition is a non-empty node encoded before the current node.
[0364] Prediction module 163, used to obtain the attribute prediction value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer
[0365] In some embodiments, the interpolation module 162 is used to: determine the weight value of each interpolation node; and perform weighted average calculation on the attribute reconstruction value of each interpolation node according to the weight value of each interpolation node to obtain the attribute value of the coplanar node that does not meet the conditions.
[0366] In some embodiments, the interpolation module 162 is used to: determine the weight value of the interpolation node that does not meet the condition as a preset second constant; determine the weight value of the interpolation node that meets the condition as a preset third constant.
[0367] In some embodiments, the preset second constant is 0, and the preset third constant is 1.
[0368] In some embodiments, the interpolation node satisfies the condition.
[0369] In some embodiments, the interpolation module 162 is used to: use the attribute reconstruction value of one node among all the interpolation nodes of the coplanar node that does not meet the condition as the attribute value of the coplanar node that does not meet the condition.
[0370] In some embodiments, the prediction module 163 is used to: use the M coplanar nodes as prediction nodes; and predict the attributes of the current node according to the attribute values of the prediction nodes to obtain the attribute prediction value of the current node.
[0371] In some embodiments, the prediction module 163 is used to: obtain K prediction nodes based on the M coplanar nodes; wherein K is an integer greater than 0; and predict the attributes of the current node based on the attribute values of the prediction nodes to obtain the attribute prediction value of the current node.
[0372] In some embodiments, K is a power of 2.
[0373] In some embodiments, the prediction module 163 is used to: obtain K prediction nodes according to the specific coding order of the M coplanar nodes; wherein, when the coplanar node is the coplanar node that meets the condition or the coplanar node that does not meet the condition and has at least one interpolation node that meets the condition, the coplanar node is determined as the prediction node; when the total number of the coplanar nodes that meet the condition and the coplanar nodes that do not meet the condition and has at least one interpolation node that meets the condition is greater than or equal to K, the first K nodes sorted in the specific coding order among the nodes corresponding to the total number of nodes are determined as the prediction nodes; when the total number of nodes is greater than 0 and less than K, determine the attribute value of the filler node; and determine the node corresponding to the total number of nodes and the filler node as the prediction node.
[0374] In some embodiments, the prediction module 163 is used to: determine the attribute value of the first node among the nodes corresponding to the total number of nodes and sorted according to the specific coding order as the attribute value of the filling node; or, determine the mean of the attribute values of the nodes corresponding to the total number of nodes as the attribute value of the filling node; or, determine the mean of the attribute values of the coplanar nodes and / or colinear nodes of the first node as the attribute value of the filling node; or, determine a preset fourth constant as the attribute value of the filling node.
[0375] In some embodiments, the prediction module 163 is used to: determine the weight value of each of the prediction nodes when any of the prediction nodes satisfies the condition, or when any of the prediction nodes is a coplanar node that does not satisfy the condition and at least one interpolation node of the coplanar node that does not satisfy the condition satisfies the condition; and perform weighted average calculation on the attribute value of each of the prediction nodes according to the weight value of each of the prediction nodes to obtain the attribute prediction value of the current node.
[0376] In some embodiments, the prediction module 163 is used to: determine the weight value of each prediction node that meets the condition as a preset fifth constant; determine the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and all the interpolation nodes do not meet the condition as a preset sixth constant; determine the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and at least one interpolation node meets the condition as the preset seventh constant.
[0377] In some embodiments, the preset fifth constant is greater than or equal to the preset seventh constant.
[0378] In some embodiments, the prediction module 163 is used to: when the number of the prediction nodes is a power of 2, multiply the attribute value of each prediction node by the corresponding weight value through a multiplier to obtain a first operation result; add the first operation result corresponding to each prediction node through an adder to obtain a second operation result; and shift the second operation result and the number of prediction nodes through a shifter to obtain the attribute prediction value of the current node.
[0379] In some embodiments, the prediction module 163 is also used to: when each of the prediction nodes belongs to the coplanar node that does not meet the condition and all the interpolation nodes of each of the prediction nodes do not meet the condition, determine the attribute prediction value of the current node according to the attribute reconstruction value of at least one node that has been encoded before the current node.
[0380] In some embodiments, the prediction module 163 is used to: determine the attribute reconstruction value of the node that has been encoded before the current node as the attribute prediction value of the current node.
[0381] In some embodiments, the M coplanar nodes are all coplanar nodes of the current node.
[0382] The description of the embodiment of the above device 16 is similar to the description of the embodiment of the intra-frame prediction method of the encoding end, and has similar beneficial effects as these method embodiments. For technical details not disclosed in the embodiment of the device of the present application, please refer to the description of the embodiment of the intra-frame prediction method of the encoding end of the present application for understanding.
[0383] Based on the foregoing embodiments, the encoding device provided in the embodiments of the present application, including the modules included and the units included in the modules, can be implemented by an encoder or processor in an electronic device; of course, it can also be implemented by a specific logic circuit; in the implementation process, the processor can be a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP), a field programmable gate array (FPGA) or a graphics processing unit (Graphics Processing Unit, GPU), etc.
[0384] Fig.17 This is a schematic diagram of the structure of the encoding device according to the embodiment of the present application. Fig.17 As shown, the device 17 includes: an intra-frame prediction module 171, a determination module 172 and an encoding module 173; wherein,
[0385] The intra-frame prediction module 171 is used to obtain a predicted attribute value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer;
[0386] The attribute value of the coplanar node that meets the condition is the attribute reconstruction value, and the attribute value of the coplanar node that does not meet the condition is obtained according to the attribute reconstruction value of the interpolation node, and the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a collinear node of the current node, and the condition is a non-empty node encoded before the current node; or,
[0387] The attribute value of the coplanar node that meets the condition is the attribute reconstruction value. For the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to a preset first constant. The condition is a non-empty node encoded before the current node.
[0388] A determination module 172, configured to determine a residual between a predicted attribute value of the current node and an original attribute value of the current node;
[0389] The encoding module 173 is used to encode the residual of the current node into an attribute code stream.
[0390] The description of the embodiment of the above device 17 is similar to the description of the embodiment of the above device 16 and the embodiment of the intra-frame prediction method of the encoding end, and has similar beneficial effects as these method embodiments. For technical details not disclosed in the embodiment of the device of the present application, please refer to the description of the embodiment of the intra-frame prediction method of the encoding end of the present application for understanding.
[0391] Based on the foregoing embodiments, the intra-frame prediction device provided in the embodiments of the present application, including the modules included and the units included in the modules, can be implemented by a decoder or a processor in an electronic device; of course, it can also be implemented by a specific logic circuit; in the implementation process, the processor can be a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP), a field programmable gate array (FPGA) or a graphics processing unit (Graphics Processing Unit, GPU), etc.
[0392] Fig.18 Schematic diagram of the structure of the intra-frame prediction device according to the embodiment of the present application. Fig.18 As shown, the device 18 includes a determination module 181, an interpolation module 182 and a prediction module 183, wherein:
[0393] A determination module 181 is used to determine whether a coplanar node of a current node satisfies a condition; the condition is a non-empty node decoded before the current node; if yes, the attribute reconstruction value of the coplanar node that satisfies the condition is used as the attribute value; otherwise, the interpolation module 182 is executed;
[0394] The interpolation module 182 is used to reconstruct the value according to the attribute of the interpolation node, and obtain the attribute value of the coplanar node that does not meet the condition, wherein the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a colinear node of the current node, and the condition is a non-empty node decoded before the current node; or, according to a preset first constant, obtain the attribute value of the coplanar node that does not meet the condition, and the condition is a non-empty node decoded before the current node.
[0395] Prediction module 183, used to obtain the attribute prediction value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer
[0396] In some embodiments, the interpolation module 182 is used to: determine the weight value of each interpolation node; and perform weighted average calculation on the attribute reconstruction value of each interpolation node according to the weight value of each interpolation node to obtain the attribute value of the coplanar node that does not meet the conditions.
[0397] In some embodiments, the interpolation module 182 is used to: determine the weight value of the interpolation node that does not meet the condition as a preset second constant; determine the weight value of the interpolation node that meets the condition as a preset third constant.
[0398] In some embodiments, the preset second constant is 0, and the preset third constant is 1.
[0399] In some embodiments, the interpolation node satisfies the condition.
[0400] In some embodiments, the interpolation module 182 is used to: use the attribute reconstruction value of one node among all the interpolation nodes of the coplanar node that does not meet the condition as the attribute value of the coplanar node that does not meet the condition.
[0401] In some embodiments, the prediction module 183 is used to: use the M coplanar nodes as prediction nodes; and predict the attributes of the current node according to the attribute values of the prediction nodes to obtain the attribute prediction value of the current node.
[0402] In some embodiments, the prediction module 183 is used to: obtain K prediction nodes based on the M coplanar nodes; wherein K is an integer greater than 0; and predict the attributes of the current node based on the attribute values of the prediction nodes to obtain the attribute prediction value of the current node.
[0403] In some embodiments, K is a power of 2.
[0404] In some embodiments, the prediction module 183 is used to: obtain K prediction nodes according to the specific coding order of the M coplanar nodes; wherein, when the coplanar node is the coplanar node that meets the condition or the coplanar node that does not meet the condition and has at least one interpolation node that meets the condition, the coplanar node is determined as the prediction node; when the total number of the coplanar nodes that meet the condition and the coplanar nodes that do not meet the condition and has at least one interpolation node that meets the condition is greater than or equal to K, the first K nodes sorted in the specific coding order among the nodes corresponding to the total number of nodes are determined as the prediction nodes; when the total number of nodes is greater than 0 and less than K, determine the attribute value of the filler node; and determine the node corresponding to the total number of nodes and the filler node as the prediction node.
[0405] In some embodiments, the prediction module 183 is used to: determine the attribute value of the first node among the nodes corresponding to the total number of nodes sorted according to the specific coding order as the attribute value of the filling node; or, determine the mean of the attribute values of the nodes corresponding to the total number of nodes as the attribute value of the filling node; or, determine the mean of the attribute values of the coplanar nodes and / or colinear nodes of the first node as the attribute value of the filling node; or, determine a preset fourth constant as the attribute value of the filling node.
[0406] In some embodiments, the prediction module 183 is used to: determine the weight value of each of the prediction nodes when any of the prediction nodes satisfies the condition, or when any of the prediction nodes is a coplanar node that does not satisfy the condition and at least one interpolation node of the coplanar node that does not satisfy the condition satisfies the condition; and perform weighted average calculation on the attribute value of each of the prediction nodes according to the weight value of each of the prediction nodes to obtain the attribute prediction value of the current node.
[0407] In some embodiments, the prediction module 183 is used to: determine the weight value of each prediction node that meets the condition as a preset fifth constant; determine the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and all the interpolation nodes do not meet the condition as a preset sixth constant; determine the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and at least one interpolation node meets the condition as the preset seventh constant.
[0408] In some embodiments, the preset fifth constant is greater than or equal to the preset seventh constant.
[0409] In some embodiments, the prediction module 183 is used to: when the number of the prediction nodes is a power of 2, multiply the attribute value of each prediction node by the corresponding weight value through a multiplier to obtain a first operation result; add the first operation result corresponding to each prediction node through an adder to obtain a second operation result; and shift the second operation result and the number of prediction nodes through a shifter to obtain the attribute prediction value of the current node.
[0410] In some embodiments, the prediction module 183 is also used to: when each of the prediction nodes belongs to the coplanar node that does not meet the condition and all the interpolation nodes of each of the prediction nodes do not meet the condition, determine the attribute prediction value of the current node based on the attribute reconstruction value of at least one node that has been decoded before the current node.
[0411] In some embodiments, the prediction module 183 is used to: determine the attribute reconstruction value of the node that has been decoded before the current node as the attribute prediction value of the current node.
[0412] In some embodiments, the M coplanar nodes are all coplanar nodes of the current node.
[0413] In some embodiments, the determination module 181 is further used to: parse the residual of the current node from the received attribute code stream; and determine the attribute reconstruction value of the current node according to the attribute prediction value of the current node and the residual.
[0414] The description of the embodiment of the above device 18 is similar to the description of the intra-frame prediction method embodiment of the above decoding end, and has similar beneficial effects as these method embodiments. For technical details not disclosed in the device embodiment of the present application, please refer to the description of the intra-frame prediction method embodiment of the decoding end of the present application for understanding.
[0415] Based on the foregoing embodiments, the decoding device provided in the embodiments of the present application, including the modules included and the units included in the modules, can be implemented by a decoder or processor in an electronic device; of course, it can also be implemented by a specific logic circuit; in the implementation process, the processor can be a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP), a field programmable gate array (FPGA) or a graphics processing unit (Graphics Processing Unit, GPU), etc.
[0416] Fig.19 Schematic diagram of the structure of the decoding device of the embodiment of the present application. Fig.19 As shown, the device 19 includes: a parsing module 191, an intra-frame prediction module 192 and a decoding module 193; wherein,
[0417] The parsing module 191 is used to parse the received attribute code stream to obtain the residual of the current node;
[0418] The intra-frame prediction module 192 is used to obtain a predicted attribute value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer;
[0419] The attribute value of the coplanar node that meets the condition is the attribute reconstruction value, and for the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to the attribute reconstruction value of the interpolation node, and the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a collinear node of the current node, and the condition is a non-empty node decoded before the current node; or,
[0420] The attribute value of the coplanar node that meets the condition is the attribute reconstruction value. For the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to a preset first constant. The condition is a non-empty node decoded before the current node.
[0421] The decoding module 193 is used to determine the attribute reconstruction value of the current node according to the attribute prediction value of the current node and the residual.
[0422] The description of the embodiment of the above device 19 is similar to the description of the embodiment of the above device 18 and the embodiment of the intra-frame prediction method at the decoding end, and has similar beneficial effects as these method embodiments. For technical details not disclosed in the embodiment of the device of the present application, please refer to the description of the embodiment of the intra-frame prediction method at the decoding end of the present application for understanding.
[0423] It should be noted that in the embodiments of the present application, if the above-mentioned intra-frame prediction method, encoding method or decoding method is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application can be essentially or partly reflected in the form of a software product, which is stored in a storage medium and includes several instructions for enabling an electronic device to execute all or part of the methods described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM), a magnetic disk or an optical disk. In this way, the embodiments of the present application are not limited to any specific combination of hardware and software.
[0424] Correspondingly, an embodiment of the present application provides an electronic device, Fig. 20 A schematic diagram of the hardware entity of the electronic device according to the embodiment of the present application is shown in FIG. Fig. 20 As shown, the electronic device 20 includes a memory 201 and a processor 202. The memory 201 stores a computer program that can be run on the processor 202. When the processor 202 executes the program, the steps in the method provided in the above embodiment are implemented.
[0425] An encoder according to an embodiment of the present application, Fig.21 This is a hardware entity diagram of the encoder of an embodiment of the present application, wherein the encoder 23 includes a memory 211 and a processor 212; wherein the memory 211 is used to store a computer program that can be run on the processor 212; and the processor 212 is used to execute the steps in the method provided in the above embodiment when running the computer program.
[0426] The embodiment of the present application provides a decoder, Fig. 22 This is a hardware entity diagram of a decoder of an embodiment of the present application, wherein the decoder 22 includes a memory 221 and a processor 222; wherein the memory 221 is used to store a computer program that can be run on the processor 222; and the processor 222 is used to execute the steps of the method provided in the above embodiment when running the computer program.
[0427] It should be noted that the memory is configured to store instructions and applications executable by the processor, and can also cache data to be processed or processed by the processor and various modules in the corresponding device (for example, point cloud data, image data, audio data, voice communication data and video communication data), which can be implemented through flash memory (FLASH) or random access memory (Random Access Memory, RAM).
[0428] Correspondingly, an embodiment of the present application provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps in the method provided in the above embodiment are implemented.
[0429] It should be noted here that the description of the above electronic device, encoder, decoder and storage medium embodiments is similar to the description of the above method embodiment, and has similar beneficial effects as the method embodiment. For technical details not disclosed in the electronic device, encoder, decoder and storage medium embodiments of the present application, they can be understood by referring to the description of the method embodiment of the present application.
[0430] It should be understood that "one embodiment" or "an embodiment" or "some embodiments" or "other embodiments" mentioned throughout the specification means that specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the present application. Therefore, "in one embodiment" or "in an embodiment" or "in some embodiments" or "in other embodiments" appearing throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It should be understood that in various embodiments of the present application, the size of the sequence number of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application. The above-mentioned sequence numbers of the embodiments of the present application are for description only and do not represent the advantages and disadvantages of the embodiments.
[0431] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.
[0432] In the several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are only schematic. For example, the division of the modules is only a logical function division. There may be other division methods in actual implementation, such as: multiple modules or components can be combined, or can be integrated into another system, or some features can be ignored or not executed. In addition, the coupling, direct coupling, or communication connection between the components shown or discussed can be through some interfaces, and the indirect coupling or communication connection of devices or modules can be electrical, mechanical or other forms.
[0433] The modules described above as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical modules; they may be located in one place or distributed on multiple network units; some or all of the modules may be selected according to actual needs to achieve the purpose of the present embodiment.
[0434] In addition, all functional modules in the embodiments of the present application may be integrated into one processing unit, or each module may be a separate unit, or two or more modules may be integrated into one unit; the above-mentioned integrated modules may be implemented in the form of hardware or in the form of hardware plus software functional units.
[0435] A person skilled in the art can understand that all or part of the steps of implementing the above method embodiment can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps of the above method embodiment; and the aforementioned storage medium includes: mobile storage devices, read-only memories (ROM), magnetic disks or optical disks, etc., various media that can store program codes.
[0436] Alternatively, if the above-mentioned integrated unit of the present application is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application can essentially or in other words, the part that contributes to the relevant technology can be embodied in the form of a software product, which is stored in a storage medium and includes a number of instructions for an electronic device or an encoder or a decoder to execute all or part of the methods described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROMs, magnetic disks, or optical disks.
[0437] The methods disclosed in several method embodiments provided in this application can be arbitrarily combined without conflict to obtain new method embodiments.
[0438] The features disclosed in several product embodiments provided in this application can be arbitrarily combined without conflict to obtain new product embodiments.
[0439] The features disclosed in several method or device embodiments provided in this application can be arbitrarily combined without conflict to obtain new method embodiments or device embodiments.
[0440] The above is only an implementation method of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.
Claims
1. A method for intra-frame prediction, the method include: Obtaining a predicted attribute value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer; The attribute value of the coplanar node that meets the condition is the attribute reconstruction value, and for the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to the attribute reconstruction value of the interpolation node, and the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a collinear node of the current node, and the condition is a non-empty node decoded before the current node; or, The attribute value of the coplanar node that meets the condition is the attribute reconstruction value. For the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to a preset first constant. The condition is a non-empty node decoded before the current node.
2. The method according to claim 1, in, The reconstructing the value according to the attribute of the interpolation node to obtain the attribute value of the coplanar node that does not meet the condition includes: Determining a weight value of each of the interpolation nodes; According to the weight value of each interpolation node, a weighted average calculation is performed on the attribute reconstruction value of each interpolation node to obtain the attribute value of the coplanar node that does not meet the condition.
3. The method according to claim 2, in, The determining of the weight value of each interpolation node comprises: Determine the weight value of the interpolation node that does not meet the condition as a preset second constant; The weight value of the interpolation node that meets the condition is determined as a preset third constant.
4. The method according to claim 3, in, The preset second constant is 0, and the preset third constant is 1.
5. The method according to claim 2, in, The interpolation node satisfies the condition.
6. The method according to claim 1, in, The reconstructing the value according to the attribute of the interpolation node to obtain the attribute value of the coplanar node that does not meet the condition includes: The attribute reconstruction value of one of all the interpolation nodes of the coplanar node that does not meet the condition is used as the attribute value of the coplanar node that does not meet the condition.
7. The method according to claim 1, in, The step of obtaining the attribute prediction value of the current node according to the attribute values of the M coplanar nodes of the current node includes: Taking the M coplanar nodes as prediction nodes; According to the attribute value of the predicted node, the attribute of the current node is predicted to obtain the attribute prediction value of the current node.
8. The method according to claim 1, in, The step of obtaining the attribute prediction value of the current node according to the attribute values of the M coplanar nodes of the current node includes: Obtaining K prediction nodes according to the M coplanar nodes; wherein K is an integer greater than 0; According to the attribute value of the predicted node, the attribute of the current node is predicted to obtain the attribute prediction value of the current node.
9. The method according to claim 8, in, K is a power of 2.
10. The method according to claim 8, in, The obtaining K prediction nodes according to the M coplanar nodes includes: According to the specific coding order of the M coplanar nodes, K prediction nodes are obtained; wherein, When the coplanar node is the coplanar node that meets the condition or the coplanar node that does not meet the condition and has at least one interpolation node that meets the condition, determining the coplanar node as the prediction node; When the total number of the coplanar nodes that meet the condition and the coplanar nodes that do not meet the condition and at least one interpolation node that meets the condition is greater than or equal to K, the first K nodes that are sorted in a specific coding order among the nodes corresponding to the total number of nodes are determined as the prediction nodes; When the total number of nodes is greater than 0 and less than K, the attribute value of the filling node is determined; and the nodes corresponding to the total number of nodes and the filling node are determined as the predicted nodes.
11. The method according to claim 10, in, The step of determining the attribute value of the filling node includes: Determine the attribute value of the first node among the nodes corresponding to the total number of nodes and sorted according to the specific coding order as the attribute value of the filling node; or, Determine the average of the attribute values of the nodes corresponding to the total number of nodes as the attribute value of the filling node; or, Determine the average of the attribute values of the coplanar nodes and / or colinear nodes of the first node as the attribute value of the filling node; or, A preset fourth constant is determined as the attribute value of the filling node.
12. The method according to claim 7 or 8, in, The step of predicting the attribute of the current node according to the attribute value of the predicted node to obtain the attribute prediction value of the current node includes: In the case where any of the predicted nodes meets the condition, or in the case where any of the predicted nodes is the coplanar node that does not meet the condition and at least one interpolation node of the coplanar node that does not meet the condition meets the condition, Determining a weight value of each of the prediction nodes; According to the weight value of each prediction node, a weighted average calculation is performed on the attribute value of each prediction node to obtain the attribute prediction value of the current node.
13. The method according to claim 12, in, The determining of the weight value of each prediction node includes: Determine the weight value of each prediction node that meets the condition as a preset fifth constant; Determine the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and all the interpolation nodes do not meet the condition as a preset sixth constant; The weight value of the prediction node that belongs to the coplanar node that does not meet the condition and has at least one interpolation node that meets the condition is determined as the preset seventh constant.
14. The method according to claim 13, in, The preset fifth constant is greater than or equal to the preset seventh constant.
15. The method according to claim 12, in, The step of performing weighted average calculation on the attribute value of each prediction node according to the weight value of each prediction node to obtain the attribute prediction value of the current node includes: In the case where the number of prediction nodes is a power of 2, Performing a multiplication operation on the attribute value of each prediction node and the corresponding weight value through a multiplier to obtain a first operation result; Performing an addition operation on the first operation result corresponding to each of the prediction nodes through an adder to obtain a second operation result; A shift operation is performed on the second operation result and the number of the predicted nodes by a shifter to obtain the attribute prediction value of the current node.
16. The method according to claim 7 or 8, in, The step of predicting the attribute of the current node according to the attribute value of the predicted node to obtain the attribute prediction value of the current node further includes: When each of the prediction nodes belongs to the coplanar node that does not meet the condition and all the interpolation nodes of each of the prediction nodes do not meet the condition, the attribute prediction value of the current node is determined based on the attribute reconstruction value of at least one decoded node before the current node.
17. The method according to claim 16, in, The step of determining the attribute prediction value of the current node according to the attribute reconstruction value of at least one node that has been decoded before the current node comprises: The attribute reconstruction value of the node that has been decoded before the current node is determined as the attribute prediction value of the current node.
18. The method according to any one of claims 1 to 11, in, The M coplanar nodes are all coplanar nodes of the current node.
19. The method according to any one of claims 1 to 11, in, The method further comprises: Parsing the residual of the current node from the received attribute code stream; Determine a reconstructed attribute value of the current node according to the predicted attribute value of the current node and the residual.
20. A point cloud decoding method, the method include: Parse the received attribute code stream to obtain the residual of the current node; Performing the steps of the method according to any one of claims 1 to 18 on the current node to obtain a predicted attribute value of the current node; Determine a reconstructed attribute value of the current node according to the predicted attribute value of the current node and the residual.
21. An intra-frame prediction method, the method include: Obtaining a predicted attribute value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer; The attribute value of the coplanar node that meets the condition is the attribute reconstruction value, and the attribute value of the coplanar node that does not meet the condition is obtained according to the attribute reconstruction value of the interpolation node, and the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a collinear node of the current node, and the condition is a non-empty node encoded before the current node; or, The attribute value of the coplanar node that meets the condition is the attribute reconstruction value. For the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to a preset first constant. The condition is a non-empty node encoded before the current node.
22. The method according to claim 21, in, The reconstructing the value according to the attribute of the interpolation node to obtain the attribute value of the coplanar node that does not meet the condition includes: Determining a weight value of each of the interpolation nodes; According to the weight value of each interpolation node, a weighted average calculation is performed on the attribute reconstruction value of each interpolation node to obtain the attribute value of the coplanar node that does not meet the condition.
23. The method according to claim 22, in, The determining of the weight value of each interpolation node comprises: Determine the weight value of the interpolation node that does not meet the condition as a preset second constant; The weight value of the interpolation node that meets the condition is determined as a preset third constant.
24. The method according to claim 23, in, The preset second constant is 0, and the preset third constant is 1.
25. The method according to claim 22, in, The interpolation node satisfies the condition.
26. The method according to claim 21, in, The reconstructing the value according to the attribute of the interpolation node to obtain the attribute value of the coplanar node that does not meet the condition includes: The attribute reconstruction value of one of all the interpolation nodes of the coplanar node that does not meet the condition is used as the attribute value of the coplanar node that does not meet the condition.
27. The method according to claim 21, in, The step of obtaining the attribute prediction value of the current node according to the attribute values of the M coplanar nodes of the current node includes: Taking the M coplanar nodes as prediction nodes; According to the attribute value of the predicted node, the attribute of the current node is predicted to obtain the attribute prediction value of the current node.
28. The method according to claim 21, in, The step of obtaining the attribute prediction value of the current node according to the attribute values of the M coplanar nodes of the current node includes: Obtaining K prediction nodes according to the M coplanar nodes; wherein K is an integer greater than 0; According to the attribute value of the predicted node, the attribute of the current node is predicted to obtain the attribute prediction value of the current node.
29. The method according to claim 28, in, K is a power of 2.
30. The method according to claim 28, in, The obtaining K prediction nodes according to the M coplanar nodes includes: According to the specific coding order of the M coplanar nodes, K prediction nodes are obtained; wherein, When the coplanar node is the coplanar node that meets the condition or the coplanar node that does not meet the condition and has at least one interpolation node that meets the condition, determining the coplanar node as the prediction node; When the total number of the coplanar nodes that meet the condition and the coplanar nodes that do not meet the condition and at least one interpolation node that meets the condition is greater than or equal to K, the first K nodes that are sorted in a specific coding order among the nodes corresponding to the total number of nodes are determined as the prediction nodes; When the total number of nodes is greater than 0 and less than K, the attribute value of the filling node is determined; and the nodes corresponding to the total number of nodes and the filling node are determined as the predicted nodes.
31. The method according to claim 30, in, The step of determining the attribute value of the filling node includes: Determine the attribute value of the first node among the nodes corresponding to the total number of nodes and sorted according to the specific coding order as the attribute value of the filling node; or, Determine the average of the attribute values of the nodes corresponding to the total number of nodes as the attribute value of the filling node; or, Determine the average of the attribute values of the coplanar nodes and / or colinear nodes of the first node as the attribute value of the filling node; or, A preset fourth constant is determined as the attribute value of the filling node.
32. The method according to claim 27 or 28, in, The step of predicting the attribute of the current node according to the attribute value of the predicted node to obtain the attribute prediction value of the current node includes: In the case where any of the predicted nodes meets the condition, or in the case where any of the predicted nodes is the coplanar node that does not meet the condition and at least one interpolation node of the coplanar node that does not meet the condition meets the condition, Determining a weight value of each of the prediction nodes; According to the weight value of each prediction node, a weighted average calculation is performed on the attribute value of each prediction node to obtain the attribute prediction value of the current node.
33. The method according to claim 32, in, The determining of the weight value of each prediction node includes: Determine the weight value of each prediction node that meets the condition as a preset fifth constant; Determine the weight value of the prediction node that belongs to the coplanar node that does not meet the condition and all the interpolation nodes do not meet the condition as a preset sixth constant; The weight value of the prediction node that belongs to the coplanar node that does not meet the condition and has at least one interpolation node that meets the condition is determined as the preset seventh constant.
34. The method according to claim 33, in, The preset fifth constant is greater than or equal to the preset seventh constant.
35. The method according to claim 32, in, The step of performing weighted average calculation on the attribute value of each prediction node according to the weight value of each prediction node to obtain the attribute prediction value of the current node includes: In the case where the number of prediction nodes is a power of 2, Performing a multiplication operation on the attribute value of each prediction node and the corresponding weight value through a multiplier to obtain a first operation result; Performing an addition operation on the first operation result corresponding to each of the prediction nodes through an adder to obtain a second operation result; A shift operation is performed on the second operation result and the number of the predicted nodes by a shifter to obtain the attribute prediction value of the current node.
36. The method according to claim 27 or 28, in, The step of predicting the attribute of the current node according to the attribute value of the predicted node to obtain the attribute prediction value of the current node further includes: When each of the prediction nodes belongs to the coplanar node that does not meet the condition and all the interpolation nodes of each of the prediction nodes do not meet the condition, the attribute prediction value of the current node is determined based on the attribute reconstruction value of at least one node that has been encoded before the current node.
37. The method according to claim 36, in, The step of determining the attribute prediction value of the current node according to the attribute reconstruction value of at least one node that has been encoded before the current node comprises: The attribute reconstruction value of the node that has been encoded before the current node is determined as the attribute prediction value of the current node.
38. The method according to any one of claims 21 to 31, in, The M coplanar nodes are all coplanar nodes of the current node.
39. The method according to any one of claims 21 to 31, in, The method further comprises: Determine a residual between a predicted attribute value of the current node and an original attribute value of the current node; Determine a reconstructed attribute value of the current node according to the predicted attribute value of the current node and the residual.
40. A point cloud encoding method, the method include: Performing the steps of the method according to any one of claims 21 to 38 on the current node of the point cloud to obtain the attribute prediction value of the current node; Determine a residual between a predicted attribute value of the current node and an original attribute value of the current node; The residual of the current node is encoded into an attribute code stream.
41. An intra-frame prediction device, include: A prediction module, used to obtain a predicted attribute value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer; The attribute value of the coplanar node that meets the condition is the attribute reconstruction value, and for the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to the attribute reconstruction value of the interpolation node, and the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a collinear node of the current node, and the condition is a non-empty node decoded before the current node; or, The attribute value of the coplanar node that meets the condition is the attribute reconstruction value. For the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to a preset first constant. The condition is a non-empty node decoded before the current node.
42. A decoding device, include: The parsing module is used to parse the received attribute code stream to obtain the residual of the current node; An intra-frame prediction module, configured to execute the steps of the method described in any one of claims 1 to 18 to obtain a predicted attribute value of a current node; A decoding module is used to determine the attribute reconstruction value of the current node according to the attribute prediction value of the current node and the residual.
43. A decoder comprising a memory and a processor; in, The memory is used to store a computer program that can be run on the processor; The processor is configured to execute the method according to any one of claims 1 to 20 when running the computer program.
44. An intra-frame prediction device, include: A prediction module, used to obtain a predicted attribute value of the current node according to the attribute values of M coplanar nodes of the current node, where M is a positive integer; The attribute value of the coplanar node that meets the condition is the attribute reconstruction value, and the attribute value of the coplanar node that does not meet the condition is obtained according to the attribute reconstruction value of the interpolation node, and the interpolation node is both a coplanar node of the coplanar node that does not meet the condition and a collinear node of the current node, and the condition is a non-empty node encoded before the current node; or, The attribute value of the coplanar node that meets the condition is the attribute reconstruction value. For the coplanar node that does not meet the condition, the attribute value of the coplanar node that does not meet the condition is obtained according to a preset first constant. The condition is a non-empty node encoded before the current node.
45. An encoding device, include: An intra-frame prediction module, configured to execute the steps of the method according to any one of claims 21 to 38 to obtain a predicted attribute value of a current node; A determination module, used to determine a residual between the predicted attribute value of the current node and the original attribute value of the current node; The encoding module is used to encode the residual of the current node into an attribute code stream.
46. An encoder comprising a memory and a processor; in, The memory is used to store a computer program that can be run on the processor; The processor is configured to execute the method according to any one of claims 21 to 40 when running the computer program.
47. An electronic device comprising a memory and a processor; in, The memory is used to store a computer program that can be run on the processor; The processor is configured to execute the method according to any one of claims 1 to 40 when running the computer program.
48. A computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the method according to any one of claims 1 to 40.
