Intra prediction method, apparatus, encoder, decoder, and storage medium

Abstract

To provide an intra prediction method and apparatus, an encoder, a decoder, and a storage medium, which can improve the accuracy of encoding and decoding.SOLUTION: A method comprises: obtaining, when it is determined that a current level obtained after dividing an input point cloud is smaller than a target level, placeholder information of a first number of adjacent nodes of a current node; extracting, from the placeholder information of the first number of adjacent nodes, placeholder information of a second number of adjacent nodes, the first number being greater than the second number, and the second number of adjacent nodes and sub-nodes of the current node having an association; and performing, on the basis of the placeholder information of the second number of adjacent nodes, intra prediction on placeholder information of the sub-nodes of the current node, and obtaining a first prediction result.SELECTED DRAWING: Figure 2

Description

Technical Field

[0005] ,

[0004] , , , ,

[0003] , , ,

[0001] The embodiments of the present application relate to encoding and decoding technologies in the field of communications, and particularly relate to an intra prediction method, apparatus, encoder, decoder, and storage medium.

Background Art

[0002] Currently, in an intra prediction scheme based on octree geometric information encoding in related technologies, calculations and comparisons are performed using the occupancy information of 26 neighboring nodes of the current node (i.e., the node to be encoded) and a plurality of predetermined thresholds. It should be noted that when performing intra prediction using the above prediction scheme, there are many such look-up tables (Look Up Tables), and when performing intra prediction, it involves the setting of at least 16 weights and 10 thresholds, and it is difficult to find the optimal solution, so the optimal intra prediction result cannot be obtained. As can be seen from this, when performing intra prediction in related technologies, there are problems such as a large amount of calculation, a long encoding and decoding time, and an inaccurate intra prediction result.

Summary of the Invention

[0003] The embodiments of the present application provide an intra prediction method, apparatus, encoder, decoder, and storage medium that can improve the speed and accuracy of intra prediction during encoding and decoding processing, and further improve the quality of encoding and decoding.

[0004] The technical solution of the embodiments of the present application can be realized as follows.

[0005] According to a first aspect, the embodiments of the present application provide an intra prediction method. The method includes: When it is determined that the current layer obtained after splitting the input point cloud is smaller than the target layer, obtaining the occupancy information of the first number of neighboring nodes of the current node; Extracting the occupation information of neighboring nodes of a second quantity from the occupation information of neighboring nodes of the first quantity, wherein the first quantity is greater than the second quantity, and the neighboring nodes of the second quantity and the child nodes of the current node are related. This includes performing an intra-prediction on the occupation information of the child nodes of the current node based on the occupation information of neighboring nodes of the second quantity, and obtaining a first prediction result.

[0006] According to a second aspect, the embodiment of the present application further provides an intra-prediction device. The device is When it is determined that the current hierarchy obtained after partitioning the input point cloud is smaller than the target hierarchy, a first processing module is configured to obtain the occupancy information of neighboring nodes for a first quantity of the current node, A first extraction module configured to extract occupation information of neighboring nodes of a second quantity from occupation information of neighboring nodes of a first quantity, wherein the first quantity is greater than the second quantity, and neighboring nodes of the second quantity and child nodes of the current node have a related relationship. The system includes a second processing module configured to perform an intra-prediction on the occupation information of the child nodes of the current node based on the occupation information of neighboring nodes of the second quantity, and to obtain a first prediction result.

[0007] According to a third aspect, an embodiment of the present application provides an encoder. The encoder is A first memory configured to store executable intra-predictive instructions, The system includes a first processor configured to implement the intra-prediction method described in the first embodiment when executing an executable intra-prediction instruction stored in the first memory.

[0008] According to a fourth aspect, the embodiments of the present application further provide a decoder. The decoder is A second memory configured to store executable intra-predictive instructions, The system includes a second processor configured to implement the intra-prediction method described in the first embodiment when executing an executable intra-prediction instruction stored in the second memory.

[0009] According to a fifth aspect, an embodiment of the present application provides a computer-readable storage medium. The computer-readable storage medium stores executable intra-prediction instructions, which, when executed by a first processor, are for realizing the intra-prediction method described in the first aspect. [Effects of the Invention]

[0010] Embodiments of the present application provide an intra-prediction method, apparatus, encoder, decoder, and storage medium. The method includes, when it is determined that the current hierarchy obtained after partitioning the input point cloud is smaller than the target hierarchy, obtaining occupancy information of neighboring nodes of a first quantity of the current node, extracting occupancy information of neighboring nodes of a second quantity from the occupancy information of neighboring nodes of the first quantity, wherein the first quantity is larger than the second quantity, and neighboring nodes of the second quantity and child nodes of the current node have a related relationship, and performing intra-prediction on the occupancy information of child nodes of the current node based on the occupancy information of neighboring nodes of the second quantity to obtain a first prediction result. In other words, in embodiments of the present application, when performing intra-prediction on the occupancy information of child nodes of the current node, by considering only neighboring nodes of a second quantity that have a related relationship with child nodes of the current node, the objectives of reducing the lookup table, reducing computational complexity, improving the accuracy of the intra-prediction result, shortening the encoding and decoding time, and improving the accuracy of encoding and decoding are achieved. [Brief explanation of the drawing]

[0011] [Figure 1] This is a block diagram of an exemplary coding flow according to an embodiment of the present invention. [Figure 2] This is flowchart 1 of an exemplary intra-prediction method according to the embodiment of the present invention. [Figure 3]This is flowchart 2 of an exemplary intra-prediction method according to an embodiment of the present invention. [Figure 4] This is a schematic diagram of a point cloud contained in different child nodes of an exemplary current node according to an embodiment of the present invention. [Figure 5] This is a flowchart illustrating the execution of an intra-prediction method using an exemplary encoder according to an embodiment of the present invention. [Figure 6] This is a flowchart illustrating the execution of an intra-prediction method using an exemplary decoder according to an embodiment of the present invention. [Figure 7] This is a schematic diagram of a point cloud contained in a child node of an exemplary current node according to an embodiment of the present invention. [Figure 8] This is the BD-Rate in loss compression according to the embodiment of the present invention. [Figure 9] This is the bpip ratio in lossless compression according to the embodiment of the present invention. [Figure 10] This is a schematic diagram of the structure of an intra-prediction device according to an embodiment of the present invention. [Figure 11] This is a schematic diagram of the structure of an encoder according to an embodiment of the present invention. [Figure 12] This is a schematic diagram of the structure of a decoder according to an embodiment of the present invention. [Modes for carrying out the invention]

[0012] To further clarify the purpose, technical solutions, and advantages of the embodiments of this application, the specific technical solutions of this application will be described in more detail below with reference to the drawings of the embodiments. The embodiments described below are for illustrative purposes only and do not limit the scope of this application.

[0013] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those generally understood by those skilled in the art in which this application pertains. The terms used herein are used solely to describe the purpose of the embodiments of this application and are not intended to limit this application.

[0014] In the following description, it pertains to "some embodiments". This describes a subset of all possible embodiments. "Some embodiments" may be the same subset or different subsets of all possible embodiments, and should be understood to be combinable with each other as long as there is no contradiction.

[0015] It should be noted that the terms "first / second / third" in the following description are for distinguishing similar objects and not for explaining a specific order of the objects. In order to enable the embodiments of the present application described herein to be implemented in an order other than the order shown or described herein, it should be understood that "first / second / third" can replace the specific order or the order of precedence with each other if permitted.

[0016] Before further elaborating on the embodiments of the present application, nouns and terms related to the embodiments of the present application will be explained. The nouns and terms related to the embodiments of the present application shall be applied to the following interpretations.

[0017] 1) Point Cloud Compression (PCC) 2) Geometry-based Point Cloud Compression (G-PCC) 3) Slice / Stripe slice 4) Bounding box 5) Octree 6) Intra prediction 7) Triangle soup (trisoup) 8) Context-based Adaptive Binary Arithmetic Coding (CABAC) 9) Block 10) Vertex 11) Red-Green-Blue (RGB) 12) Luminance-Chrominance (YUV) 13) Level of Detail (LOD) 14) Region Adaptive Hierarchical Transform (RAHT) 15) Look Up Table (LUT) 16) Moving Picture Experts Group (MPEG) 17) International Standardization Organization (ISO) 18) International Electrotechnical Commission (IEC) 19) Number of occupied neighbors (No) In the embodiment of the present invention, the point cloud G-PCC encoder framework performs slice division on the point cloud input to the three-dimensional image model, and then performs independent encoding on each slice.

[0018] In the G-PCC coding flow block diagram shown in Figure 1, the input point cloud is sliced, and then each slice is coded independently. In each slice, the geometric information of the point cloud and the attribute information corresponding to each point are coded separately. First, a coordinate transformation is performed on the geometric information to include the entire point cloud in a single bounding box. Next, quantization is performed. This quantization mainly serves the role of scaling. Due to the rounding of the quantization, the geometric information of some points becomes the same, and based on parameters, it is decided whether to remove duplicate points. The quantization and duplicate point removal process is also called voxelization. Next, the bounding box is partitioned based on octrees. Depending on the depth of the octree partitioning hierarchy, the coding of geometric information is divided into two frameworks: an octree-based framework and a trisoup-based framework.

[0019] In a geometric information coding framework based on octvines, the bounding box is divided into eight subcubes, and the occupancy information of each cube (1 indicates not empty, 0 indicates empty) is recorded. The division continues for the non-empty subcubes, and the division stops when the resulting leaf nodes form a 1x1x1 unit cube. In this process, the spatial correlation between nodes and surrounding nodes is used to perform intra-prediction on the occupancy information, and finally CABAC is performed to obtain binary data. Bitstream Generates.

[0020] In a geometric information coding framework based on trisoup, similarly, an octvine partition is first performed, but it differs from geometric information coding based on an octvine in that, in this method, it is not necessary to divide the point cloud step by step into unit cubes with side lengths of 1x1x1. Instead, the partitioning stops when the block side length becomes W, and at most 12 vertices are obtained based on the surface formed by the distribution of the point cloud in each block, and the surface and the 12 edges of the block. The vertex coordinates of each block are encoded sequentially, and binary Bitstream Generates.

[0021] After performing geometric coding, reconstruction is carried out on the geometric information. Currently, attribute coding is mainly performed on color information. First, the color information is converted from the RGB color space to the YUV color space. Next, the point cloud is recolored using the reconstructed geometric information, and the uncoded attribute information is associated with the reconstructed geometric information. In color information coding, there are mainly two conversion methods. The first is a distance-based improvement conversion that depends on LOD partitioning, and the second is a direct RAHT conversion. In both of these methods, the color information is converted from the spatial domain to the frequency domain, high-frequency coefficients and low-frequency coefficients are obtained through the conversion, and finally quantization and coding are performed on the coefficients to obtain binary Bitstream Generates.

[0022] Here, we will explain intra-prediction in geometric information coding based on octrees.

[0023] Based on the occupancy information of the current node's 26 neighboring nodes, a prediction is made as to whether the child nodes of the current node (i.e., the node to be encoded) are occupied. This is an intra-prediction, and the explanation of how to perform the intra-prediction is as follows.

[0024] First, intra-prediction is enabled when the current hierarchy of the octvine partition is less than a predetermined number of layers L. The inputs are a Morton 3D map for mapping (x,y,z) coordinates to flag bits, map displacement parameters, and the coordinates of the origin of the current node.

[0025] JPEG0007830549000001.jpg114162

[0026] Finally, the system outputs "whether to predict or not" and the "predicted value," which are represented by 0 or 1 and used for entropy coding of the subsequent occupancy information. 1,1 represents "occupied," 1,0 represents "not occupied," and 0,0 represents "not predicted."

[0027] JPEG0007830549000002.jpg44162

[0028] JPEG0007830549000003.jpg94161

[0029] The embodiments of this application provide an intra-prediction method. As shown in Figure 2, the method includes the following steps.

[0030] In step 101, when it is determined that the current hierarchy obtained after partitioning the input point cloud is smaller than the target hierarchy, the occupancy information of neighboring nodes for the first quantity of the current node is obtained.

[0031] In the embodiment of the present invention, the encoder or decoder can perform steps 101-103 to obtain a first prediction result of intra-prediction for the occupancy information of the child nodes of the current node (i.e., the node to be encoded).

[0032] Here, taking as an example that the encoder performs steps 101-103, the encoder includes a three-dimensional point cloud encoder, such as a G-PCC encoder. The G-PCC encoder performs slice partitioning of the input point cloud and then independently encodes each slice. Here, when the encoder determines that the current hierarchy obtained after partitioning the input point cloud is smaller than the target hierarchy, it obtains the occupancy information of neighboring nodes of a first quantity of the current node. In some embodiments, the encoder can perform partitioning of the input point cloud based on octree.

[0033] In step 102, the occupation information of neighboring nodes for the second quantity is extracted from the occupation information of neighboring nodes for the first quantity.

[0034] The first quantity is greater than the second quantity, and there is an association between the neighboring nodes of the second quantity and the child nodes of the current node.

[0035] In the embodiment of the present invention, the encoder obtains the occupation information of neighboring nodes for the first quantity of the current node, and then extracts the occupation information of neighboring nodes for the second quantity from the occupation information of neighboring nodes for the first quantity. It should be explained that neighboring nodes for the second quantity and child nodes of the current node are related. That is, after obtaining the occupation information of neighboring nodes for the first quantity of the current node, the encoder first screens the occupation information of neighboring nodes for the first quantity of the current node to determine the occupation information of neighboring nodes that have a certain influence on the child nodes of the current node, and uses the selected occupation information as a reference factor for intra-prediction of the occupation information of child nodes of the current node. In this way, the computational complexity is reduced by not considering the occupation information of all neighboring nodes for the first quantity, laying the foundation for shortening the coding time, improving coding efficiency, and improving coding accuracy.

[0036] In step 103, based on the occupancy information of neighboring nodes for the second quantity, an intra-prediction is performed on the occupancy information of the child nodes of the current node, and the first prediction result is obtained.

[0037] In the embodiment of the present invention, the encoder selects the occupancy information of neighboring nodes of a second quantity, and then performs an intra-prediction on the occupancy information of the child nodes of the current node based on the occupancy information of neighboring nodes of the second quantity, thereby obtaining a first prediction result.

[0038] In the intra prediction method according to the embodiment of the present application, when it is determined that the current hierarchy obtained after partitioning the input point cloud is smaller than the target hierarchy, the occupancy information of neighboring nodes of the first quantity of the current node is obtained, and the occupancy information of neighboring nodes of the second quantity is extracted from the occupancy information of neighboring nodes of the first quantity. The first quantity is greater than the second quantity, and the neighboring nodes of the second quantity and the child nodes of the current node are related. Based on the occupancy information of neighboring nodes of the second quantity, intra prediction is performed on the occupancy information of the child nodes of the current node to obtain the first prediction result. In other words, in the embodiment of the present application, when performing intra prediction on the occupancy information of the child nodes of the current node, by considering only neighboring nodes of the second quantity that are related to the child nodes of the current node, the objectives of reducing the lookup table, reducing computational complexity, improving the accuracy of the intra prediction result, shortening the encoding and decoding time, and improving the accuracy of encoding and decoding are achieved.

[0039] Embodiments of the present application provide an intra-prediction method. As shown in Figure 3, when the intra-prediction method is applied to an encoder, the method includes steps 201-206, and when the intra-prediction method is applied to a decoder, the method includes steps 201-204 and steps 207-208.

[0040] In some embodiments, the encoder includes a three-dimensional point cloud encoder, and the decoder includes a three-dimensional point cloud decoder.

[0041] In step 201, when it is determined that the current hierarchy obtained after partitioning the input point cloud is smaller than the target hierarchy, the occupancy information of neighboring nodes for the first quantity of the current node is obtained.

[0042] JPEG0007830549000004.jpg52162

[0043] In step 202, the occupation information of neighboring nodes for the second quantity is extracted from the occupation information of neighboring nodes for the first quantity.

[0044] The first quantity is greater than the second quantity, and the neighboring nodes of the second quantity and the child nodes of the current node have an association relationship. Here, the association relationship includes the neighboring nodes of the second quantity and the child nodes of the current node sharing a face, edge, or vertex.

[0045] In the embodiment of the present application, the neighboring nodes of the second quantity include neighboring nodes that share a face, edge, or vertex with a child node of the current node. This excludes neighboring nodes of the first quantity that have little or no influence on a child node of the current node. In this way, the computational complexity is reduced, the encoding and decoding time is effectively shortened, and the accuracy of encoding and decoding is ensured.

[0046] In step 203, the occupied quantity corresponding to the neighboring node of the second quantity of the child node is determined based on the occupied information of the neighboring node of the second quantity.

[0047] JPEG0007830549000005.jpg24161

[0048] JPEG0007830549000006.jpg36161

[0049] JPEG0007830549000007.jpg11161

[0050] In step 204, based on the occupied quantity, the current node child node An intranet prediction is performed on the occupancy information to obtain the first prediction result.

[0051] The first prediction result indicates whether or not to perform a prediction, the prediction parameters, and, if a prediction is made, the prediction value parameters.

[0052] In the embodiment of the present application, based on the occupied quantity, the current node child node Step 204, which involves performing an intra-prediction on the occupancy information and obtaining a first prediction result, may be implemented by the following steps.

[0053] In step 204a, a third quantity related to the second quantity is obtained.

[0054] In some embodiments, the third quantity may be equal to half of the second quantity. Of course, in other embodiments of the present application, the third quantity may be flexibly determined based on the second quantity, depending on the actual circumstances.

[0055] For example, if we consider the 7 neighboring nodes of child node m, the third quantity may be 4.

[0056] In step 204b, based on the occupied quantity and the third quantity, the current node child node An intranet prediction is performed on the occupancy information to obtain the first prediction result.

[0057] In some embodiments of the present application, based on the occupied quantity and the third quantity, the current node child node Step 204b, which involves performing an intra-prediction on the occupancy information and obtaining a first prediction result, includes the following step 204b1.

[0058] In step 204b1, when it is determined that the occupied quantity and the third quantity are different, the current node is determined based on the occupied quantity, the first threshold, and the second threshold. child node An intranet prediction is performed on the occupancy information to obtain the first prediction result.

[0059] JPEG0007830549000008.jpg59161

[0060] Furthermore, when it is determined that the occupied quantity and the third quantity are different, in feasible scenarios, in step 204b1, based on the occupied quantity, the first threshold, and the second threshold, the current node child node Performing intranet prediction on occupancy information and obtaining a first prediction result may include the following steps:

[0061] In Step 11, the occupied quantity is compared with the first threshold.

[0062] In Step 12, when it is determined that the occupied quantity is below the first threshold, an intra-prediction is performed on the occupied information of the child nodes of the current node, and a first prediction result is obtained in which the child nodes of the current node do not contain a point cloud.

[0063] Furthermore, when it is determined that the occupied quantity and the third quantity are different, in another feasible scenario, based on the occupied quantity, the first threshold, and the second threshold, the current node child node Performing intranet prediction on occupancy information and obtaining a first prediction result may include the following steps:

[0064] In Step 21, the quantity occupied and the number 2 Compare the thresholds.

[0065] In Step 22, when it is determined that the occupied quantity is equal to or greater than the second threshold, an intra-prediction is performed on the occupied information of the child nodes of the current node, and a first prediction result is obtained in which the point cloud is included in the child nodes of the current node.

[0066] In another feasible scenario of this invention, the occupied quantity is compared with a first threshold, and when it is determined that the occupied quantity is greater than the first threshold and less than the second threshold, a second prediction result is obtained in which intra-prediction is not performed on the occupied information of the child nodes of the current node.

[0067] In other embodiments of the present application, based on the occupied quantity and the third quantity, the current node child node Step 204b, which involves performing an intra-prediction on the occupancy information and obtaining a first prediction result, includes the following step 204b2.

[0068] In step 204b2, when it is determined that the occupied quantity and the third quantity are the same, the current node is determined based on the occupied quantity, the third threshold, and the fourth threshold. child node An intranet prediction is performed on the occupancy information to obtain the first prediction result.

[0069] In the embodiment of the present application, when it is determined that the occupied quantity and the third quantity are the same, the current node is determined based on the occupied quantity, the third threshold, and the fourth threshold. child node Step 204b2, which involves performing an intra-prediction on the occupancy information and obtaining a first prediction result, may include the following steps 204b21 to 204b23.

[0070] In step 204b21, when it is determined that the occupied quantity and the third quantity are the same, the weight of the occupied information of the neighboring nodes of the second quantity is set based on the distance from the neighboring nodes of the child node to the child node.

[0071] In step 204b22, the target parameters of the child node are determined based on the occupation information of the neighboring nodes for the second quantity and the weights corresponding to the occupation information of the neighboring nodes for the second quantity.

[0072] In step 204b23, the first prediction result is determined based on the target parameter, the third threshold, and the fourth threshold.

[0073] Furthermore, in feasible scenarios, step 204b23, which determines the first prediction result based on the target parameter, third threshold, and fourth threshold, determines that the target parameter is less than or equal to the third threshold, and the current node child node The process may include a step of performing an intra-prediction on the occupancy information to obtain a first prediction result in which the current node's child nodes do not contain a point cloud.

[0074] JPEG0007830549000009.jpg29161

[0075] JPEG0007830549000010.jpg32161

[0076] For illustrative purposes, (A) through (H) in Figure 4 each represent the occupation status corresponding to different child nodes of the current node, that is, they represent the occupation information of different child nodes of the current node.

[0077] JPEG0007830549000011.jpg46161

[0078] In the embodiments of this application, as an example, LUT_I[8][7]={{0,1,3,4,9,10,12},{1,2,4,5,10,11,13},{3,4,6,7,12,14,15},{4,5,7,8,13,15,16},{9 ,10,12,17,18,20,21},{10,11,13,18,19,21,22},{12,14,15,20,21,23,24},{13,15,16,21,22,24,25}}, LUT_d[8][7]={{2,1,1,0,1,0,0},{1,2,0,1,0,1,0},{1,0,2,1,0,1,0},{0,1,1,2,0 ,0,1},{1,0,0,2,1,1,0},{0,1,0,1,2,0,1},{0,1,0,1,0,2,1},{0,0,1,0,1,1,2}},

[0079] JPEG0007830549000012.jpg35162

[0080] Furthermore, in another feasible scenario, step 204b23, which determines the first prediction result based on the target parameter, the third threshold, and the fourth threshold, determines that the target parameter is greater than or equal to the fourth threshold, and the current node child node The step may include performing an intra-prediction on the occupancy information to obtain a first prediction result in which the point cloud is included in the child nodes of the current node.

[0081] Furthermore, in another feasible scenario, step 204b23, which determines a first prediction result based on a target parameter, a third threshold, and a fourth threshold, may include a step of obtaining a second prediction result in which no intra-prediction is performed on the occupancy information of the child nodes of the current node when it is determined that the target parameter is greater than the third threshold and less than the fourth threshold.

[0082] In step 205, the coding model associated with the first prediction result is determined.

[0083] In the embodiment of the present invention, the encoder determines an encoding model associated with the first prediction result after obtaining a first prediction result.

[0084] In step 206, based on the coding model, the occupancy information of the child nodes of the current node is coded. Bitstream Write it there.

[0085] In the embodiment of the present invention, the encoder performs encoding on the occupancy information of the child nodes of the current node based on the encoding model. Bitstream Write it there.

[0086] In step 207, the decoding model associated with the first prediction result is determined.

[0087] In the embodiment of the present invention, the encoder determines a decoding model associated with the first prediction result after obtaining a first prediction result.

[0088] In step 208, based on the decoding model, Bitstream We perform an analysis on this to obtain the occupancy information of the child nodes of the current node.

[0089] In the embodiment of the present application, the encoder is obtained based on the decoding model. Bitstream We perform an analysis on this to obtain the occupancy information of the child nodes of the current node.

[0090] In feasible scenarios, as shown in Figure 5, the intra-prediction method is applied to the encoder as an example. When the encoder makes a prediction for a child node of the current node, it considers only the influence of the seven neighboring parent nodes that share faces, edges, and vertices with it. Furthermore, based on the calculation of weights and the setting of thresholds, the prediction results are divided into three types. The steps for executing the intra-prediction method by the encoder are as follows.

[0091] In step 1, intra-prediction is enabled when the current hierarchy L of the octvine partition is less than a predetermined number of layers. The inputs are a Morton 3D map for mapping (x,y,z) coordinates to flag bits, map displacement parameters, and the coordinates of the origin of the current node.

[0092] JPEG0007830549000013.jpg55162

[0093] JPEG0007830549000014.jpg10162

[0094] JPEG0007830549000015.jpg32162

[0095] JPEG0007830549000016.jpg30162

[0096] JPEG0007830549000017.jpg27161

[0097] In step 5, the "whether to predict or not" and the "predicted value," represented by 0 or 1, are output and used for entropy coding of the subsequent occupation information. 1, 1 represents "occupied," 1, 0 represents "not occupied," and 0, 0 represents "not predicted."

[0098] JPEG0007830549000018.jpg80161

[0099] For example, in some embodiments, LUT_I[8][7]={{0,1,3,4,9,10,12},{1,2,4,5,10,11,13},{3,4,6,7,12,14,15},{4,5,7,8,13,15,16},{9 ,10,12,17,18,20,21},{10,11,13,18,19,21,22},{12,14,15,20,21,23,24},{13,15,16,21,22,24,25}}, LUT_d[8][7]={{2,1,1,0,1,0,0},{1,2,0,1,0,1,0},{1,0,2,1,0,1,0},{0,1,1,2,0 ,0,1},{1,0,0,2,1,1,0},{0,1,0,1,2,0,1},{0,1,0,1,0,2,1},{0,0,1,0,1,1,2}},

[0100] JPEG0007830549000019.jpg36161

[0101] Furthermore, the encoder determines an encoding model related to the first prediction result and performs encoding on the occupancy information of the child nodes of the current node based on the encoding model. Bitstream Write it there.

[0102] In a feasible scenario, as shown in Figure 6, the intra-prediction method is applied to the decoder as an example. When the decoder makes a prediction for a child node of the current node, it considers only the influence of the seven neighboring parent nodes that share faces, edges, and vertices with it. Furthermore, based on the calculation of weights and the setting of thresholds, the prediction results are divided into three types. The steps for executing the intra-prediction method by the decoder are as follows.

[0103] In step 1, intra-prediction is enabled when the current hierarchy L of the octvine partition is less than a predetermined number of layers. The inputs are a Morton 3D map for mapping (x,y,z) coordinates to flag bits, map displacement parameters, and the coordinates of the origin of the current node.

[0104] JPEG0007830549000020.jpg20161

[0105] JPEG0007830549000021.jpg35161

[0106] JPEG0007830549000022.jpg9161

[0107] JPEG0007830549000023.jpg32161

[0108] JPEG0007830549000024.jpg29161

[0109] JPEG0007830549000025.jpg26161

[0110] In step 5, the "whether to predict or not" and the "predicted value," represented by 0 or 1, are output and used for entropy coding of the subsequent occupation information. 1, 1 represents "occupied," 1, 0 represents "not occupied," and 0, 0 represents "not predicted."

[0111] Furthermore, the decoder determines a decoding model related to the first prediction result, and based on the decoding model, Bitstream We perform an analysis on this to obtain the occupancy information of the child nodes of the current node.

[0112] JPEG0007830549000026.jpg80162

[0113] For example, in some embodiments, LUT_I[8][7]={{0,1,3,4,9,10,12},{1,2,4,5,10,11,13},{3,4,6,7,12,14,15},{4,5,7,8,13,15,16},{9 ,10,12,17,18,20,21},{10,11,13,18,19,21,22},{12,14,15,20,21,23,24},{13,15,16,21,22,24,25}}, LUT_d[8][7]={{2,1,1,0,1,0,0},{1,2,0,1,0,1,0},{1,0,2,1,0,1,0},{0,1,1,2,0 ,0,1},{1,0,0,2,1,1,0},{0,1,0,1,2,0,1},{0,1,0,1,0,2,1},{0,0,1,0,1,1,2}},

[0114] JPEG0007830549000027.jpg36162

[0115] In another feasible scenario, the computational complexity of intra-prediction can be further reduced by further simplifying the above intra-prediction scheme, for example, by applying the intra-prediction method to an encoder. The steps for executing the intra-prediction method using an encoder are as follows:

[0116] JPEG0007830549000028.jpg29162

[0117] In step 1, intra-prediction is enabled when the current hierarchy L of the octvine partition is less than a predetermined number of layers. The inputs are a Morton 3D map for mapping (x,y,z) coordinates to flag bits, map displacement parameters, and the coordinates of the origin of the current node.

[0118] JPEG0007830549000029.jpg21162

[0119] JPEG0007830549000030.jpg45162

[0120] JPEG0007830549000031.jpg32161

[0121] In step 5, the "whether to predict or not" and the "predicted value," represented by 0 or 1, are output and used for entropy coding of the subsequent occupation information. 1, 1 represents "occupied," 1, 0 represents "not occupied," and 0, 0 represents "not predicted."

[0122] JPEG0007830549000032.jpg67161

[0123] JPEG0007830549000033.jpg66161

[0124] In step 1, intra-prediction is enabled when the current hierarchy L of the octvine partition is less than a predetermined number of layers. The inputs are a Morton 3D map for mapping (x,y,z) coordinates to flag bits, map displacement parameters, and the coordinates of the origin of the current node.

[0125] JPEG0007830549000034.jpg19161

[0126] JPEG0007830549000035.jpg45161

[0127] JPEG0007830549000036.jpg34161

[0128] In step 5, the "whether to predict or not" and the "predicted value," represented by 0 or 1, are output and used for entropy coding of the subsequent occupation information. 1, 1 represents "occupied," 1, 0 represents "not occupied," and 0, 0 represents "not predicted."

[0129] JPEG0007830549000037.jpg69161

[0130] According to the intra-prediction method of the present invention, as shown in Figure 8, Table 1 shows the percentage of code rate that can be saved for the same encoding quality compared to a point cloud compression-based scheme in related technologies in the case of loss compression. Here, the test sequence includes 13 cases. As can be seen from Table 1, the intra-prediction method of the present invention performs processing for each test sequence, and in all cases, Bitstream This can save money. As shown in Figure 9, Table 2 shows the cost after compression in the case of lossless compression. Bitstream This represents the compressed result. As can be seen from Table 2, BitstreamThese are all less than 100%, and are due to only some of the code rates in the related technologies. Bitstream You can obtain this.

[0131] The embodiment of this application can achieve the following beneficial effects. When making a prediction for a child node of the current node based on the occupancy information of child nodes of an encoded / decoded node among 26 neighboring nodes, the lookup table is reduced and computational complexity is reduced by considering only the influence of the 7 neighboring parent nodes that share faces, edges, and vertices with it. At the same time, the optimal solution is easily found by setting simple weights and thresholds, and with the optimal weight and threshold settings, this technique achieves the effect of reducing the coding rate while keeping the PSNR unchanged. At the same time, by making easier and more accurate use of the spatial correlation of the point cloud, the intra-prediction results of geometric information coding based on octvines are made more suitable for constructing probabilistic models in CABAC, thereby binary Bitstream To reduce.

[0132] Figure 10 is a schematic diagram of the structure of an intra-prediction device according to an embodiment of the present invention. As shown in Figure 10, the intra-prediction device 300 comprises a first processing module 301, a first extraction module 302, and a second processing module 303. The first processing module 301 is configured to obtain the occupancy information of neighboring nodes of the first quantity of the current node when it is determined that the current hierarchy obtained after partitioning the input point cloud is smaller than the target hierarchy. The first extraction module 302 is configured to extract the occupation information of neighboring nodes of a second quantity from the occupation information of neighboring nodes of a first quantity, wherein the first quantity is greater than the second quantity, and the neighboring nodes of the second quantity and the child nodes of the current node have a related relationship. The second processing module 303 is configured to perform an intra-prediction on the occupation information of the child nodes of the current node based on the occupation information of neighboring nodes of the second quantity, and to obtain the first prediction result.

[0133] In other embodiments, the association relationship includes the sharing of a face, edge, or vertex between a neighboring node of a second quantity and a child node of the current node.

[0134] In other embodiments, the second processing module 303 determines the occupied quantity of the child node corresponding to the neighboring node of the second quantity based on the occupied information of the neighboring nodes of the second quantity. Based on the number of units occupied, the current node child node The system is configured to perform intraprediction on the occupancy information and obtain a first prediction result, which indicates whether or not to perform prediction and, if so, the prediction value parameters.

[0135] In other embodiments, the second processing module 303 obtains a third quantity related to the second quantity, Based on the occupied quantity and the third quantity, the current node child node The system is configured to perform intra-prediction on the occupancy information and obtain a first prediction result.

[0136] In other embodiments, when the second processing module 303 determines that the occupied quantity and the third quantity are different, it determines the current node based on the occupied quantity, the first threshold, and the second threshold. child node The system is configured to perform intra-prediction on the occupancy information and obtain a first prediction result.

[0137] In other embodiments, when the second processing module 303 determines that the occupied quantity and the third quantity are different, it compares the occupied quantity with the first threshold, When it is determined that the occupied quantity is below the first threshold, an intra-prediction is performed on the occupied information of the child nodes of the current node, and the system is configured to obtain a first prediction result in which the child nodes of the current node do not contain a point cloud.

[0138] In other embodiments, the second processing module 303 is configured to perform an intra-prediction on the occupancy information of the child nodes of the current node when it is determined that the occupancy quantity is equal to or greater than a second threshold, and to obtain a first prediction result in which the child nodes of the current node include a point cloud.

[0139] In other embodiments, the second processing module 303 is configured to obtain a second prediction result in which intra-prediction is not performed on the occupation information of the child nodes of the current node when it is determined that the occupation quantity is greater than the first threshold and less than the second threshold.

[0140] In another embodiment, when the second processing module 303 determines that the occupied quantity and the third quantity are the same, it determines the current node based on the occupied quantity, the third threshold, and the fourth threshold. child node The system is configured to perform intra-prediction on the occupancy information and obtain a first prediction result.

[0141] In another embodiment, when the second processing module 303 determines that the occupied quantity and the third quantity are the same, it sets the weight of the occupied information of the neighboring nodes of the second quantity based on the distance from the neighboring node of the child node to the child node. Based on the occupation information of neighboring nodes for the second quantity, and the weights corresponding to the occupation information of neighboring nodes for the second quantity, the target parameters of the child node are determined. It is configured to determine the first prediction result based on the target parameter, the third threshold, and the fourth threshold.

[0142] In another embodiment, when the second processing module 303 determines that the target parameter is less than or equal to the third threshold, the current node child node The system is configured to perform intranet prediction on the occupancy information and obtain a first prediction result in which the point cloud is not included in the child nodes of the current node.

[0143] In another embodiment, when the second processing module 303 determines that the target parameter is greater than or equal to the fourth threshold, the current node child node The system is configured to perform intranet prediction on the occupancy information and obtain a first prediction result in which the point cloud is included in the child nodes of the current node.

[0144] In other embodiments, the second processing module 303 is configured to obtain a second prediction result in which intra-prediction is not performed on the occupancy information of the child nodes of the current node when it is determined that the target parameter is greater than the third threshold and less than the fourth threshold.

[0145] In another embodiment, the intra-prediction device is an encoding device, and the encoding device includes a first decision module configured to determine an encoding model related to a first prediction result, Based on the coding model, the occupation information of the child nodes of the current node is coded. Bitstream It further comprises an encoding module configured to write to a variable.

[0146] In another embodiment, the intra-prediction device is a decoding device, and the decoding device includes a second decision module configured to determine a decoding model related to the first prediction result. Based on the decoding model, Bitstream The system further includes a decoding module configured to perform analysis on the current node and obtain the occupancy information of the child nodes of the node.

[0147] In practical applications, as shown in Figure 11, the embodiment of the present invention further provides an encoder. The encoder is A first memory 41 configured to store executable intra-predictive instructions, The system includes a first processor 42 configured to implement the intra prediction method on the encoding device side according to the embodiment of the present invention when executing an executable intra prediction instruction stored in the first memory 41.

[0148] The processor may be implemented by software, hardware, firmware, or a combination thereof, and by using a circuit, one or more application-specific integrated circuits (ASICs), one or more general-purpose integrated circuits, one or more microprocessors, one or more programmable logic devices, or a combination of the said circuits and devices, or other suitable circuits and devices, the processor is made to perform the corresponding steps of the intra prediction method in the embodiment of the encoding device.

[0149] To make it easier to understand, when it is determined that the current hierarchy obtained after partitioning the input point cloud is smaller than the target hierarchy, the occupation information of neighboring nodes of the first quantity of the current node is obtained, and the occupation information of neighboring nodes of the second quantity is extracted from the occupation information of neighboring nodes of the first quantity. The first quantity is greater than the second quantity, and the neighboring nodes of the second quantity and the child nodes of the current node are related. Based on the occupation information of neighboring nodes of the second quantity, an intra-prediction is performed on the occupation information of the child nodes of the current node, and the first prediction result is obtained. In other words, in the embodiment of the present application, when performing an intra-prediction on the occupation information of the child nodes of the current node, by considering only neighboring nodes of the second quantity that are related to the child nodes of the current node, the objectives of reducing the lookup table, reducing computational complexity, improving the accuracy of the intra-prediction result, shortening the encoding and decoding time, and improving the accuracy of encoding and decoding are achieved.

[0150] In actual applications, as shown in Figure 12, the embodiment of the present invention is, decoder The following will be provided. decoder teeth, A second memory 51 configured to store executable intra-predictive instructions, When executing an executable intra-prediction instruction stored in the second memory 51, according to the embodiment of the present invention decrypt The system includes a second processor 52 configured to implement an intra-prediction method on the device side.

[0151] The processor may be implemented by software, hardware, firmware, or a combination thereof, and by using a circuit, one or more application-specific integrated circuits (ASICs), one or more general-purpose integrated circuits, one or more microprocessors, one or more programmable logic devices, or a combination of the said circuits and devices, or other suitable circuits and devices, the processor is made to perform the corresponding steps of the intra prediction method in the embodiment of the decoding device.

[0152] To make it easier to understand, when it is determined that the current hierarchy obtained after partitioning the input point cloud is smaller than the target hierarchy, the occupation information of neighboring nodes of the first quantity of the current node is obtained, and the occupation information of neighboring nodes of the second quantity is extracted from the occupation information of neighboring nodes of the first quantity. The first quantity is greater than the second quantity, and the neighboring nodes of the second quantity and the child nodes of the current node are related. Based on the occupation information of neighboring nodes of the second quantity, an intra-prediction is performed on the occupation information of the child nodes of the current node, and the first prediction result is obtained. In other words, in the embodiment of the present application, when performing an intra-prediction on the occupation information of the child nodes of the current node, by considering only neighboring nodes of the second quantity that are related to the child nodes of the current node, the objectives of reducing the lookup table, reducing computational complexity, improving the accuracy of the intra-prediction result, shortening the encoding and decoding time, and improving the accuracy of encoding and decoding are achieved.

[0153] In the embodiments of this application, each component may be integrated into a single processing unit, each unit may exist as a physically separate entity, or two or more units may be integrated into a single unit. The integrated unit may be implemented in hardware form or in the form of a software function module.

[0154] The integrated unit may be implemented in the form of a software function module and, when sold or used as an independent product, may be stored on a computer-readable storage medium. Under this understanding, the technical solution of this embodiment, essentially or in part with respect to the prior art, or all or part of the technical solution, can be implemented in the form of a software product, which may be stored on a storage medium and may include some instructions for causing a computer device (such as a personal computer, server, or network device) or processor to perform all or part of the steps of the method described in this embodiment. The aforementioned storage medium includes various media capable of storing program code, such as ferromagnetic random access memory (FRAM), read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), flash memory, magnetic surface memory, and optical disc or compact disc read-only memory (CD-ROM). The embodiments of this application are not limited thereto.

[0155] Embodiments of the present invention further provide a computer-readable storage medium. The computer-readable storage medium stores executable intra-prediction instructions, which, when executed by a first processor, are for realizing the encoder-side intra-prediction method according to embodiments of the present invention.

[0156] Embodiments of the present invention further provide a computer-readable storage medium. The computer-readable storage medium stores executable intra-prediction instructions, which, when executed by a second processor, are for realizing the decoder-side intra-prediction method according to embodiments of the present invention. [Industrial applicability]

[0157] The embodiment of the present application provides an intra-prediction method, apparatus, encoder, decoder, and storage medium. When it is determined that the current hierarchy obtained after partitioning the input point cloud is smaller than the target hierarchy, the occupancy information of neighboring nodes of a first quantity of the current node is obtained, and the occupancy information of neighboring nodes of a second quantity is extracted from the occupancy information of neighboring nodes of the first quantity. The first quantity is greater than the second quantity, and the neighboring nodes of the second quantity and the child nodes of the current node are related. Based on the occupancy information of neighboring nodes of the second quantity, an intra-prediction is performed on the occupancy information of the child nodes of the current node to obtain a first prediction result. In other words, in the embodiment of the present application, when performing an intra-prediction on the occupancy information of the child nodes of the current node, by considering only neighboring nodes of a second quantity that are related to the child nodes of the current node, the objectives of reducing the lookup table, reducing computational complexity, improving the accuracy of the intra-prediction result, shortening the encoding and decoding time, and improving the accuracy of encoding and decoding are achieved.

Claims

1. An intra prediction method executed by the decoder, Currently, the first quantity of neighboring nodes' occupancy information for the node is determined, Based on the positional relationship between at least one neighboring node of the current node and one child node of the current node, the occupation quantity of the second neighboring node is determined from the occupation information of the first neighboring node, This includes determining the predicted occupation result of the child nodes of the current node based on the occupation quantity of neighboring nodes of the second quantity, The first quantity is greater than the second quantity. The aforementioned positional relationship includes the fact that at least one neighboring node of the current node and the child node of the current node share a face, edge, or vertex. Intranet prediction method.

2. The aforementioned first quantity is 26. The method according to claim 1.

3. The second quantity is 7. The method according to claim 1.

4. Determine the first threshold and the second threshold, If the occupancy quantity is less than or equal to the first threshold, the child node will not contain any points as a result of the predicted occupancy of the child node of the current node. If the occupancy quantity is equal to or greater than the second threshold, the child node will include a point as a result of the predicted occupancy of the child node of the current node. If the occupancy quantity is greater than the first threshold and less than the second threshold, the occupancy prediction result for the child nodes of the current node is unpredictable. The method according to claim 1.

5. An intra prediction method performed by an encoder, Currently, the first quantity of neighboring nodes' occupancy information for the node is determined, Based on the positional relationship between at least one neighboring node of the current node and one child node of the current node, the occupation quantity of the second neighboring node is determined from the occupation information of the first neighboring node, This includes determining the predicted occupation result of the child nodes of the current node based on the occupation quantity of neighboring nodes of the second quantity, The first quantity is greater than the second quantity. The aforementioned positional relationship includes the fact that at least one neighboring node of the current node and the child node of the current node share a face, edge, or vertex. Intranet prediction method.

6. The aforementioned first quantity is 26. The method according to claim 5.

7. The second quantity is 7. The method according to claim 5.

8. Determine the first threshold and the second threshold, If the occupancy quantity is less than or equal to the first threshold, the child node will not contain any points as a result of the predicted occupancy of the child node of the current node. If the occupancy quantity is equal to or greater than the second threshold, the child node will include a point as a result of the predicted occupancy of the child node of the current node. If the occupancy quantity is greater than the first threshold and less than the second threshold, the occupancy prediction result for the child nodes of the current node is unpredictable. The method according to claim 5.

9. A decoder, wherein the decoder is Currently, the first quantity of neighboring nodes' occupancy information for the node is determined, Based on the positional relationship between at least one neighboring node of the current node and one child node of the current node, the occupation quantity of the second neighboring node is determined from the occupation information of the first neighboring node, The system is configured to determine the predicted occupation result of the child nodes of the current node based on the occupation quantity of neighboring nodes of the second quantity, The first quantity is greater than the second quantity. The aforementioned positional relationship includes the fact that at least one neighboring node of the current node and the child node of the current node share a face, edge, or vertex. decoder.

10. The aforementioned first quantity is 26. The decoder according to claim 9.

11. The second quantity is 7. The decoder according to claim 9.

12. It is configured to determine a first threshold and a second threshold, If the occupancy quantity is less than or equal to the first threshold, the child node will not contain any points as a result of the predicted occupancy of the child node of the current node. If the occupancy quantity is equal to or greater than the second threshold, the child node will include a point as a result of the predicted occupancy of the child node of the current node. If the occupancy quantity is greater than the first threshold and less than the second threshold, the occupancy prediction result for the child nodes of the current node is unpredictable. The decoder according to claim 9.

13. An encoder, wherein the encoder is Currently, the first quantity of neighboring nodes' occupancy information for the node is determined, Based on the positional relationship between at least one neighboring node of the current node and one child node of the current node, the occupation quantity of the second neighboring node is determined from the occupation information of the first neighboring node, The system is configured to determine the predicted occupation result of the child nodes of the current node based on the occupation quantity of neighboring nodes of the second quantity, The first quantity is greater than the second quantity. The aforementioned positional relationship includes the fact that at least one neighboring node of the current node and the child node of the current node share a face, edge, or vertex. Encoder.

14. The aforementioned first quantity is 26. The encoder according to claim 13.

15. The second quantity is 7. The encoder according to claim 13.

16. It is configured to determine a first threshold and a second threshold, If the occupancy quantity is less than or equal to the first threshold, the child node will not contain any points as a result of the predicted occupancy of the child node of the current node. If the occupancy quantity is equal to or greater than the second threshold, the child node will include a point as a result of the predicted occupancy of the child node of the current node. If the occupancy quantity is greater than the first threshold and less than the second threshold, the occupancy prediction result for the child nodes of the current node is unpredictable. The encoder according to claim 13.

17. A non-volatile computer-readable medium comprising a program and a bitstream, wherein the program causes a processor to perform the method according to any one of claims 5 to 8 and generate the bitstream.

Images