Index determination method and device, decoder and encoder
Patent Information
- Application Number
- CN202280094245.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2022-04-16
- Publication Date
- 2024-11-08
AI Technical Summary
The index determination accuracy of point clouds in the existing technology is low, resulting in reduced encoding and decoding performance, making it difficult to effectively compress a large amount of point cloud data.
The index of the current node is determined based on the occupied child nodes of the decoded or encoded neighbor nodes of the current node on the plane perpendicular to the k-th axis to improve the accuracy of the index and the decoding performance.
It improves the accuracy of point cloud indexing, improves encoding and decoding performance, reduces code rate, and saves storage space and transmission traffic.
Smart Images

Figure CN118923107A_ABST
Abstract
Description
Index determination method, device, decoder and encoder Technical Field
[0001] The embodiments of the present application relate to the field of coding and decoding technology, and more specifically, to an index determination method, device, decoder, and encoder. Background Art
[0002] Point clouds have become ubiquitous in various fields, such as virtual / augmented reality, robotics, geographic information systems, and medicine. With the continuous improvement of the accuracy and speed of scanning equipment, large amounts of point clouds can be accurately acquired from object surfaces, often corresponding to hundreds of thousands of points in a single scene. This massive number of points also poses challenges for computer storage and transmission. Therefore, point compression has become a hot topic.
[0003] For point cloud compression, the main requirements are compressing its position information and attribute information. Specifically, the encoder first performs octree partitioning on the point cloud's position information to obtain the divided nodes, and then performs arithmetic encoding on the current node to be encoded to obtain a geometric code stream. At the same time, the encoder selects a point from the encoded points based on the position information of the current point after octree partitioning to predict the predicted value of the current point's attribute information. Based on the selected point, the attribute information is predicted, and then the attribute information is encoded by subtracting the original value of the attribute information to obtain the point cloud's attribute code stream.
[0004] During the arithmetic coding process, the encoder can use the spatial correlation between the current node to be encoded and the surrounding nodes to perform intra-frame prediction on the occupier bits to obtain the index of the current node, and then perform arithmetic coding based on the index of the current node to implement context-based adaptive binary arithmetic coding (CABAC) and thus obtain a geometric code stream.
[0005] However, when determining the index of the current node in the related art, the accuracy is low, thereby reducing the encoding and decoding performance.
[0006] Summary of the Invention
[0007] The embodiments of the present application provide an index determination method, device, decoder, and encoder, which can improve the accuracy of the index for the current node and thereby improve decoding performance.
[0008] In a first aspect, the present application provides an index determination method, comprising:
[0009] A first index of the current node is determined based on occupied child nodes of at least one decoded neighbor node of the current node on a plane perpendicular to the k-th axis.
[0010] In a second aspect, the present application provides an index determination method, comprising:
[0011] A first index of the current node is determined based on occupied child nodes of at least one encoded neighbor node of the current node on a plane perpendicular to the k-th axis.
[0012] In a third aspect, the present application provides an index determination device, comprising:
[0013] A determining unit is configured to determine a first index of the current node based on an occupied subnode of at least one decoded neighbor node of the current node on a plane perpendicular to the k-th axis.
[0014] In a fourth aspect, the present application provides an index determination device, comprising:
[0015] A determining unit is configured to determine a first index of the current node based on an occupied subnode of at least one encoded neighboring node of the current node on a plane perpendicular to the k-th axis.
[0016] In a fifth aspect, the present application provides a decoder, comprising:
[0017] a processor adapted to implement computer instructions; and,
[0018] Computer-readable storage medium, the computer-readable storage medium stores computer instructions, and the computer instructions are suitable for being loaded by a processor and executing the decoding method in the above-mentioned first aspect or its various implementations.
[0019] In one implementation, there are one or more processors and one or more memories.
[0020] In one implementation, the computer-readable storage medium may be integrated with the processor, or the computer-readable storage medium may be provided separately from the processor.
[0021] In a sixth aspect, the present application provides an encoder, comprising:
[0022] a processor adapted to implement computer instructions; and,
[0023] Computer-readable storage medium, the computer-readable storage medium stores computer instructions, and the computer instructions are suitable for being loaded by a processor and executing the encoding method in the above-mentioned second aspect or its various implementations.
[0024] In one implementation, there are one or more processors and one or more memories.
[0025] In one implementation, the computer-readable storage medium may be integrated with the processor, or the computer-readable storage medium may be provided separately from the processor.
[0026] In the seventh aspect, the present application provides a computer-readable storage medium, which stores computer instructions. When the computer instructions are read and executed by a processor of a computer device, the computer device executes the decoding method involved in the first aspect or the encoding method involved in the second aspect.
[0027] In an eighth aspect, the present application provides a code stream, which is the code stream involved in the first aspect or the code stream involved in the second aspect.
[0028] Based on the above technical solution, the present application determines the first index of the current node based on the occupied sub-nodes of at least one encoded neighboring node of the current node on the plane perpendicular to the k-th axis, and can better and more meticulously utilize the spatial correlation between the current node and the at least one neighboring node to predict the first index of the current node, thereby improving the accuracy of the first index and thus improving the decoding performance. BRIEF DESCRIPTION OF THE DRAWINGS
[0029] FIG1 is an example of a point cloud image provided by an embodiment of the present application.
[0030] FIG2 is a partially enlarged view of the point cloud image shown in FIG1 .
[0031] FIG3 is an example of a point cloud image with six viewing angles provided by an embodiment of the present application.
[0032] FIG4 is a schematic block diagram of the coding framework provided in an embodiment of the present application.
[0033] FIG5 is an example of a bounding box provided in an embodiment of the present application.
[0034] FIG6 is an example of performing octree division on a bounding box provided by an embodiment of the present application.
[0035] 7 to 9 show the arrangement order of Morton codes in a two-dimensional space.
[0036] FIG10 shows the arrangement order of Morton codes in three-dimensional space.
[0037] FIG11 is a schematic block diagram of the LOD layer provided in an embodiment of the present application.
[0038] FIG12 is a schematic block diagram of a decoding framework provided in an embodiment of the present application.
[0039] FIG13 is a schematic flowchart of an index determination method provided in an embodiment of the present application.
[0040] FIG14 is an example of occupied sub-nodes of neighbor nodes on the S-axis provided by an embodiment of the present application.
[0041] FIG15 is another schematic flowchart of the index determination method provided in an embodiment of the present application.
[0042] FIG16 is another schematic flowchart of the index determination method provided in an embodiment of the present application.
[0043] FIG17 is a schematic block diagram of an index determination device provided in an embodiment of the present application.
[0044] FIG18 is another schematic block diagram of the index determination device provided in an embodiment of the present application.
[0045] FIG19 is a schematic block diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0046] The technical solutions in the embodiments of the present application will be described below with reference to the accompanying drawings.
[0047] A point cloud is a collection of irregularly distributed discrete points in space that represent the spatial structure and surface properties of a three-dimensional object or scene. Figures 1 and 2 show a 3D point cloud image and a zoomed-in view, respectively. The point cloud surface is composed of densely distributed points.
[0048] A two-dimensional image contains information at every pixel, so there's no need to record its location information separately. However, the distribution of points in a point cloud in three-dimensional space is random and irregular, so it's necessary to record the location of each point in space to fully represent a point cloud. Similar to a two-dimensional image, each point in a point cloud has corresponding attribute information, typically an RGB color value, which reflects the color of the object. For a point cloud, in addition to color, the attribute information corresponding to each point can also be a reflectance value, which reflects the surface material of the object. Each point in a point cloud can include both geometric and attribute information. The geometric information of each point in a point cloud refers to the Cartesian three-dimensional coordinate data of that point, and the attribute information of each point in a point cloud can include, but is not limited to, at least one of the following: color information, material information, and laser reflection intensity information. Color information can be information in any color space. For example, color information can be red, green, and blue (RGB) information. For another example, color information can also be luminance and chrominance (YCbCr, YUV) information. Here, Y represents brightness (Luma), Cb (U) represents the blue chromaticity component, and Cr (V) represents the red chromaticity component. Each point in a point cloud has the same amount of attribute information. For example, each point in a point cloud has two types of attribute information: color information and laser reflection intensity. Another example is that each point in a point cloud has three types of attribute information: color information, material information, and laser reflection intensity information.
[0049] Point cloud images can have multiple viewing angles. For example, the point cloud image shown in Figure 3 can have six viewing angles. The data storage format corresponding to the point cloud image 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.
[0050] Point clouds can flexibly and conveniently express the spatial structure and surface properties of three-dimensional objects or scenes. Moreover, since point clouds are obtained by directly sampling real objects, they 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.
[0051] For example, point clouds can be divided into two categories based on application scenarios: machine-perceived point clouds and human-perceived point clouds. Application scenarios for machine-perceived point clouds include, but are not limited to, autonomous navigation systems, real-time inspection systems, geographic information systems, visual sorting robots, and disaster relief robots. Application scenarios for human-perceived point clouds include, but are not limited to, digital cultural heritage, free-viewpoint broadcasting, 3D immersive communication, and 3D immersive interaction. Accordingly, point clouds can be divided into dense and sparse point clouds based on their acquisition method. They can also be divided into static and dynamic point clouds based on their acquisition approach. More specifically, point clouds can be divided into three types: first-class static point clouds, second-class dynamic point clouds, and third-class dynamically acquired point clouds. For the first-class static point clouds, the object is stationary and the device acquiring the point cloud is also stationary. For the second-class dynamic point clouds, the object is moving, but the device acquiring the point cloud is stationary. For the third-class dynamically acquired point clouds, the device acquiring the point cloud is moving.
[0052] Exemplarily, point cloud acquisition methods include, but are not limited to, 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. Specifically, point clouds on the surface of an object can be acquired through acquisition equipment such as photoelectric radars, lidars, laser scanners, and multi-view cameras. The point cloud obtained according to the principle of laser measurement may include the three-dimensional coordinate information of the point and the laser reflection intensity (reflectance) of the point. The point cloud obtained according to the principle of photogrammetry may include the three-dimensional coordinate information of the point and the color information of the point. The point cloud obtained by combining the principles of laser measurement and photogrammetry may include the three-dimensional coordinate information of the point, the laser reflection intensity (reflectance) of the point, and the color information of the point. These technologies reduce the cost and time cycle of point cloud data acquisition and improve the accuracy of the data. For example, in the medical field, magnetic resonance imaging (MRI), computed tomography (CT), and electromagnetic positioning information can be used to generate point clouds of biological tissues and organs. These technologies reduce the cost and time required to acquire point clouds, while improving data accuracy. While changes in point cloud data acquisition methods have made it possible to acquire large amounts of point cloud data, the processing of massive amounts of 3D point cloud data is facing bottlenecks due to storage space and transmission bandwidth limitations, as application demands grow.
[0053] Taking a point cloud video with a frame rate of 30 fps (frames per second) as an example, each frame of the point cloud contains 700,000 points. Each point in each point cloud frame has coordinate information (xyz, float) and color information (RGB, uchar). Therefore, the data volume of a 10-second point cloud video is approximately 0.7 million × (4 bytes × 3 + 1 byte × 3) × 30 fps × 10 seconds = 3.15 GB. For a 1280 × 720 2D video with a YUV sampling format of 4:2:0 and a frame rate of 24 fps, the data volume for 10 seconds is approximately 1280 × 720 × 12 bits × 24 frames × 10 seconds, which is approximately 0.33 GB. A 10-second two-view 3D video has a data volume of approximately 0.33 × 2 = 0.66 GB. This shows that the data volume of point cloud videos far exceeds that of 2D and 3D videos 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.
[0054] Point cloud compression generally compresses point cloud geometry and attribute information separately. On the encoding side, the point cloud geometry is first encoded in the geometry encoder, and the reconstructed geometry is then fed into the attribute encoder as additional information to assist in attribute compression. On the decoding side, the point cloud geometry is first decoded in the geometry decoder, and the decoded geometry is then fed into the attribute decoder as additional information to assist in attribute compression. The entire codec consists of pre-processing / post-processing, geometry encoding / decoding, and attribute encoding / decoding.
[0055] Exemplarily, the point cloud can be encoded and decoded respectively by various types of encoding frameworks and decoding frameworks. As an example, the encoding and decoding framework can be the Geometry Point Cloud Compression (G-PCC) encoding and decoding framework or the Video Point Cloud Compression (V-PCC) encoding and decoding framework provided by the Moving Picture Experts Group (MPEG), or it can be the AVS-PCC encoding and decoding framework or the Point Cloud Compression Reference Platform (PCRM) framework provided by the Audio Video Standard (AVS) Task Force. The G-PCC encoding and decoding framework can be used to compress the first static point cloud and the third type of dynamically acquired point cloud, and the V-PCC encoding and decoding framework can be used to compress the second type of dynamic point cloud. The G-PCC encoding and decoding framework is also called the Point Cloud Codec TMC13, and the V-PCC encoding and decoding framework is also called the Point Cloud Codec TMC2. Both G-PCC and AVS-PCC are aimed at static sparse point clouds, and their encoding frameworks are roughly the same.
[0056] The following describes the applicable coding and decoding framework using the G-PCC framework as an example.
[0057] In the G-PCC coding framework, the input point cloud is first divided into slices, and then the slices obtained are independently encoded. In the slices, the geometric information of the point cloud and the attribute information corresponding to the points in the point cloud are encoded separately. The G-PCC coding framework first encodes the geometric information; specifically, the coordinates of the geometric information are first transformed so that the entire point cloud is contained in a bounding box; then quantization is performed. This quantization step mainly plays a scaling role. Due to the quantization rounding, the geometric information of some points is the same. The parameters are used to decide whether to remove duplicate points. The process of quantization and removal of duplicate points is also called voxelization. Next, the bounding box is divided based on an octree. According to the different depths of the octree division level, the encoding of geometric information is divided into an octree-based geometric information encoding framework and a triangle soup (trisoup)-based geometric information encoding framework.
[0058] In the octree-based geometric information coding framework, the bounding box is first divided into eight equal parts, and the placeholder bits of the sub-cubes are recorded (1 for non-empty, 0 for empty). The non-empty sub-cubes are then divided into eight equal parts, usually stopping when the resulting leaf node is a 1x1x1 unit cube. During this process, the placeholder bits are intra-predicted using the spatial correlation between the node and its surrounding nodes. Based on the prediction results, the corresponding binary arithmetic encoder is selected for arithmetic encoding, implementing context-based adaptive binary arithmetic coding (CABAC) and generating a binary bitstream.
[0059] In the geometric information coding framework based on triangle face sets, octree partitioning must also be performed first. However, unlike the geometric information coding framework based on octree, the geometric information coding framework based on triangle face sets does not need to divide the point cloud into unit cubes with a side length of 1x1x1 step by step. Instead, the division is stopped when the block has a side length of W. Based on the surface formed by the distribution of the point cloud in each block, at most twelve intersections (vertex) generated by the surface and the twelve edges of the block are obtained, and then the coordinates of the intersection of each block are encoded in turn to generate a binary code stream.
[0060] After encoding the geometric information, the G-PCC coding framework reconstructs the geometric information and uses the reconstructed geometric information to encode the attribute information of the point cloud. Attribute encoding of the point cloud primarily encodes the color information of the points in the point cloud. First, the G-PCC coding framework can perform color space conversion on the color information of the points. For example, when the color information of the points in the input point cloud is represented in the RGB color space, the G-PCC coding framework can convert the color information from RGB to YUV. The G-PCC coding framework then uses the reconstructed geometric information to recolor the point cloud, aligning the unencoded attribute information with the reconstructed geometric information. There are two main transformation methods for color information encoding: one is a distance-based lifting transform that relies on level of detail (LOD) partitioning, and the other is a direct region-adaptive hierarchical transform (RAHT). Both methods transform the color information from the spatial domain to the frequency domain, obtaining high-frequency and low-frequency coefficients. Finally, these coefficients are quantized and encoded to generate a binary bitstream.
[0061] FIG4 is a schematic block diagram of the coding framework provided in an embodiment of the present application.
[0062] As shown in Figure 4, the encoding framework 100 can obtain the location and attribute information of the point cloud from the acquisition device. Point cloud encoding includes location encoding and attribute encoding. In one embodiment, the location encoding process includes: performing coordinate transformation, quantization, and duplicate point removal on the raw point cloud; and then constructing an octree and encoding it to form a geometric code stream.
[0063] As shown in Figure 4, the position encoding process of the encoder can be achieved through the following units:
[0064] A coordinate transformation unit 101 , a quantization and removal of duplicate points unit 102 , an octree analysis unit 103 , a geometry reconstruction unit 104 , and a first arithmetic encoding unit 105 .
[0065] The coordinate transformation unit 101 can be used to transform the world coordinates of points in a point cloud into relative coordinates. For example, the geometric coordinates of the points are subtracted from the minimum values of the x, y, and z coordinate axes, equivalent to a DC removal operation, to transform the coordinates of the points in the point cloud from world coordinates to relative coordinates, so that the entire point cloud is contained within a bounding box. The quantization and duplicate point removal unit 102 can reduce the number of coordinates through quantization. After quantization, originally different points may be assigned the same coordinates. Based on this, duplicate points can be removed through a deduplication operation. For example, multiple clouds with the same quantized position and different attribute information can be merged into a single cloud through attribute transformation. In some embodiments of the present application, the quantization and duplicate point removal unit 102 is an optional unit module. The octree analysis unit 103 can encode the quantized point position information using an octree encoding method. For example, the point cloud is regularized in the form of an octree, so that the point positions can correspond one-to-one with the octree positions. Geometric encoding is performed by counting the positions of the points in the octree and marking them with a flag of 1. The first arithmetic coding unit 105 may perform arithmetic coding on the position information output by the octree analysis unit 103 using entropy coding, ie, the position information output by the octree analysis unit 103 may be arithmetic coded to generate a geometry bit stream; the geometry bit stream may also be called a geometry bit stream.
[0066] The following describes the regularization method of point clouds.
[0067] Since point clouds are irregularly distributed in space, the encoding process is challenging. Therefore, a recursive octree structure is used to represent the points in the point cloud in a regular manner as the center of a cube. For example, as shown in Figure 5, the entire point cloud can be placed in a cube bounding box. At this time, the coordinates of the point in the point cloud can be expressed as (x k ,y k ,z k ), k=0,…,K-1, where K is the total number of points in the point cloud, then the boundary values of the point cloud in the x-axis, y-axis and z-axis directions are:
[0068] x min =min(x 0 ,x 1 ,…,x K-1 );
[0069] y min =min(y 0 ,y 1 ,…,y K-1 );
[0070] z min =min(z 0 ,z 1 ,…,z K-1 );
[0071] x max =max(x 0 ,x 1 ,…,x K-1 );
[0072] y max =max(y 0 ,y 1 ,…,y K-1 );
[0073] z max =max(z 0 ,z 1 ,…,z K-1 ).
[0074] In addition, the origin of the bounding box (x origin ,y origin ,z origin ) can be calculated as follows:
[0075] x origin =int(floor(x min ));
[0076] y origin =int(floor(y min ));
[0077] z origin =int(floor(z min )).
[0078] Among them, floor() represents floor calculation or rounding down calculation. int() represents rounding operation.
[0079] Based on this, the encoder can calculate the size of the bounding box in the x-axis, y-axis, and z-axis directions based on the calculation formula of the boundary value and the origin as follows:
[0080] BoudingBoxSize_x=int(x max -x origin )+1;
[0081] BoudingBoxSize_y=int(y max -y origin )+1;
[0082] BoudingBoxSize_z=int(z max -z origin )+1.
[0083] As shown in Figure 6, after the encoder obtains the dimensions of the bounding box in the x-axis, y-axis, and z-axis directions, it first performs an octree partition on the bounding box, obtaining eight sub-blocks each time. Then, the non-empty blocks in the sub-blocks (blocks containing points) are once again partitioned by the octree. This recursive partitioning continues until a certain depth is reached. 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 of the voxel. The attribute value of the center point is the average of the attribute values of all the points in the voxel. Regularizing the point cloud into blocks in space is conducive to describing the positional relationship between points in the point cloud, and thus facilitates the design of a specific encoding order. Based on this, the encoder can encode each voxel based on the determined encoding order, that is, encode the point (or "node") represented by each voxel.
[0084] After completing geometric encoding, the encoder reconstructs the geometric information and uses it to encode the attribute information. The attribute encoding process includes: given the reconstructed information of the input point cloud's position information and the true value of the attribute information, selecting one of three prediction modes for point cloud prediction, quantizing the predicted results, and performing arithmetic coding to form the attribute code stream.
[0085] As shown in Figure 4, the attribute encoding process of the encoder can be implemented by the following units:
[0086] A color space transform unit 110 , an attribute transform unit 111 , a region adaptive hierarchical transform (RAHT) unit 112 , a predicting transform unit 113 , a lifting transform unit 114 , a quantization unit 115 and a second arithmetic coding unit 116 .
[0087] The color space conversion unit 110 can be used to convert the RGB color space of the points in the point cloud into a YCbCr format or other formats. The attribute conversion unit 111 can be used to convert the attribute information of the points in the point cloud to minimize attribute distortion. For example, in the case of lossy geometry coding, since the geometric information changes after the geometry coding, the attribute conversion unit 111 is required to reallocate attribute values to each point after the geometry coding so that the attribute error between the reconstructed point cloud and the original point cloud is minimized. For example, the attribute information can be the color information of the point. The attribute conversion unit 111 can be used to obtain the original attribute value of the point. After the original attribute value of the point is obtained by the attribute conversion unit 111, any prediction unit can be selected to predict the point in the point cloud. The unit for predicting the point in the point cloud may include at least one of: RAHT 112, a predicting transform unit 113, and a lifting transform unit 114. In other words, any one of the RAHT 112, the predicting transform unit 113, and the lifting transform unit 114 can be used to predict the attribute information of a point in the point cloud to obtain a predicted attribute value for the point. Furthermore, a residual value of the attribute information of the point can be obtained based on the predicted attribute value of the point. For example, the residual value of the attribute information of the point can be the original attribute value of the point minus the predicted attribute value of the point. The quantization unit 115 can be used to quantize the residual value of the attribute information of the point. For example, if the quantization unit 115 is connected to the predicting transform unit 113, the quantization unit 115 can be used to quantize the residual value of the attribute information of the point output by the predicting transform unit 113. For example, the residual value of the attribute information of the point output by the predicting transform unit 113 can be quantized using a quantization step size to improve system performance. The second arithmetic coding unit 116 can perform entropy encoding on the residual value of the attribute information of the point using zero run length coding to obtain an attribute code stream. The attribute code stream can be bitstream information.
[0088] The prediction transformation unit 113 can be used to obtain the original order of the point cloud and divide the point cloud into detail layers (LOD) based on the original order of the point cloud. After obtaining the LOD of the point cloud, the prediction transformation unit 113 can predict the attribute information of the points in the LOD in sequence, and then calculate the residual value of the attribute information of the point, so that the subsequent unit can perform subsequent quantization encoding processing based on the residual value of the attribute information of the point. For each point in the LOD, based on the neighbor point search result on the LOD where the current point is located, the three neighbor points before the current point are found, and then the attribute reconstruction value of at least one of the three neighbor points is used to predict the current point to obtain the attribute prediction value of the current point; based on this, the residual value of the attribute information of the current point can be obtained based on the attribute prediction value of the current point and the original attribute value of the current point.
[0089] The original order of the point cloud obtained by the prediction transformation unit 113 may be the order obtained by performing Morton reordering on the current point cloud by the prediction transformation unit 113. The encoder may obtain the original order of the current point cloud by reordering the current point cloud. After obtaining the original order of the current point cloud, the encoder may divide the points in the point cloud into layers according to the original order of the current point cloud to obtain the LOD of the current point cloud, and then predict attribute information of the points in the point cloud based on the LOD.
[0090] 7 to 9 show the arrangement order of Morton codes in a two-dimensional space.
[0091] As shown in Figure 7, the encoder can use a zigzag Morton sequence in the two-dimensional space formed by 2*2 blocks. As shown in Figure 8, the encoder can use a zigzag Morton sequence in the two-dimensional space formed by four 2*2 blocks, wherein each 2*2 block can also use a zigzag Morton sequence, ultimately resulting in the Morton sequence used by the encoder in the two-dimensional space formed by 4*4 blocks. As shown in Figure 9, the encoder can use a zigzag Morton sequence in the two-dimensional space formed by four 4*4 blocks, wherein each four 2*2 blocks and each 2*2 block can also use a zigzag Morton sequence, ultimately resulting in the Morton sequence used by the encoder in the two-dimensional space formed by 8*8 blocks.
[0092] FIG10 shows the arrangement order of Morton codes in three-dimensional space.
[0093] As shown in Figure 10, the Morton arrangement order is not only applicable to two-dimensional space, but can also be extended to three-dimensional space. For example, Figure 10 shows 16 points. Within each "z", the Morton arrangement order between each "z" and "z" is first encoded along the x-axis, then along the y-axis, and finally along the z-axis.
[0094] The LOD generation process includes: obtaining the Euclidean distance between points based on the position information of the points in the point cloud; and dividing the points into different LOD layers based on the Euclidean distance. In one embodiment, the Euclidean distances can be sorted and then Euclidean distances of different ranges can be divided into different LOD layers. For example, a point can be randomly selected as the first LOD layer. The Euclidean distances between the remaining points and the point are then calculated, and the points whose Euclidean distances meet the first threshold requirement are classified as the second LOD layer. The centroid of the points in the second LOD layer is obtained, and the Euclidean distances between the points other than the first and second LOD layers and the centroid are calculated, and the points whose Euclidean distances meet the second threshold requirement are classified as the third LOD layer. And so on, all points are classified into LOD layers. By adjusting the threshold of the Euclidean distance, the number of points in each layer of LOD can be increased. It should be understood that the LOD layer division method can also adopt other methods, and this application does not limit this. It should be noted that the point cloud can be directly divided into one or more LOD layers, or the point cloud can be first divided into multiple point cloud slices, and then each point cloud slice can be divided into one or more LOD layers. For example, the point cloud can be divided into multiple point cloud slices, and the number of points in each point cloud slice can be between 550,000 and 1.1 million. Each point cloud slice can be regarded as a separate point cloud. Each point cloud slice can be divided into multiple LOD layers, and each LOD layer includes multiple points. In one embodiment, the LOD layer can be divided according to the Euclidean distance between points.
[0095] FIG11 is a schematic block diagram of the LOD layer provided in an embodiment of the present application.
[0096] As shown in Figure 11, assuming that the point cloud includes a plurality of points arranged in the original order, namely P0, P1, P2, P3, P4, P5, P6, P7, P8 and P9, it is assumed that the point cloud can be divided into three LOD layers, namely LOD0, LOD1 and LOD2, based on the Euclidean distance between points. Among them, LOD0 may include P0, P5, P4 and P2, LOD2 may include P1, P6 and P3, and LOD3 may include P9, P8 and P7. At this time, LOD0, LOD1 and LOD2 can be used to form the LOD-based order of the point cloud, namely P0, P5, P4, P2, P1, P6, P3, P9, P8 and P7. The LOD-based order can be used as the encoding order of the point cloud.
[0097] For example, when predicting the current point in the point cloud, the encoder creates multiple prediction variable candidates based on the neighbor point search results on the LOD where the current point is located, that is, the index value of the prediction mode (predMode) can be 0-3. For example, when using the prediction method to encode the attribute information of the current point, the encoder first finds the three neighbor points before the current point based on the neighbor point search result on the LOD where the current point is located. The prediction mode with an index of 0 means that the weighted average of the reconstructed attribute values of the three neighbor points is determined as the attribute prediction value of the current point based on the distance between the three neighbor points and the current point; the prediction mode with an index of 1 means that the attribute reconstruction value of the nearest neighbor point among the three neighbor points is used as the attribute prediction value of the current point; the prediction mode with an index of 2 means that the attribute reconstruction value of the second nearest neighbor point is used as the attribute prediction value of the current point; the prediction mode with an index of 3 means that the attribute reconstruction value of the neighbor points other than the nearest neighbor point and the second nearest neighbor point among the three neighbor points is used as the attribute prediction value of the current point; after obtaining the candidate options for the attribute prediction value of the current point based on the above various prediction modes, the encoder can use rate distortion optimization (RDO) technology to select the best attribute prediction value, and then perform arithmetic coding on the selected attribute prediction value.
[0098] Furthermore, if the index of the prediction mode at the current point is 0, the index of the prediction mode does not need to be encoded in the code stream. If the index of the prediction mode selected by RDO is 1, 2 or 3, the index of the selected prediction mode needs to be encoded in the code stream, that is, the index of the selected prediction mode needs to be encoded into the attribute code stream.
[0099] Table 1
[0100]
[0101] As shown in Table 1, when the attribute information of the current point P2 is encoded using a prediction method, the prediction mode with an index of 0 refers to determining the weighted average of the reconstructed attribute values of the neighboring points P0, P5 and P4 based on the distances of the neighboring points P0, P5 and P4 as the attribute prediction value of the current point P2; the prediction mode with an index of 1 refers to using the attribute reconstruction value of the nearest neighbor point P4 as the attribute prediction value of the current point P2; the prediction mode with an index of 2 refers to using the attribute reconstruction value of the next neighbor point P5 as the attribute prediction value of the current point P2; the prediction mode with an index of 3 refers to using the attribute reconstruction value of the next neighbor point P0 as the attribute prediction value of the current point P2.
[0102] The RDO technology is described below by way of example.
[0103] The encoder first calculates the maximum difference maxDiff in the attributes of at least one neighboring point of the current point, compares maxDiff with the set threshold, and if it is less than the set threshold, uses the prediction mode of weighted average of the attribute values of the neighboring points; otherwise, uses the RDO technology to select the optimal prediction mode for this point. Specifically, the encoder calculates the maximum difference maxDiff in the attributes of at least one neighboring point of the current point. For example, it first calculates the maximum difference in the R component of at least one neighboring point of the current point, that is, max(R1,R2,R3)-min(R1,R2,R3); similarly, the encoder calculates the maximum difference in the G and B components of at least one neighboring point of the current point, that is, max(G1,G2,G3)-min(G1,G2,G3) and max(B1,B2,B3)-min(B1,B2,B3), and then selects the maximum difference value in the R, G, and B components as maxDiff, i.e., maxDiff = max(max(R1, R2, R3) - min(R1, R2, R3), max(G1, G2, G3) - min(G1, G2, G3), max(B1, B2, B3) - min(B1, B2, B3)); the encoder compares the obtained maxDiff with the set threshold. If it is less than the set threshold, the prediction mode of the current point is set to 0, i.e., predMode = 0; if it is greater than or equal to the set threshold, the encoder can use the RDO technology to determine the prediction mode for the current point. For RDO technology, the encoder can calculate the corresponding rate-distortion cost for each prediction mode of the current point, and then select the prediction mode with the smallest rate-distortion cost, i.e., the optimal prediction mode, as the attribute prediction mode for the current point.
[0104] For example, the rate-distortion cost of the prediction mode with index 1, 2 or 3 can be calculated by the following formula:
[0105] J indx_i =D indx_i +λ×R indx_i ;
[0106] Among them, J indx_i Represents the rate-distortion cost when the current point adopts the prediction mode with index i, D is the sum of the three components of attrResidualQuant, that is, D = attrResidualQuant[0] + attrResidualQuant[1] + attrResidualQuant[2]. λ is determined according to the quantization parameter of the current point, R indx_i Indicates the number of bits required in the bitstream for the quantized residual value obtained when the prediction mode with index i is used at the current point.
[0107] For example, after the encoder determines the prediction mode used for the current point, it can determine the attribute prediction value attrPred of the current point based on the determined prediction mode, and then use the original attribute value attrValue of the current point to subtract the attribute prediction value attrPred of the current point and quantize the result to obtain the quantized residual value attrResidualQuant of the current point. For example, the encoder can determine the quantized residual value of the current point using the following formula:
[0108] attrResidualQuant=(attrValue-attrPred) / Qstep;
[0109] Where attrResidualQuant represents the quantization residual value of the current point, attrPred represents the attribute prediction value of the current point, attrValue represents the attribute original value of the current point, and Qstep represents the quantization step size. Qstep is calculated from the quantization parameter (Qp).
[0110] For example, the attribute reconstruction value of the current point can be used as a neighboring candidate of the subsequent point, and the attribute information of the subsequent point can be predicted using the reconstruction value of the current point. The encoder can determine the attribute reconstruction value of the current point based on the first quantized residual value using the following formula:
[0111] Recon=attrResidualQuant×Qstep+attrPred;
[0112] Where Recon represents the reconstructed attribute value of the current point determined based on the quantization residual value of the current point, attrResidualQuant represents the quantization residual value of the current point, Qstep represents the quantization step size, and attrPred represents the predicted attribute value of the current point. Qstep is calculated from the quantization parameter (Qp).
[0113] It should be noted that in this application, the attribute prediction value (predictedvalue) of the current point can also be referred to as the predicted value of the attribute information or the color prediction value (predictedColor). The attribute original value of the current point can also be referred to as the true value of the attribute information of the current point or the color original value. The residual value of the current point can also be referred to as the difference between the attribute original value of the current point and the attribute prediction value of the current point or the color residual value (residualColor) of the current point. The attribute reconstructed value (reconstructedvalue) of the current point can also be referred to as the reconstructed value of the attribute of the current point or the color reconstructed value (reconstructedColor).
[0114] FIG12 is a schematic block diagram of a decoding framework 200 provided in an embodiment of the present application.
[0115] The decoding framework 200 can obtain the code stream of the point cloud from the encoding device, and obtain the position information and attribute information of the points in the point cloud by parsing the code. The decoding of the point cloud includes position decoding and attribute decoding. The process of position decoding includes: performing arithmetic decoding on the geometric code stream; constructing an octree and then merging it to reconstruct the position information of the point to obtain the reconstructed information of the position information of the point; performing coordinate transformation on the reconstructed information of the position information of the point to obtain the position information of the point. The position information of the point can also be called the geometric information of the point. The attribute decoding process includes: obtaining the residual value of the attribute information of the point in the point cloud by parsing the attribute code stream; obtaining the residual value of the attribute information of the point after dequantization by dequantizing the residual value of the attribute information of the point; selecting one of the three prediction modes to perform point cloud prediction based on the reconstructed information of the position information of the point obtained in the position decoding process to obtain the attribute reconstruction value of the point; performing color space inverse transformation on the attribute reconstruction value of the point to obtain the decoded point cloud.
[0116] As shown in FIG12 , position decoding can be implemented by the following units: a first arithmetic decoding unit 201, an octree analysis unit 202, a geometry reconstruction unit 203, and an inverse transform coordinates unit 204. Attribute encoding can be implemented by the following units: a second arithmetic decoding unit 210, an inverse quantization unit 211, a RAHT unit 212, a predicting transform unit 213, a lifting transform unit 214, and an inverse transform colors unit 215.
[0117] It should be noted that decompression is the inverse process of compression. Similarly, the functions of each unit in the decoding framework 200 can refer to the functions of the corresponding units in the encoding framework 100. For example, the decoding framework 200 can divide the point cloud into multiple LODs based on the Euclidean distance between points in the point cloud; then, the attribute information of the points in the LODs is decoded in sequence; for example, the number of zeros (zero_cnt) in the zero-run encoding technology is calculated to decode the residual based on the number of zeros; then, the decoding framework 200 can perform dequantization based on the decoded residual value, and obtain the reconstructed value of the point cloud based on the dequantized residual value and the predicted value of the current point, until all point clouds are decoded. The current point will serve as the nearest neighbor of the point in the subsequent LOD, and the reconstructed value of the current point will be used to predict the attribute information of the subsequent point.
[0118] During the arithmetic coding process, the encoder can use the spatial correlation between the current node to be encoded and the surrounding nodes to perform intra-frame prediction on the occupied bits, and select the corresponding binary arithmetic encoder based on the prediction result to perform arithmetic coding to implement context-based adaptive binary arithmetic coding (CABAC) and thus obtain a geometric code stream.
[0119] For example, the encoder can determine the first index of the current node by storing the encoded and decoded nodes before the current node, and using the plane information of the last encoded and decoded node located on a certain plane and the distance between the last encoded and decoded node and the current node, and then determine the context index based on the determined first index, and then encode the current node based on the obtained context index. Specifically, if the plane information of the last encoded and decoded node is 0, the decoder determines that the first index of the current node is 0; if the plane information of the last encoded and decoded node is 1, the decoder determines that the first index of the current node is 1; otherwise, the decoder determines that the first index of the current node is -1.
[0120] When the first index of the current node is determined to be -1, it indicates that the current node does not satisfy the plane mode; when the first index of the current node is determined to be 1, it indicates that the current node satisfies the plane mode with k=1; and when the first index of the current node is determined to be 0, it indicates that the current node satisfies the plane mode with k=0. Determining that the current node satisfies the plane mode with k=0 means determining that there is an occupied child node in the current node on the plane with k=0, and determining that the current node satisfies the plane mode with k=1 means determining that there is an occupied child node in the current node on the plane with k=1.
[0121] However, using the plane information of previously encoded and decoded nodes to determine the first index of the current node has low accuracy, which in turn reduces encoding and decoding performance. For example, in a coding order based on the Morton order, the previous encoded and decoded node is not necessarily a neighbor node of the current node. In this case, using the plane information of previously encoded and decoded nodes to determine the first index of the current node has low accuracy. In view of this, embodiments of the present application provide an index determination method, device, decoder, and encoder that can improve the accuracy of the first index, thereby improving decoding performance.
[0122] FIG13 is a schematic flow chart of an index determination method 300 provided in an embodiment of the present application. It should be understood that the index determination method 300 can be executed by a decoder. For example, it can be applied to the decoding framework 200 shown in FIG12 . For ease of description, the following description uses a decoder as an example.
[0123] As shown in FIG13 , the index determination method 300 may include:
[0124] S310 : The decoder determines a first index of the current node based on occupied child nodes of at least one decoded neighboring node of the current node on a plane perpendicular to the k-th axis.
[0125] In this embodiment, the first index of the current node is determined based on the occupied sub-nodes of at least one encoded neighboring node of the current node on a plane perpendicular to the k-th axis, thereby avoiding directly predicting the first index of the current node based on the plane information of the encoded and decoded node. The spatial correlation between the current node and the at least one neighboring node can be better and more meticulously utilized to determine the first index of the current node, thereby improving the accuracy of the first index and thereby improving the decoding performance.
[0126] This embodiment determines the first index of the current node based on the occupied child nodes of at least one decoded neighbor node of the current node on the plane perpendicular to the k-th axis, which can bring about a gain in decoding performance. The following is a description of the results obtained by testing the solution provided by this application on a test platform in conjunction with Tables 2 and 3. Among them, Table 2 shows the representative rate distortion (Bit distortion, BD-rate) under lossy compression of geometric information. The BD-Rate under lossy compression of geometric information indicates: when obtaining the same encoding quality, the bit rate ratio when using the technical solution provided by this application is compared with the bit rate saving (BD-Rate is a negative value) or increase (BD-Rate is a positive value) when not using the technical solution provided by this application. Table 3 shows the Bpip ratio (Bpip Ratio) under lossless compression of geometric information. The Bpip Ratio under lossless compression of geometric information indicates: when there is no loss of point cloud quality, the bit rate when using the technical solution provided by this application accounts for the percentage of the bit rate when not using the technical solution provided by this application. The lower the value, the greater the bit rate saved when encoding and decoding using the solution provided by this application.
[0127] Table 2
[0128]
[0129] As shown in Table 2, Cat1-A represents a point cloud containing only reflectance information, and Cat1-A average represents the average BD-rate of each component of Cat1A under lossy compression of geometric information. Cat1-B represents a point cloud containing only color information, and Cat1-B average represents the average BD-rate of each component of Cat1-B under lossy compression of geometric information. Cat3-fused and Cat3-frame both represent point clouds containing color information and other attribute information. Cat3-fused average represents the average BD-rate of each component of Cat3-fused under lossy compression of geometric information; Cat3-frame average represents the average BD-rate of each component of Cat3-frame under lossy compression of geometric information. Overall average represents the average BD-rate of Cat1-A through Cat3-frame under lossy compression of geometric information. D1 represents the BD-rate based on the same point-to-point error, and D2 represents the BD-rate based on the same point-to-surface error. As can be seen from Table 2, the index determination method provided in this application has obvious performance improvements for Cat1-A, Cat3-frame and Cat1-B.
[0130] Table 3
[0131]
[0132] As can be seen from Table 3, the index determination method provided in this application has performance improvements for Cat1-A, Cat3-frame and Cat1-B.
[0133] It should be understood that the naming of the first index involved in this application is not specifically limited.
[0134] For example, in other alternative embodiments, the decoder determines the first index of the current node based on the occupied subnode of at least one decoded neighbor node of the current node on a plane perpendicular to the k-th axis, which can also be called the plane mode flag occ_plane_pos[k] of the current node on the k-th axis, or the plane contextualization (Planar contextualization of occ_plane_pos[k]), or the expression or variable determined based on the occupied subnode of at least one decoded neighbor node of the current node on a plane perpendicular to the k-th axis. In addition, the occupied subnode of the at least one neighbor node can also be equivalently replaced by a non-empty subnode represented by the value of the placeholder bit in at least one neighbor node, or a term with a similar meaning, which is not specifically limited in this application.
[0135] The decoder may determine an occupied child node of at least one neighboring node of the current node based on the placeholder bits of each child node of at least one decoded neighboring node of the current node on a plane perpendicular to the k-th axis. In other words, the decoder may predict a first index of the current node based on the placeholder bits (or information) of the child nodes of at least one decoded neighboring node of the current node on a plane perpendicular to the k-th axis.
[0136] For example, the locations of the indexes involved in this application are described below in conjunction with Table 4.
[0137] Table 4
[0138]
[0139] As shown in Table 4, occtree_planar_enabled indicates whether the current point cloud allows the use of planar mode. If occtree_planar_enabled is true, the decoder traverses the k-th axis to obtain PlanarEligible[k]. PlanarEligible[k] indicates whether the current point cloud allows the use of planar mode on the k-th axis. Optionally, when k takes the value of 0, 1, or 2, it represents the S, T, and V axes. If PlanarEligible[k] is true, the decoder obtains occ_single_plane[k]. occ_single_plane[k] indicates whether the current node allows the use of planar mode on the k-th axis. If occ_single_plane[k] is true, the decoder can determine the plane mode flag occ_plane_pos[k] based on at least one decoded neighbor node of the current node on a plane perpendicular to the k-th axis.
[0140] For example, Table 5 shows the correspondence between k and the planar axis:
[0141] Table 5
[0142]
[0143] In some embodiments, the S310 may include:
[0144] If the at least one neighbor node is not empty, the decoder determines the first index based on the occupied child nodes of the at least one neighbor node.
[0145] Exemplarily, if any one of the at least one neighbor node is non-empty, the decoder determines the first index based on an occupied child node of the at least one neighbor node.
[0146] Exemplarily, if the at least one neighbor node includes only one non-empty neighbor node, and the one non-empty neighbor node includes multiple occupied sub-nodes, the decoder determines the first index based on the occupied sub-nodes of the at least one neighbor node.
[0147] Exemplarily, if the at least one neighbor node includes one or more non-empty neighbor nodes, the decoder determines the first index based on occupied child nodes of the at least one neighbor node.
[0148] In some embodiments, the S310 may include:
[0149] If the occupied sub-nodes of at least one neighbor node are all distributed on a first plane perpendicular to the k-th axis, the decoder determines that the first index is a first value; if the occupied sub-nodes of at least one neighbor node are all distributed on a second plane perpendicular to the k-th axis, the decoder determines that the first index is a second value; otherwise, the decoder determines that the first index is a third value.
[0150] Exemplarily, the first plane may be a high plane, and the second plane may be a low plane.
[0151] Exemplarily, the first plane may be a plane where k=1, and the second plane may be a plane where k=0.
[0152] Exemplarily, the decoder may determine the first index based on the plane in which the occupied sub-nodes of the at least one neighboring node are located. If the occupied sub-nodes of the at least one neighboring node are distributed in the same plane, the decoder determines the first index based on the same plane; for example, if the same plane is the first plane, the first index is determined to be a first value; if the same plane is the second plane, the first index is determined to be a second value. If the occupied sub-nodes of the at least one neighboring node are not distributed in the same plane, the first index is determined to be a third value.
[0153] Exemplarily, the decoder first determines whether the occupied sub-nodes of the at least one neighbor node are all distributed on the first plane. If the occupied sub-nodes of the at least one neighbor node are all distributed on the first plane, the decoder determines the first index as a first value; if the occupied sub-nodes of the at least one neighbor node are not all distributed on the first plane, the decoder determines whether the occupied sub-nodes of the at least one neighbor node are all distributed on the second plane. If the occupied sub-nodes of the at least one neighbor node are all distributed on the second plane, the decoder determines the first index as a second value; if the occupied sub-nodes of the at least one neighbor node are not all distributed on the second plane, the decoder determines the first index as a third value.
[0154] Exemplarily, the decoder first determines whether the occupied sub-nodes of the at least one neighbor node are all distributed on the second plane. If the occupied sub-nodes of the at least one neighbor node are all distributed on the second plane, the decoder determines that the first index is the second value; if the occupied sub-nodes of the at least one neighbor node are not evenly distributed on the second plane, the decoder determines whether the occupied sub-nodes of the at least one neighbor node are all distributed on the first plane. If the occupied sub-nodes of the at least one neighbor node are all distributed on the first plane, the decoder determines that the first index is the first value; if the occupied sub-nodes of the at least one neighbor node are not all distributed on the first plane, the decoder determines that the first index is the third value.
[0155] In some embodiments, the method 300 may further include:
[0156] The decoder determines a second index of the current node based on a distance between the at least one neighbor node and the current node.
[0157] In some embodiments, the decoder determines the second index to be a fourth value.
[0158] Exemplarily, if the decoder determines the first index based on the occupied child nodes of the at least one neighboring node, the decoder directly determines the second index as the fourth value.
[0159] Exemplarily, the fourth value is a predefined value.
[0160] Exemplarily, the pre-definition can be implemented by pre-storing corresponding codes, tables, or other methods that can be used to indicate relevant information in a device (e.g., including a decoder and an encoder). This application does not limit the specific implementation method. For example, the pre-defined value can refer to a value defined in a protocol. Alternatively, the "protocol" can refer to a standard protocol in the field of codec technology, such as a VCC or ECM protocol.
[0161] In some embodiments, the fourth value is 0 and is used to indicate that the distance between the at least one neighbor node and the current node is less than or equal to a preset threshold.
[0162] In some embodiments, the fourth value is 0 and is used to indicate that the at least one neighboring node is within a preset area of the current node.
[0163] Of course, in other alternative embodiments, the fourth value may also take other values, and this application does not limit its specific value.
[0164] In some embodiments, the distance between the at least one neighbor node and the current node is a Manhattan distance.
[0165] Of course, in other alternative embodiments, the distance between the at least one neighbor node and the current node may also be other types of distances, such as Euclidean distance or Morton distance, and this application does not limit its specific value.
[0166] In some embodiments, the method 300 may further include:
[0167] If the at least one neighbor node is empty, the decoder determines the third index based on plane information of a previous decoded node of the current node on a plane perpendicular to the k-th axis.
[0168] Exemplarily, the plane information of the previously decoded node may also refer to a plane perpendicular to the k-th axis where the occupied child node of the previously decoded node is located. For example, the plane perpendicular to the k-th axis where the occupied child node of the previously decoded node is located may be a first plane (e.g., a high plane or a plane where k=1). For example, the plane perpendicular to the k-th axis where the occupied child node of the previously decoded node is located may be a second plane (e.g., a low plane or a plane where k=0).
[0169] In some embodiments, the S310 may include:
[0170] If the plane information is 1, the decoder determines that the third index is a first value; if the plane information is not 1, the decoder determines that the third index is a second value.
[0171] Exemplarily, if the plane perpendicular to the k-th axis where the occupied sub-node of the previously decoded node is located is a first plane (e.g., a high plane or a plane with k=1), the decoder determines that the third index is a first value; if the plane perpendicular to the k-th axis where the occupied sub-node of the previously decoded node is located is not the first plane (e.g., a high plane or a plane with k=1), the decoder determines that the third index is a second value.
[0172] In some embodiments, the S310 may include:
[0173] If the plane information is 0, the decoder determines that the third index is the second value; if the plane information is not 0, the decoder determines that the third index is the first value.
[0174] In some embodiments, the method 300 may further include:
[0175] The decoder determines a fourth index based on a distance between the previous decoded node and the current node.
[0176] Exemplarily, if the decoder determines the third index based on the plane information of the previous decoded node of the current node on the plane perpendicular to the k-th axis, the decoder can determine the fourth index of the current node based on the distance between the previous decoded node and the current node.
[0177] In some embodiments, the decoder obtains a depth level n of the octree in which the planar mode is enabled; and determines the fourth index based on the n.
[0178] For example, the current point cloud has enabled octree depth layer continuity in planar mode.
[0179] For example, when the number of octree division layers of the current point cloud is m, if the planar mode is enabled at the tth layer and the octree depth layers of the current point cloud with the planar mode enabled are continuous, then for the tth layer, n=1; for the t+1 layer, n=2; and so on, for the mth layer, n=m-t+1.
[0180] For example, when the number of octree division layers of the current point cloud is 10, if the planar mode is enabled at the 5th layer and the octree depth layers of the current point cloud with the planar mode enabled are continuous, then for the 5th layer, n=1; for the 6th layer, n=2; for the 7th layer, n=3; for the 8th layer, n=4; for the 9th layer, n=5; and for the 10th layer, n=6.
[0181] In some embodiments, if the distance between the previous decoded node and the current node is less than or equal to 2 n , the decoder determines that the fourth index is the fifth value; if the distance between the previous decoded node and the current node is greater than 2 n , the decoder determines that the second index of the current node is the sixth value.
[0182] In some embodiments, the fifth value is 0 and is used to indicate that: the distance between the previous decoded node and the current node is less than or equal to a preset threshold, or the previous decoded node is within a preset area of the current node; and / or, the sixth value is 1 and is used to indicate that: the distance between the previous decoded node and the current node is greater than a preset threshold, or the previous decoded node is not within the preset area of the current node.
[0183] Of course, in other alternative embodiments, the fifth value or the sixth value may also take other values. The solution of the present application only needs to ensure that the fifth value or the sixth value is different, and there is no limitation on its specific value.
[0184] Of course, in other embodiments, other methods may be used to determine the fourth index based on n, and this application does not specifically limit this. For example, the fourth index may be determined by directly comparing the distance between the previous decoded node and the current node with n. For another example, the fourth index may be determined by directly comparing the distance between the previous decoded node and the current node with the value of another function related to n.
[0185] In some embodiments, the distance between the previous decoded node and the current node is Manhattan distance.
[0186] In some embodiments, the first value is 1, the second value is 0, and the third value is -1.
[0187] Of course, in other alternative embodiments, the first value, the second value or the third value may also take other values. The solution of the present application only needs to ensure that the first value, the second value and the third value are different from each other, and there is no limitation on their specific values.
[0188] In some embodiments, when the first index is the first value, it represents that the current node satisfies the plane mode of the first plane (for example, the high plane or the plane with k=1); when the first index is the second value, it represents that the current node satisfies the plane mode of the second plane (for example, the low plane or the plane with k=0); when the first index is the third value, it represents that the current node does not satisfy the plane mode.
[0189] Exemplarily, when the decoder determines that the first index is a first value, it means that the decoder can predict that the current node satisfies the plane mode of the first plane (e.g., the high plane or the plane with k=1); when the decoder determines that the first index is a second value, it means that the decoder can predict that the current node satisfies the second plane mode; when the decoder determines that the first index is a third value, it means that the decoder can predict that the current node does not satisfy the plane mode of the second plane (e.g., the low plane or the plane with k=0). The decoder predicts that the current node satisfies the plane mode of the second plane (e.g., the low plane or the plane with k=0) means that the decoder can predict that there are occupied subnodes in the current node on the second plane (e.g., the low plane or the plane with k=0); the decoder predicts that the current node satisfies the plane mode of the first plane (e.g., the high plane or the plane with k=1) means that the decoder can predict that there are occupied subnodes in the current node on the first plane (e.g., the high plane or the plane with k=1); the decoder predicts that the current node does not satisfy the plane mode means that the decoder can predict that there are no occupied subnodes in the current node or that the existing occupied subnodes are not all distributed on one plane.
[0190] In some embodiments, the value of k is 0, 1, or 2.
[0191] For example, the values of k are 0, 1, and 2, which represent the S, T, and V axes.
[0192] Exemplarily, the decoder may determine the index of the current node on the S-axis based on the occupied subnodes of at least one decoded neighboring node of the current node on a plane perpendicular to the S-axis, may also determine the index of the current node on the T-axis based on the occupied subnodes of at least one decoded neighboring node of the current node on a plane perpendicular to the T-axis, and may further determine the index of the current node on the V-axis based on the occupied subnodes of at least one decoded neighboring node of the current node on a plane perpendicular to the V-axis. In other words, the first index determined by the decoder may include one or more of the index of the current node on the S-axis, the index of the current node on the T-axis, and the index of the current node on the V-axis.
[0193] In some embodiments, the at least one neighbor node includes a node that has been decoded and is adjacent to the current node.
[0194] Below, in combination with Figure 14, the method for determining the index of the current node is exemplified by taking the example of the decoder first determining whether the occupied sub-nodes of at least one neighbor node are all distributed on the first plane, and then determining whether the occupied sub-nodes of at least one neighbor node are all distributed on the second plane.
[0195] FIG14 is an example of occupied sub-nodes of neighbor nodes in the x-direction provided by an embodiment of the present application.
[0196] As shown in Figure 14, the decoder determines the first index of the current node based on the occupied sub-nodes of at least one decoded neighbor node of the current node on the plane perpendicular to the x-direction, wherein the at least one decoded neighbor node of the current node on the plane perpendicular to the x-direction includes neighbor node 1 and neighbor node 2, the occupied sub-nodes of neighbor node 1 include occupied sub-node 1, and the occupied sub-nodes of neighbor node 2 include occupied sub-node 2 and occupied sub-node 3. Since occupied sub-node 1, occupied sub-node 2 and occupied sub-node 3 are all distributed on the plane of x=0, the decoder can predict that the first index of the current node is the second value. For example, the decoder can determine that the first index of the current node is 0.
[0197] FIG15 is a schematic flow chart of an index determination method 400 provided in an embodiment of the present application. It should be understood that the index determination method 400 can be executed by a decoder. For example, it can be applied to the decoding framework 200 shown in FIG12 . For ease of description, the following description uses a decoder as an example.
[0198] S411, start.
[0199] S412: Does the decoder determine whether any of the two decoded neighbor nodes of the current node on the plane perpendicular to the k-th axis is non-empty?
[0200] S413, if any one of the two decoded neighbor nodes of the current node on the plane perpendicular to the k-th axis is non-empty, the decoder determines whether the occupied child nodes of the two neighbor nodes are both distributed on the first plane perpendicular to the k-th axis?
[0201] S414: If the occupied sub-nodes of the two neighboring nodes are not all distributed on the first plane, the decoder determines whether the occupied sub-nodes of the two neighboring nodes are all distributed on a second plane perpendicular to the k-th axis?
[0202] S415: If the occupied child nodes of the two neighboring nodes are not all distributed on the second plane, the decoder determines that the first index of the current node is -1.
[0203] S416: If the occupied child nodes of the two neighboring nodes are both distributed on the second plane, the decoder determines that the first index of the current node is 0.
[0204] S417: If the occupied child nodes of the two neighboring nodes are both distributed on the first plane, the decoder determines that the first index of the current node is 1.
[0205] S418: The decoder determines that the second index of the current node is 0.
[0206] S419, if the two decoded neighboring nodes of the current node on the plane perpendicular to the k-th axis are both empty, the decoder determines whether the plane information of the last decoded node on the plane perpendicular to the k-th axis is 1?
[0207] S420 : If the plane information of the last decoded node on the plane perpendicular to the k-th axis is not 1, the decoder determines that the third index of the current node is 0.
[0208] S421 : If the plane information of the last decoded node on the plane perpendicular to the k-th axis is 1, the decoder determines that the third index of the current node is 1.
[0209] S422: The decoder obtains the number n of octree levels for which planar mode is enabled.
[0210] S423, the decoder determines that the Manhattan distance between the last decoded node and the current node is greater than 2 to the power of n?
[0211] S424 , if the Manhattan distance between the last decoded node and the current node is less than or equal to 2 to the power of n, the decoder determines that the fourth index of the current node is 0.
[0212] S425 , if the Manhattan distance between the last decoded node and the current node is greater than 2 to the power of n, the decoder determines that the fourth index of the current node is 1.
[0213] S426, end.
[0214] It should be understood that FIG15 is merely an example of the present application and should not be construed as a limitation to the present application.
[0215] For example, in other alternative embodiments, the decoder may first determine whether the occupied sub-nodes of the two neighboring nodes are all distributed on the second plane. If the occupied sub-nodes of the two neighboring nodes are not all distributed on the second plane, then determine whether the occupied sub-nodes of the two neighboring nodes are all distributed on the first plane; or, the decoder may also simultaneously determine whether the occupied sub-nodes of the two neighboring nodes are all distributed on the second plane or the first plane. This application does not make specific limitations on this.
[0216] In some embodiments, the method 300 may further include:
[0217] The decoder decodes the current node based on the first index.
[0218] Exemplarily, the decoder may determine the context index of the current node based on the first index, and perform decoding based on the context index of the current node.
[0219] Exemplarily, the decoder may determine the context index of the current node based on the first index and the second index mentioned above.
[0220] Exemplarily, the decoder may also determine the context index of the current node based on the third index mentioned above.
[0221] Exemplarily, the decoder may determine the context index of the current node based on the third index and the fourth index mentioned above.
[0222] Exemplarily, after the decoder determines one or more of the index of the current node on the S axis, the index of the current node on the T axis, and the index of the current node on the V axis, it can determine the context index of the current node based on one or more of the index of the current node on the S axis, the index of the current node on the T axis, and the index of the current node on the V axis, and decode the current node based on the context index of the current node.
[0223] Exemplarily, after the decoder determines the context index of the current node, it can determine the arithmetic decoder used to arithmetically decode the current node based on the context index of the current node; and arithmetically decode the current node based on the determined arithmetic decoder to obtain the geometric information of the current node.
[0224] It is worth noting that in an embodiment of the present application, the first index, the second index, the third index and the fourth index can all be intermediate indexes or intermediate variables used to determine the context index of the current node.
[0225] For example, in other alternative embodiments, the first index and the third index may be referred to as a type of index, or the first index and the third index may be combined into one index, such as a plane index. Exemplarily, if the at least one neighbor node is non-empty, the plane index is determined based on an occupied child node of the at least one neighbor node; if the at least one neighbor node is empty, the plane index is determined based on plane information of a previously decoded node of the current node on a plane perpendicular to the k-th axis.
[0226] For example, in other alternative embodiments, the second index and the fourth index can be referred to as a type of index, or the second index and the fourth index can also be combined into one index, for example, which can be referred to as a distance index. Exemplarily, if the at least one neighbor node is non-empty or the decoder determines the first index mentioned above based on the occupied child nodes of the at least one neighbor node, the decoder determines the distance index as a preset value (for example, 0); if the at least one neighbor node is empty or the decoder determines the third index mentioned above based on the plane information of the previous decoded node of the current node on the plane perpendicular to the k-th axis, the decoder determines this distance index based on the distance between the previous decoded node and the current node.
[0227] That is to say, the terms the first index, the second index, the third index and the fourth index are only used to distinguish indexes from each other, and do not limit the number, type, etc. of indexes, that is, they do not limit the scope of the embodiments of the present application.
[0228] The following is an illustrative description of the data processing flow related to the standard text and the variables used in the spec, combined with the solution provided by this application:
[0229] The context index for the occ_plane_pos[k] flag is determined using the information of the occupied child nodes of the previous decoded node or neighbor node that is eligible for plane coding mode in the plane perpendicular to the k-th axis, including:
[0230] The Manhattan distance between the current node and the node;
[0231] The values of occ_single_plane and occ_plane pos.
[0232] The plane perpendicular to the k-th axis of the coding node is formed by its axis modulus 2 14 location identifier.
[0233] PlanarNodeAxisLoc[k] represents the plane of the current node perpendicular to the k-th axis, which is obtained based on the position coordinates of the current node in the octree at the current level.
[0234] ManhattanDist[k] represents the Manhattan distance of the current node from the coordinate origin on the plane perpendicular to the k-th axis, which is obtained by adding the coordinate values on the plane perpendicular to the k-th axis:
[0235] ManhattanDist[k]:=
[0236] k==0? Nt+Nv:
[0237] k==1? Ns+Nv:
[0238] k==2? Ns+Nt:na
[0239] The information of the previous decoded node that is eligible for plane coding mode is stored in the following variables, k and axisLoc, which can determine the location of the plane perpendicular to the k-th axis:
[0240] Array PrevManhattanDist; PrevManhattanDist[k][axisLoc] represents the Manhattan distance of the previous decoded node that is eligible for planar coding mode from the coordinate origin on the plane perpendicular to the k-th axis;
[0241] Array PrevOccSinglePlane; PrevOccSinglePlane[k][axisLoc] indicates whether the previous coded node that is eligible for plane coding mode meets the plane coding mode;
[0242] The array PrevOccPlanePos; PrevOccPlanePos[k][axisLoc] represents the plane position of the previous decoded node that is eligible for plane coding mode.
[0243] After each occupancy_tree_node syntax structure, the state shall be updated for each planar-eligible axis:
[0244] for(k=0;k<3;k++)
[0245] if(PlanarEligible[k]){
[0246] PrevManhattanDist[k][PlanarNodeAxisLoc[k]]=ManhattanDist[k]
[0247] PrevOccSinglePlane[k][PlanarNodeAxisLoc[k]]=occ_single_plane[k]
[0248] if(occ_single_plane[k])
[0249] PrevOccPlanePos[k][PlanarNodeAxisLoc[k]]=occ_plane_pos[k]
[0250] }
[0251] That is, after the current node enters the plane coding mode, for each k-axis, the above three variables must be updated separately based on the information of the current node.
[0252] The contextualization of occ_plane_pos[k] for nodes that do not meet the angular contextualization conditions (AngularEligible is 0) is specified by the expression CtxIdxPlanePos:
[0253] Contextualization of occ_plane_pos[k]for nodes not eligible for angular contextualization(AngularEligible is 0)is specified by the expression CtxIdxPlanePos.
[0254] CtxIdxPlanePos:=isNeighOccupied&&occtree_adjacent_child_enabled
[0255] ? (neighPlanePosCtxInc<0?adjPlaneCtxInc:12×k+4×adjPlaneCtxInc+2×neighDistCtxInc+neighPlanePosCtxInc+3)
[0256] :(occtree_planar_buffer_disabled|| PrevOccSinglePlane[k][PlanarNodeAxisLoc[k]]
[0257] ?adjPlaneCtxInc
[0258] :12×k+4×adjPlaneCtxInc+2×prevDistCtxInc+prevPlanePosCtxInc+3)
[0259] The context index of the plane coding mode flag occ_plane_pos[k] is determined as follows:
[0260] When at least one neighbor node is non-empty (isNeighOccupied is true) and the neighbor node child node information is accessible (occtree_adjacent_child_enabled is true), the context index of occ_plane_pos[k] is determined by the first index neighPlanePosCtxInc and the second index neighDistCtxInc; otherwise, the context index of occ_plane_pos[k] is determined by the third index prevPlanePosCtxInc and the fourth index prevDistCtxInc.
[0261] The value of neighDistCtxInc (the second index) is 0;
[0262] prevDistCtxInc (the fourth index) is determined by the Manhattan distance between the previous decoded node and the current node.
[0263] prevDistCtxInc:=Abs(ab)>2numEiigiblePlanarLeveis
[0264] where
[0265] a=PrevManhattanDist[k][PlanarNodeAxisLoc[k]]
[0266] b=ManhattanDist[k]
[0267] numEligiblePlanarLevels is distinguished by the number of levels for which planar mode is enabled.
[0268] If the Manhattan distance between them is greater than 2 times the power of the octree depth with planar coding mode enabled, the value is 1, otherwise it is 0.
[0269] neighPlanePosCtxInc (first index) is determined by occupying child nodes of at least one neighbor node.
[0270] prevPlanePosCtxInc (third index) is the occupied plane position (first plane, second plane) of the previous coded node that qualified for plane coding mode.
[0271] The index determination method according to the embodiment of the present application is described in detail above from the perspective of the decoder. The index determination method according to the embodiment of the present application will be described below from the perspective of the encoder in conjunction with Figure 16.
[0272] FIG16 is a schematic flow chart of an index determination method 500 provided in an embodiment of the present application. It should be understood that the index determination method 500 can be executed by an encoder. For example, it can be applied to the encoding framework 100 shown in FIG4 . For ease of description, the following description uses an encoder as an example.
[0273] As shown in FIG16 , the index determination method 500 may include:
[0274] S510 : Determine a first index of the current node based on occupied child nodes of at least one encoded neighbor node of the current node on a plane perpendicular to the k-th axis.
[0275] In some embodiments, the S510 may include:
[0276] If the at least one neighbor node is not empty, the first index is determined based on an occupied child node of the at least one neighbor node.
[0277] In some embodiments, if the occupied sub-nodes of at least one neighbor node are all distributed on a first plane perpendicular to the k-th axis, the first index is determined to be a first value; if the occupied sub-nodes of at least one neighbor node are all distributed on a second plane perpendicular to the k-th axis, the first index is determined to be a second value; otherwise, the first index is determined to be a third value.
[0278] In some embodiments, the method 500 may further include:
[0279] A second index of the current node is determined based on a distance between the at least one neighbor node and the current node.
[0280] In some embodiments, the second index is determined to be a fourth value.
[0281] In some embodiments, when the fourth value is 0, it indicates that: the distance between the at least one neighboring node and the current node is less than or equal to a preset threshold, or the at least one neighboring node is within a preset area of the current node.
[0282] In some embodiments, the distance between the at least one neighbor node and the current node is a Manhattan distance.
[0283] In some embodiments, the method 500 may further include:
[0284] If the at least one neighbor node is empty, a third index is determined based on plane information of a previous encoded node of the current node on a plane perpendicular to the k-th axis.
[0285] In some embodiments, if the plane information is 1, the third index is determined to be a first value; if the plane information is not 1, the third index is determined to be a second value.
[0286] In some embodiments, the method 500 may further include:
[0287] A fourth index of the current node is determined based on a distance between the previous encoded node and the current node.
[0288] In some embodiments, a depth level n of an octree in which planar mode is enabled is obtained; and based on n, the fourth index is determined.
[0289] In some embodiments, if the distance between the previous encoded node and the current node is less than or equal to 2 n , then determine that the fourth index is the fifth value; if the distance between the previous encoded node and the current node is greater than 2 n , then the fourth index is determined to be the sixth value.
[0290] In some embodiments, the distance between the previous encoded node and the current node is Manhattan distance.
[0291] In some embodiments, the first value is 1, the second value is 0, and the third value is -1.
[0292] In some embodiments, the value of k is 0, 1, or 2.
[0293] In some embodiments, the method 300 may further include:
[0294] The current node is encoded based on the first index of the current node.
[0295] It should be understood that the technical solution provided in this application can be applied to both the encoding and decoding ends, that is, it can maintain synchronization and consistency between the two ends; that is, the detailed solution of the index determination method 500 can be found in the relevant content of the index determination method 300. To avoid repetition, it will not be repeated here.
[0296] The preferred embodiments of the present application are described in detail above in conjunction with the accompanying drawings. However, the present application is not limited to the specific details in the above embodiments. Within the technical concept of the present application, the technical solution of the present application can be subjected to a variety of simple modifications, and these simple modifications all fall within the scope of protection of the present application. For example, the various specific technical features described in the above specific embodiments can be combined in any suitable manner without contradiction. In order to avoid unnecessary repetition, the present application will no longer describe the various possible combinations separately. For another example, the various different embodiments of the present application can also be arbitrarily combined, as long as they do not violate the idea of the present application, they should also be regarded as the contents disclosed in the present application. It should also be understood that in the various method 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.
[0297] The method embodiment of the present application is described in detail above. The device embodiment of the present application is described in detail below in conjunction with Figures 17 to 18.
[0298] FIG17 is a schematic block diagram of an index determination device 600 according to an embodiment of the present application.
[0299] As shown in FIG17 , the index determination device 600 may include:
[0300] The determining unit 610 is configured to determine a first index of the current node based on an occupied child node of at least one decoded neighbor node of the current node on a plane perpendicular to the k-th axis.
[0301] In some embodiments, the determining unit 610 is specifically configured to:
[0302] If the at least one neighbor node is not empty, the first index is determined based on an occupied child node of the at least one neighbor node.
[0303] In some embodiments, the determining unit 610 is specifically configured to:
[0304] If the occupied child nodes of the at least one neighbor node are all distributed on a first plane perpendicular to the k-th axis, determining the first index to be a first value;
[0305] If the occupied sub-nodes of the at least one neighbor node are all distributed on a second plane perpendicular to the k-th axis, determining the first index to be a second value;
[0306] Otherwise, the first index is determined to be a third value.
[0307] In some embodiments, the determining unit 610 is further configured to:
[0308] A second index of the current node is determined based on a distance between the at least one neighbor node and the current node.
[0309] In some embodiments, the determining unit 610 is specifically configured to:
[0310] The second index is determined to be a fourth value.
[0311] In some embodiments, when the fourth value is 0, it indicates that: the distance between the at least one neighboring node and the current node is less than or equal to a preset threshold, or the at least one neighboring node is within a preset area of the current node.
[0312] In some embodiments, the distance between the at least one neighbor node and the current node is a Manhattan distance.
[0313] In some embodiments, the determining unit 610 is further configured to:
[0314] If the at least one neighbor node is empty, a third index is determined based on plane information of a previous decoded node of the current node on a plane perpendicular to the k-th axis.
[0315] In some embodiments, the determining unit 610 is specifically configured to:
[0316] If the plane information is 1, determining that the third index is the first value;
[0317] If the plane information is not 1, the third index is determined to be a second value.
[0318] In some embodiments, the determining unit 610 is further configured to:
[0319] A fourth index of the current node is determined based on a distance between the previous decoded node and the current node.
[0320] In some embodiments, the determining unit 610 is specifically configured to:
[0321] Get the depth level n of the octree with planar mode enabled;
[0322] Based on the n, the fourth index is determined.
[0323] In some embodiments, the determining unit 610 is specifically configured to:
[0324] If the distance between the previous decoded node and the current node is less than or equal to 2 n , then determining the fourth index to be the fifth value;
[0325] If the distance between the previous decoded node and the current node is greater than 2 n , then the fourth index is determined to be the sixth value.
[0326] In some embodiments, the distance between the previous decoded node and the current node is Manhattan distance.
[0327] In some embodiments, the first value is 1, the second value is 0, and the third value is -1.
[0328] In some embodiments, the value of k is 0, 1, or 2.
[0329] In some embodiments, the determining unit 610 is further configured to:
[0330] The current node is decoded based on the first index of the current node.
[0331] FIG18 is a schematic block diagram of an index determination device 700 according to an embodiment of the present application.
[0332] As shown in FIG18 , the index determination device 700 may include:
[0333] The determining unit 710 is configured to determine a first index of the current node based on an occupied subnode of at least one encoded neighboring node of the current node on a plane perpendicular to the k-th axis.
[0334] In some embodiments, the determining unit 710 is specifically configured to:
[0335] If the at least one neighbor node is not empty, the first index is determined based on an occupied child node of the at least one neighbor node.
[0336] In some embodiments, the determining unit 710 is specifically configured to:
[0337] If the occupied child nodes of the at least one neighbor node are all distributed on a first plane perpendicular to the k-th axis, determining the first index to be a first value;
[0338] If the occupied sub-nodes of the at least one neighbor node are all distributed on a second plane perpendicular to the k-th axis, determining the first index to be a second value;
[0339] Otherwise, the first index is determined to be a third value.
[0340] In some embodiments, the determining unit 710 is further configured to:
[0341] A second index of the current node is determined based on a distance between the at least one neighbor node and the current node.
[0342] In some embodiments, the determining unit 710 is specifically configured to:
[0343] The second index is determined to be a fourth value.
[0344] In some embodiments, when the fourth value is 0, it indicates that: the distance between the at least one neighboring node and the current node is less than or equal to a preset threshold, or the at least one neighboring node is within a preset area of the current node.
[0345] In some embodiments, the distance between the at least one neighbor node and the current node is a Manhattan distance.
[0346] In some embodiments, the determining unit 710 is further configured to:
[0347] If the at least one neighbor node is empty, a third index is determined based on plane information of a previous encoded node of the current node on a plane perpendicular to the k-th axis.
[0348] In some embodiments, the determining unit 710 is specifically configured to:
[0349] If the plane information is 1, determining that the third index is the first value;
[0350] If the plane information is not 1, the third index is determined to be a second value.
[0351] In some embodiments, the determining unit 710 is further configured to:
[0352] A fourth index of the current node is determined based on a distance between the previous encoded node and the current node.
[0353] In some embodiments, the determining unit 710 is specifically configured to:
[0354] Get the depth level n of the octree with planar mode enabled;
[0355] Based on the n, the fourth index is determined.
[0356] In some embodiments, the determining unit 710 is specifically configured to:
[0357] If the distance between the previous encoded node and the current node is less than or equal to 2 n , then determining the fourth index to be the fifth value;
[0358] If the distance between the previous encoded node and the current node is greater than 2 n , then the fourth index is determined to be the sixth value.
[0359] In some embodiments, the distance between the previous encoded node and the current node is Manhattan distance.
[0360] In some embodiments, the first value is 1, the second value is 0, and the third value is -1.
[0361] In some embodiments, the value of k is 0, 1, or 2.
[0362] In some embodiments, the determining unit 710 is further configured to:
[0363] The current node is encoded based on the first index of the current node.
[0364] It should be understood that the device embodiment and the method embodiment may correspond to each other, and similar descriptions may refer to the method embodiment. To avoid repetition, they will not be described here. Specifically, the index determination device 600 shown in Figure 17 may correspond to the corresponding subject in the method 300 for executing the embodiment of the present application, and the aforementioned and other operations and / or functions of the various units in the index determination device 600 are respectively for implementing the corresponding processes in various methods such as method 300. The index determination device 700 shown in Figure 18 may correspond to the corresponding subject in the method 500 for executing the embodiment of the present application, that is, the aforementioned and other operations and / or functions of the various units in the index determination device 700 are respectively for implementing the corresponding processes in various methods such as method 500.
[0365] It should also be understood that the various units in the index determination device 600 or index determination device 700 involved in the embodiments of the present application can be separately or all combined into one or several other units to constitute, or one (some) of the units can also be split into multiple smaller functional units to constitute, which can achieve the same operation without affecting the realization of the technical effects of the embodiments of the present application. The above-mentioned units are divided based on logical functions. In actual applications, the functions of one unit can also be implemented by multiple units, or the functions of multiple units can be implemented by one unit. In other embodiments of the present application, the index determination device 600 or index determination device 700 may also include other units. In actual applications, these functions can also be implemented with the assistance of other units, and can be implemented by the collaboration of multiple units. According to another embodiment of the present application, the index determination device 600 or index determination device 700 involved in the embodiment of the present application can be constructed by running a computer program (including program code) capable of executing each step involved in the corresponding method on a general computing device of a general-purpose computer including processing elements and storage elements such as a central processing unit (CPU), a random access storage medium (RAM), and a read-only storage medium (ROM). The encoding method or decoding method of the embodiment of the present application can be implemented. The computer program can be recorded on, for example, a computer-readable storage medium, and loaded into an electronic device through a computer-readable storage medium, and run therein to implement the corresponding method of the embodiment of the present application.
[0366] In other words, the units mentioned above can be implemented in the form of hardware, can be implemented by instructions in the form of software, or can be implemented in the form of a combination of hardware and software. Specifically, the steps of the method embodiments in the embodiments of the present application can be completed by the hardware integrated logic circuit and / or software instructions in the processor, and the steps of the method disclosed in the embodiments of the present application can be directly embodied as being executed by a hardware decoding processor, or being executed by a combination of hardware and software in a decoding processor. Optionally, the software can be located in a mature storage medium in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an electrically erasable programmable memory, a register, etc. The storage medium is located in a memory, and the processor reads the information in the memory and completes the steps in the above method embodiments in combination with its hardware.
[0367] FIG19 is a schematic structural diagram of an electronic device 800 provided in an embodiment of the present application.
[0368] As shown in Figure 19, the electronic device 800 includes at least a processor 810 and a computer-readable storage medium 820. The processor 810 and the computer-readable storage medium 820 may be connected via a bus or other means. The computer-readable storage medium 820 is used to store a computer program 821, which includes computer instructions. The processor 810 is used to execute the computer instructions stored in the computer-readable storage medium 820. The processor 810 is the computing core and control core of the electronic device 800. It is suitable for implementing one or more computer instructions, and is specifically suitable for loading and executing one or more computer instructions to implement the corresponding method flow or corresponding function.
[0369] As an example, the processor 810 may also be referred to as a central processing unit (CPU). The processor 810 may include, but is not limited to, a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like.
[0370] As an example, the computer-readable storage medium 820 may be a high-speed RAM memory, or a non-volatile memory (Non-Volatile Memory), such as at least one disk memory; optionally, it may also be at least one computer-readable storage medium located away from the aforementioned processor 810. Specifically, the computer-readable storage medium 820 includes, but is not limited to: volatile memory and / or non-volatile memory. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link DRAM (SLDRAM), and direct RAM bus random access memory (DR RAM).
[0371] In one implementation, the electronic device 800 may be an encoder or encoding framework involved in an embodiment of the present application; a first computer instruction is stored in the computer-readable storage medium 820; the processor 810 loads and executes the first computer instruction stored in the computer-readable storage medium 820 to implement the corresponding steps in the encoding method provided in an embodiment of the present application; in other words, the first computer instruction in the computer-readable storage medium 820 is loaded by the processor 810 and the corresponding steps are executed. To avoid repetition, they are not repeated here.
[0372] In one implementation, the electronic device 800 may be a decoder or decoding framework involved in an embodiment of the present application; a second computer instruction is stored in the computer-readable storage medium 820; the processor 810 loads and executes the second computer instruction stored in the computer-readable storage medium 820 to implement the corresponding steps in the decoding method provided in an embodiment of the present application; in other words, the second computer instruction in the computer-readable storage medium 820 is loaded by the processor 810 and the corresponding steps are executed, which will not be repeated here to avoid repetition.
[0373] According to another aspect of the present application, an embodiment of the present application further provides a coding and decoding system, including the encoder and decoder mentioned above.
[0374] According to another aspect of the present application, an embodiment of the present application further provides a computer-readable storage medium (Memory), which is a memory device in the electronic device 800 for storing programs and data. For example, a computer-readable storage medium 820. It can be understood that the computer-readable storage medium 820 here can include both the built-in storage medium in the electronic device 800 and, of course, the extended storage medium supported by the electronic device 800. The computer-readable storage medium provides a storage space, which stores the operating system of the electronic device 800. In addition, one or more computer instructions suitable for being loaded and executed by the processor 810 are also stored in the storage space. These computer instructions can be one or more computer programs 821 (including program codes).
[0375] According to another aspect of the present application, a computer program product or computer program is provided. The computer program product or computer program includes computer instructions stored in a computer-readable storage medium. For example, computer program 821 is provided. In this case, data processing device 800 may be a computer, and processor 810 reads the computer instructions from computer-readable storage medium 820. Processor 810 executes the computer instructions, causing the computer to perform the encoding method or decoding method provided in the various optional embodiments described above.
[0376] In other words, when implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process of the embodiment of the present application is run in whole or in part or the functions of the embodiment of the present application are implemented. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from a website, computer, server, or data center to another website, computer, server, or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode.
[0377] Those skilled in the art will appreciate that the units and process steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.
[0378] Finally, it should be noted that the above content is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.
Claims
1. A method for determining an index, characterized in that: The method is applicable to a decoder, and comprises: A first index of the current node is determined based on occupied child nodes of at least one decoded neighbor node of the current node on a plane perpendicular to the k-th axis.
2. The method according to claim 1, characterized in that The determining the first index of the current node based on an occupied child node of at least one decoded neighbor node of the current node on a plane perpendicular to the k-th axis includes: If the at least one neighbor node is not empty, the first index is determined based on an occupied child node of the at least one neighbor node.
3. The method according to claim 2, characterized in that The determining the first index based on an occupied child node of the at least one neighboring node includes: If the occupied child nodes of the at least one neighbor node are all distributed on a first plane perpendicular to the k-th axis, determining the first index to be a first value; If the occupied sub-nodes of the at least one neighbor node are all distributed on a second plane perpendicular to the k-th axis, determining the first index to be a second value; Otherwise, the first index is determined to be a third value.
4. The method according to claim 2 or 3, characterized in that The method further comprises: A second index of the current node is determined based on a distance between the at least one neighbor node and the current node.
5. The method according to claim 4, characterized in that The determining, based on the distance between the at least one neighboring node and the current node, a second index of the current node, includes: The second index is determined to be a fourth value.
6. The method according to claim 5, characterized in that When the fourth value is 0, it indicates that the distance between the at least one neighboring node and the current node is less than or equal to a preset threshold, or the at least one neighboring node is within a preset area of the current node.
7. The method according to any one of claims 4 to 6, characterized in that The distance between the at least one neighbor node and the current node is the Manhattan distance.
8. The method according to any one of claims 1 to 7, characterized in that The method further comprises: If the at least one neighbor node is empty, a third index is determined based on plane information of a previous decoded node of the current node on a plane perpendicular to the k-th axis.
9. The method according to claim 8, characterized in that The determining the third index based on plane information of a previous decoded node of the current node on a plane perpendicular to the k-th axis includes: If the plane information is 1, determining that the third index is the first value; If the plane information is not 1, the third index is determined to be a second value.
10. The method according to claim 8 or 9, characterized in that The method further comprises: A fourth index of the current node is determined based on a distance between the previous decoded node and the current node.
11. The method according to claim 10, characterized in that The determining, based on the distance between the previous decoded node and the current node, a fourth index of the current node, comprises: Get the depth level n of the octree with planar mode enabled; Based on the n, the fourth index is determined.
12. The method according to claim 11, characterized in that The determining the fourth index based on the n includes: If the distance between the previous decoded node and the current node is less than or equal to 2 n , then determining the fourth index to be the fifth value; If the distance between the previous decoded node and the current node is greater than 2 n , then the fourth index is determined to be the sixth value.
13. The method according to any one of claims 10 to 12, characterized in that The distance between the previous decoded node and the current node is the Manhattan distance.
14. The method according to claim 3 or 9, characterized in that The first value is 1, the second value is 0, and the third value is -1.
15. The method according to any one of claims 1 to 14, characterized in that The value of k is 0, 1, or 2.
16. The method according to any one of claims 1 to 15, characterized in that The method further comprises: The current node is decoded based on the first index of the current node.
17. A method for determining an index, characterized in that: The method is applicable to an encoder, and the method comprises: A first index of the current node is determined based on occupied child nodes of at least one encoded neighbor node of the current node on a plane perpendicular to the k-th axis.
18. The method according to claim 17, characterized in that The determining the first index of the current node based on occupied child nodes of at least one encoded neighbor node of the current node on a plane perpendicular to the k-th axis includes: If the at least one neighbor node is not empty, the first index is determined based on an occupied child node of the at least one neighbor node.
19. The method according to claim 18, characterized in that The determining the first index based on an occupied child node of the at least one neighboring node includes: If the occupied child nodes of the at least one neighbor node are all distributed on a first plane perpendicular to the k-th axis, determining the first index to be a first value; If the occupied sub-nodes of the at least one neighbor node are all distributed on a second plane perpendicular to the k-th axis, determining the first index to be a second value; Otherwise, the first index is determined to be a third value.
20. The method according to claim 18 or 19, characterized in that The method further comprises: A second index of the current node is determined based on a distance between the at least one neighbor node and the current node.
21. The method according to claim 20, characterized in that The determining, based on the distance between the at least one neighboring node and the current node, a second index of the current node includes: The second index is determined to be a fourth value.
22. The method according to claim 21, characterized in that When the fourth value is 0, it indicates that the distance between the at least one neighboring node and the current node is less than or equal to a preset threshold, or the at least one neighboring node is within a preset area of the current node.
23. The method according to any one of claims 20 to 22, characterized in that The distance between the at least one neighbor node and the current node is the Manhattan distance.
24. The method according to any one of claims 17 to 23, characterized in that The method further comprises: If the at least one neighbor node is empty, a third index is determined based on plane information of a previous encoded node of the current node on a plane perpendicular to the k-th axis.
25. The method according to claim 24, characterized in that The determining the third index based on plane information of a previous encoded node of the current node on a plane perpendicular to the k-th axis includes: If the plane information is 1, determining that the third index is the first value; If the plane information is not 1, the third index is determined to be a second value.
26. The method according to claim 24 or 25, characterized in that The method further comprises: A fourth index of the current node is determined based on a distance between the previous encoded node and the current node.
27. The method according to claim 26, characterized in that The determining, based on the distance between the previous encoded node and the current node, a fourth index of the current node, comprises: Get the depth level n of the octree with planar mode enabled; Based on the n, the fourth index is determined.
28. The method according to claim 27, characterized in that The determining the fourth index based on the n includes: If the distance between the previous encoded node and the current node is less than or equal to 2 n , then determining the fourth index to be the fifth value; If the distance between the previous encoded node and the current node is greater than 2 n , then the fourth index is determined to be the sixth value.
29. The method according to any one of claims 26 to 28, characterized in that The distance between the previous encoded node and the current node is the Manhattan distance.
30. The method according to claim 19 or 25, characterized in that The first value is 1, the second value is 0, and the third value is -1.
31. The method according to any one of claims 17 to 30, characterized in that The value of k is 0, 1, or 2.
32. The method according to any one of claims 17 to 31, characterized in that The method further comprises: The current node is encoded based on the first index of the current node.
33. An index determination device, characterized in that: include: A determining unit is configured to determine a first index of the current node based on an occupied subnode of at least one decoded neighbor node of the current node on a plane perpendicular to the k-th axis.
34. An index determination device, characterized in that: include: A determining unit is configured to determine a first index of the current node based on an occupied subnode of at least one encoded neighboring node of the current node on a plane perpendicular to the k-th axis.
35. A decoder, characterized in that include: a processor adapted to execute a computer program; A computer-readable storage medium having a computer program stored therein, wherein the computer program, when executed by the processor, implements the method according to any one of claims 1 to 16.
36. An encoder, characterized in that include: a processor adapted to execute a computer program; A computer-readable storage medium having a computer program stored therein, wherein the computer program, when executed by the processor, implements the method according to any one of claims 17 to 32.
37. A computer-readable storage medium, characterized in that Used to store a computer program, the computer program causing a computer to execute the method according to any one of claims 1 to 16 or the method according to any one of claims 17 to 32.
38. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instructions are executed by a processor, the method according to any one of claims 1 to 16 or the method according to any one of claims 17 to 32 is implemented.
39. A code stream, characterized in that The code stream is a code stream decoded by the method according to any one of claims 1 to 16 or a code stream generated by the method according to any one of claims 17 to 32.
Citation Information
Cited By
Encoding method and apparatus, decoding method and apparatus, and device
WO2026200601A1
