Attribute coding method, attribute decoding method and electronic equipment

By determining multiple target neighbor points based on geometric distance and attribute distance in point cloud encoding for attribute prediction, the problem of information redundancy in point cloud encoding is solved, and more efficient coding is achieved.

CN119316597AActive Publication Date: 2025-01-14VIVO MOBILE COMM CO LTD

Patent Information

Application Number
CN202310853890.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-07-12
Publication Date
2025-01-14
Estimated Expiration
2043-07-12

AI Technical Summary

Technical Problem

During point cloud encoding, the spatial distance between the to-be-encoded point and its nearest neighbor point is close but the attribute values ​​are different, resulting in information redundancy in the coded code stream.

Method used

Based on the geometric distance and attribute distance between the points to be encoded and multiple candidate neighbor points, K first target neighbor points are determined, and attribute prediction is made for the points to be encoded according to the attribute values ​​of these neighbor points, and coded code stream is generated to reduce information. redundancy.

Benefits of technology

The code rate of the code stream is reduced, information redundancy is reduced, and encoding efficiency is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119316597A_ABST
    Figure CN119316597A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides an attribute coding method, an attribute decoding method and electronic equipment, and belongs to the technical field of coding and decoding. The attribute coding method comprises the following steps: a coding end determines K first target neighbor points in a plurality of candidate neighbor points based on a geometric distance and an attribute distance between a to-be-coded point and each candidate neighbor point in the plurality of candidate neighbor points; the candidate neighbor points are at least part of coded points in the plurality of coded points, the attribute distance is determined based on the attribute information of the to-be-coded point and the attribute information of the candidate neighbor points, and K is a positive integer greater than or equal to 1; the coding end performs attribute prediction on the to-be-coded point according to the attribute value of each first target neighbor point to obtain an attribute prediction value of the to-be-coded point; the encoding end encodes the attribute residual error of the to-be-encoded point to generate an encoding code stream corresponding to the to-be-encoded point; the attribute residual error of the to-be-coded point is determined based on the attribute prediction value of the to-be-coded point and the original attribute value of the to-be-coded point.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of coding and decoding technology, and specifically relates to an attribute coding method, an attribute decoding method and an electronic device. Background Art

[0002] Point cloud is a set of irregularly distributed discrete points in space that express the spatial structure and surface attributes of a three-dimensional object or scene. In the process of encoding point cloud, attribute information encoding is involved. At present, the nearest neighbor point corresponding to the point to be encoded is determined based on the geometric information of the encoded point, and then the attribute value of the nearest neighbor point is weightedly predicted to obtain the attribute prediction value of the point to be encoded.

[0003] However, in the point cloud, there may be a situation where the spatial distance between the point to be encoded and the adjacent predicted point is close, but the attribute value is quite different. If the nearest neighbor point is determined based on the geometric information of the encoded point, and the attribute encoding of the point to be encoded is performed based on the attribute value of the nearest neighbor point, it is easy to obtain a coded bitstream with redundant information. Summary of the invention

[0004] The embodiments of the present application provide an attribute encoding method, an attribute decoding method and an electronic device, which can solve the technical problem of information redundancy in the encoded code stream.

[0005] In a first aspect, an attribute encoding method is provided, comprising:

[0006] The encoder determines, based on the geometric distance and attribute distance between the point to be encoded and each of the candidate neighbor points in the plurality of candidate neighbor points, K first target neighbor points among the plurality of candidate neighbor points; the candidate neighbor points are at least some of the encoded points among the plurality of encoded points, the attribute distance is determined based on the attribute information of the point to be encoded and the attribute information of the candidate neighbor points, and K is a positive integer greater than or equal to 1;

[0007] The encoder predicts the attribute of the point to be encoded according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the point to be encoded;

[0008] The encoding end encodes the attribute residual of the point to be encoded to generate an encoding code stream corresponding to the point to be encoded; the attribute residual of the point to be encoded is determined based on the attribute prediction value of the point to be encoded and the original attribute value of the point to be encoded.

[0009] In a second aspect, a method for decoding an attribute is provided, comprising:

[0010] The decoding end parses the obtained coded bitstream to obtain a point to be decoded and multiple decoded points;

[0011] The decoding end determines K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point among the multiple candidate neighbor points; the candidate neighbor points are at least some of the decoded points among the multiple decoded points, the attribute distance is determined based on the attribute information of the point to be decoded and the attribute information of the candidate neighbor points, and K is a positive integer greater than or equal to 1;

[0012] The decoding end predicts the attribute of the to-be-decoded point according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the to-be-decoded point;

[0013] The decoding end determines the attribute reconstruction value of the point to be decoded according to the attribute prediction value of the point to be decoded and the attribute residual of the point to be decoded; the attribute residual of the point to be decoded is obtained based on parsing the encoded bitstream.

[0014] In a third aspect, an attribute encoding device is provided, including:

[0015] A first determination module is used to determine K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point among the multiple candidate neighbor points; the candidate neighbor points are at least part of the encoded points among the multiple encoded points, the attribute distance is determined based on the attribute information of the point to be encoded and the attribute information of the candidate neighbor points, and K is a positive integer greater than or equal to 1;

[0016] A prediction module, used to perform attribute prediction on the to-be-coded point according to the attribute value of each first target neighbor point, to obtain the attribute prediction value of the to-be-coded point;

[0017] A generating module is used to encode the attribute residual of the point to be encoded to generate an encoding code stream corresponding to the point to be encoded; the attribute residual of the point to be encoded is determined based on the attribute prediction value of the point to be encoded and the original attribute value of the point to be encoded.

[0018] In a fourth aspect, an attribute decoding device is provided, comprising:

[0019] A parsing module is used to parse the acquired coded bitstream to obtain a point to be decoded and multiple decoded points;

[0020] A first determination module is used to determine K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point among the multiple candidate neighbor points; the candidate neighbor points are at least some of the decoded points among the multiple decoded points, the attribute distance is determined based on the attribute information of the point to be decoded and the attribute information of the candidate neighbor points, and K is a positive integer greater than or equal to 1;

[0021] A prediction module, used to predict the attribute of the to-be-decoded point according to the attribute value of each first target neighbor point, and obtain the attribute prediction value of the to-be-decoded point;

[0022] The second determination module is used to determine the attribute reconstruction value of the point to be decoded according to the attribute prediction value of the point to be decoded and the attribute residual of the point to be decoded; the attribute residual of the point to be decoded is obtained by parsing the encoded bitstream.

[0023] In a fifth aspect, an electronic device is provided, which includes a processor and a memory, wherein the memory stores programs or instructions that can be run on the processor, and when the program or instructions are executed by the processor, the steps of the method described in the first aspect are implemented, or the steps of the method described in the second aspect are implemented.

[0024] In a sixth aspect, a readable storage medium is provided, on which a program or instruction is stored. When the program or instruction is executed by a processor, the steps of the method described in the first aspect are implemented, or the steps of the method described in the second aspect are implemented.

[0025] In the seventh aspect, a chip is provided, comprising a processor and a communication interface, wherein the communication interface is coupled to the processor, and the processor is used to run a program or instruction to implement the method described in the first aspect, or to implement the method described in the second aspect.

[0026] In an eighth aspect, a computer program / program product is provided, wherein the computer program / program product is stored in a storage medium, and the computer program / program product is executed by at least one processor to implement the steps of the method described in the first aspect, or to implement the steps of the method described in the second aspect.

[0027] In the embodiment of the present application, based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point in the multiple candidate neighbor points, K first target neighbor points among the multiple neighbor candidate points are determined; the attribute of the point to be encoded is predicted according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the point to be encoded; the attribute residual of the point to be encoded is encoded to generate the encoding code stream corresponding to the point to be encoded. Compared with the related art, in which the nearest neighbor point is determined only based on the geometric information of the encoded point, the present embodiment determines the nearest neighbor point based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point, so that the spatial distance between the nearest neighbor point and the point to be encoded is close and the attribute value difference is not large, and then the attribute encoding of the point to be encoded is performed based on the attribute value of the nearest neighbor point, and the encoding code stream with less information redundancy is obtained, thereby reducing the bit rate of the encoding code stream. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] Figure 1It is a partial framework schematic diagram of the G-PCC point cloud encoding device;

[0029] Figure 2 It is a partial framework diagram of the G-PCC point cloud decoding device;

[0030] Figure 3 This is a schematic diagram of the application scenario of updating the nearest neighbor point;

[0031] Figure 4 It is a schematic diagram of application scenarios of method distribution relationship;

[0032] Figure 5 It is a flowchart of the attribute encoding method provided in the embodiment of the present application;

[0033] Figure 6 It is a schematic diagram of the application process of the attribute encoding method provided in the embodiment of the present application;

[0034] Figure 7 is a flowchart of an attribute decoding method provided in an embodiment of the present application;

[0035] Figure 8 is a structural diagram of an attribute encoding device provided in an embodiment of the present application;

[0036] Fig. 9 is a structural diagram of an attribute decoding device provided in an embodiment of the present application;

[0037] Fig.10 is a structural diagram of an electronic device provided in an embodiment of the present application;

[0038] Fig.11 It is a schematic diagram of the hardware structure of the terminal provided in the embodiment of the present application. DETAILED DESCRIPTION

[0039] The following will be combined with the drawings in the embodiments of the present application to clearly describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field belong to the scope of protection of this application.

[0040] The terms "first", "second", etc. of the present application are used to distinguish similar objects, and are not used to describe a specific order or sequence. It should be understood that the terms used in this way are interchangeable where appropriate, so that the embodiments of the present application can be implemented in an order other than those illustrated or described herein, and the objects distinguished by "first" and "second" are generally of one type, and the number of objects is not limited, for example, the first object can be one or more. In addition, "or" in the present application represents at least one of the connected objects. For example, "A or B" covers three schemes, namely, Scheme 1: including A but not including B; Scheme 2: including B but not including A; Scheme 3: including both A and B. The character " / " generally indicates that the objects associated with each other are in an "or" relationship.

[0041] The term "indication" in this application can be a direct indication (or explicit indication) or an indirect indication (or implicit indication). A direct indication can be understood as the sender explicitly informing the receiver of specific information, operations to be performed, or request results in the sent indication; an indirect indication can be understood as the receiver determining the corresponding information according to the indication sent by the sender, or making a judgment and determining the operation to be performed or the request result according to the judgment result.

[0042] The attribute encoding device corresponding to the attribute encoding method and the attribute decoding device corresponding to the attribute decoding method in the embodiment of the present application may be a terminal, which may also be referred to as a terminal device or a user terminal (User Equipment, UE). The terminal may be a mobile phone, a tablet computer (Tablet Personal Computer), a laptop computer (Laptop Computer), a notebook computer, a personal digital assistant (Personal Digital Assistant, PDA), a handheld computer, a netbook, an ultra-mobile personal computer (Ultra-mobile Personal Computer, UMPC), a mobile Internet device (Mobile Internet Device, MID), an augmented reality (Augmented Reality, AR), a virtual reality (Virtual Reality, VR) device, a robot, a wearable device (Wearable Device), an aircraft (flight vehicle), a vehicle user equipment (VUE), a shipborne equipment, a pedestrian terminal (Pedestrian User Equipment, PUE), a smart home (home equipment with wireless communication function, such as a refrigerator, a television, a washing machine or furniture, etc.), a game console, a personal computer (Personal Computer, PC), a teller machine or a self-service machine and other terminal side devices. Wearable devices include: smart watches, smart bracelets, smart headphones, smart glasses, smart jewelry (smart bracelets, smart bracelets, smart rings, smart necklaces, smart anklets, smart anklets, etc.), smart wristbands, smart clothing, etc. Among them, the vehicle-mounted device can also be called a vehicle-mounted terminal, a vehicle-mounted controller, a vehicle-mounted module, a vehicle-mounted component, a vehicle-mounted chip or a vehicle-mounted unit, etc. It should be noted that the specific type of the terminal is not limited in the embodiments of the present application.

[0043] For ease of understanding, some contents involved in the embodiments of the present application are described below:

[0044] See also Figure 1 ,like Figure 1As shown, currently, in the digital audio and video coding technology standards, a point cloud encoding device based on geometry point cloud compression (G-PCC) can be used to encode the attribute information of the point cloud. Specifically, the attribute information of the point cloud can be color converted and recolored, and then the attribute information after recoloring can be subjected to a regional adaptive transformation based on upsampling prediction based on the reconstructed geometry information, or a lifting transformation based on hierarchical structure division to obtain a transformation coefficient, and the transformation coefficient is quantized to obtain a quantization coefficient; finally, the quantization coefficient is arithmetically encoded to obtain an attribute bit stream.

[0045] See also Figure 2 ,like Figure 2 As shown, currently, in the digital audio and video coding and decoding technical standards, the attribute information of the point cloud can be decoded using a G-PCC point cloud decoding device. It should be understood that the implementation process of the above-mentioned G-PCC point cloud decoding device decoding the attribute information of the point cloud is the inverse process of its encoding process, and will not be repeated here.

[0046] It should be noted that, in the process of encoding the attribute information of the point cloud, it usually includes a lifting transformation based on the level of detail (LOD) structure and a prediction transformation based on the LOD structure.

[0047] In the lifting transformation based on the LOD structure, the points in the point cloud are first Morton sorted. Optionally, Morton sorting can be performed in the following way:

[0048] With variable P i Represents a point in the input point cloud, variable M i For P i The related Morton code. Each dimension component of the geometric three-dimensional coordinates x, y, and z of a point is represented by a d-bit binary number:

[0049]

[0050] Among them, x l ,y l ,z l ∈{0,1} are the binary values ​​corresponding to the highest bit (l=1) to the lowest bit (l=d) of x, y, and z respectively. Morton sorting is performed on x, y, and z starting from the highest bit, where the calculation formula of the Morton code of each point is as follows:

[0051]

[0052] Among them, m l'∈{0,1} are the values ​​of the highest bit (l'=1) to the lowest bit (l'=3d) of M. After obtaining the Morton code M of each point in the point cloud, the points are rearranged in the order of the Morton code from small to large.

[0053] The LOD of the point cloud is constructed based on an iterative downsampling method, including but not limited to distance, sampling rate and octree structure, so as to establish a hierarchical structure of the point cloud. In some specific embodiments, the division method based on the sampling rate is as follows: in order to divide the point cloud into four levels of detail, the index of the point obtained by sorting the Morton value can be sampled at a rate of y times, and one point in each y index is divided into a refinement level, and the rest are sampled into the lowest level LOD. For each additional refinement level, the remaining points in the point index that have not been sampled continue to be sampled at a rate of y times, and one point in each y index is divided into a new refinement level, and the rest are sampled into the detail level LOD. Iterate in this way until all points are sampled to obtain the highest level of detail LOD, thereby constructing the final LOD structure of the point cloud.

[0054] An optional implementation is: points at a lower level and reconstructed points at the same level may be used to predict points at a higher level, and the points at the lower level and the same level may be used as reference points.

[0055] Another optional implementation method is to find the nearest neighbor of the current point to be encoded from the reconstructed points in the encoded frame to perform attribute prediction. Specifically, let the Morton code of the current point to be encoded be q, and find the first point whose Morton code is greater than or equal to q in the previous encoded frame according to the point index order of the frame. Take all points in the LOD level where the point is located as the reference point set, search for points within a certain range, calculate the geometric distance between each point and the point to be encoded, and compare the distance with the neighboring points found in the same frame to select the final multiple prediction points.

[0056] It should be noted that after determining the multiple neighboring points of the point to be encoded, it is necessary to determine the azimuth distribution so that the neighbor distribution can be multi-directional to improve the prediction accuracy.

[0057] Specifically, two lists (List), List1 and List2, can be constructed, where List1 contains multiple nearest neighbors obtained using the existing G-PCC neighbor search method, and List2 contains N points that are discarded in the process of updating the nearest neighbors. For example, N = 3, the process of generating List1 and List2 is as follows: Figure 3 shown.

[0058] Figure 3 8 neighboring points N0 to N7 are shown, and the distance between each neighboring point and the point to be encoded is shown. Figure 3If the points in List1 do not meet the strict orientation requirements of P1 and P2, P1 and P0, and P2 and P0, it means that the distribution of neighboring points is not wide enough. Therefore, we need to search List2 in order according to the order of candidate points in List2 to see if there are neighboring points in List2 that are strictly opposite to the points in List1. If there are and they meet certain geometric distance restrictions, we stop searching and use them to update the nearest neighboring point in List1 that is farthest from the current point to be encoded.

[0059] If there are no points in List2 that meet the above conditions, and the points in List1 are wide relative to each other in the directions of at least one pair of points such as P1 and P2, P1 and P0, P2 and P0 in the figure, then there is no need to update the farthest neighbor point.

[0060] If there are no points satisfying the above conditions in List2, and the points in List1 cannot satisfy that at least one pair of points have opposite azimuth widths, then search in order of the candidate points in List2 whether there are candidate points in List2 that are opposite in azimuth width to the points in List1. If there are candidate points and they satisfy certain geometric distance restrictions, stop searching and use them to update the nearest neighbor point in List1 that is farthest from the current point to be encoded.

[0061] It should be understood that Figure 4 Determine the azimuthal distribution relationship between points.

[0062] For example, in Figure 4 In the application scenario shown, point P is a point to be encoded, and a three-dimensional coordinate is constructed with the point to be encoded as the center of the coordinate axis.

[0063] Among them, if a certain point is located in the area where the mark 0 is located, and another point is located in the area where the mark 7 is located, then the azimuth distribution relationship of the two points is determined to be strictly relative. If a certain point is located in the area where the mark 1 is located, and another point is located in the area where the mark 6 is located, then the azimuth distribution relationship of the two points is determined to be strictly relative. If a certain point is located in the area where the mark 2 is located, and another point is located in the area where the mark 6 is located, then the azimuth distribution relationship of the two points is determined to be strictly relative. If a certain point is located in the area where the mark 3 is located, and another point is located in the area where the mark 4 is located, then the azimuth distribution relationship of the two points is determined to be strictly relative.

[0064] Among them, if a certain point is located in the area where the mark 0 is located, and another point is located in the area where the mark 3, mark 5 or mark 6 is located, then the azimuth distribution relationship of the two points is determined to be wide relative. If a certain point is located in the area where the mark 1 is located, and another point is located in the area where the mark 2, mark 4 or mark 7 is located, then the azimuth distribution relationship of the two points is determined to be wide relative. If a certain point is located in the area where the mark 2 is located, and another point is located in the area where the mark 1, mark 4 or mark 7 is located, then the azimuth distribution relationship of the two points is determined to be wide relative. If a certain point is located in the area where the mark 3 is located, and another point is located in the area where the mark 0, mark 5 or mark 6 is located, then the azimuth distribution relationship of the two points is determined to be wide relative. If a certain point is located in the area where the mark 4 is located, and another point is located in the area where the mark 1, mark 2 or mark 7 is located, then the azimuth distribution relationship of the two points is determined to be wide relative. If a certain point is located in the area where the mark 5 is located, and another point is located in the area where the mark 0, mark 3 or mark 6 is located, then the azimuth distribution relationship of the two points is determined to be wide relative. If a point is located in the area where the marker 6 is located, and another point is located in the area where the marker 3, marker 5 or marker 0 is located, then the azimuth distribution relationship of the two points is determined to be wide relative. If a point is located in the area where the marker 7 is located, and another point is located in the area where the marker 1, marker 2 or marker 4 is located, then the azimuth distribution relationship of the two points is determined to be wide relative.

[0065] After determining the nearest neighbor point, the attribute information of the point to be predicted can be predicted using the following formula:

[0066]

[0067] Among them, A i is the predicted value of the attribute of the current point, k is the number of adjacent points, A j Reconstruct the values ​​of the attributes of the adjacent points, w j is the corresponding weight coefficient, which is generally given by the following formula:

[0068]

[0069] Among them, d ij is the distance between the adjacent point and the point to be predicted, f(d ij ) is equal to d ij That is, according to the distance between each neighboring point and the point to be predicted, the correlation weakens as the distance increases, so a larger weight is given to the attribute reconstruction value of the neighboring point with a smaller distance.

[0070] In the prediction transformation based on the LOD structure, the rate-distortion optimization technology is introduced. That is, the prediction value and the corresponding prediction mode corresponding to each neighbor point are determined, and the prediction mode is selected by the rate-distortion method. Finally, the selected prediction mode and the quantized residual are jointly encoded into the bitstream of the attribute information.

[0071] Therefore, in the G-PCC point cloud attribute encoding process, the nearest neighbor point corresponding to the point to be encoded is determined only based on the geometric information of the encoded point, and then the attribute value of the nearest neighbor point is weightedly predicted to obtain the attribute prediction value of the point to be encoded. However, in the point cloud, there may be a situation where the spatial distance between the point to be encoded and the adjacent prediction point is close, but the attribute value is greatly different. If the nearest neighbor point is determined based on the geometric information of the encoded point, and the attribute encoding of the point to be encoded is performed based on the attribute value of the nearest neighbor point, it is easy to obtain a coded bitstream with information redundancy.

[0072] In order to solve the above existing technical problems, the present application provides an attribute encoding method, which can be applied to an encoding end. The attribute encoding method provided by the embodiment of the present application is described in detail below through some embodiments and application scenarios in conjunction with the accompanying drawings.

[0073] See also Figure 5 , Figure 5 : is a flow chart of the attribute encoding method in the embodiment of the present application. The attribute encoding method provided in this embodiment includes the following steps:

[0074] S501: The encoding end determines K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point among the multiple candidate neighbor points.

[0075] In this step, the point cloud can be color converted and recolored to obtain a geometrically reconstructed point cloud after recoloring. The sorting of the points in the point cloud is determined based on the geometric information of the point cloud according to the space filling curve. The above sorting methods include but are not limited to Morton sorting and Hilbert sorting.

[0076] The point cloud after geometric sorting is divided into LODs to construct a hierarchical structure of the point cloud. The above division method includes but is not limited to dividing the point cloud based on distance, sampling rate and octree structure.

[0077] An optional implementation method is to first encode the bottom-level points, and then use the bottom-level points and the reconstructed points at the same level to predict the high-level points, and use the bottom-level points and the points at the same level as reference points to obtain candidate neighbor points. Another optional implementation method is that in a multi-frame sequence, the reconstructed points in the encoded frames can also be used for prediction, and the reference frame points with high correlation are used as reference points. At this time, the reference frame and the point to be encoded are in different time frames, and then the points in a certain search range of the reference points are used as candidate neighbor points.

[0078] It should be noted that the candidate neighbor points are at least some of the encoded points among the multiple encoded points.

[0079] In this step, after determining the candidate neighbor points, the geometric distance between the point to be encoded and each of the candidate neighbor points is obtained, and the attribute distance between the point to be encoded and each of the candidate neighbor points is determined, wherein the attribute distance is determined based on the attribute information of the point to be encoded and the attribute information of the candidate neighbor points. Optionally, the attribute distance between the point to be encoded and the candidate neighbor points can be determined based on the difference between the attribute value of the point to be encoded and the attribute value of the candidate neighbor points.

[0080] Then, based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point, K first target neighbor points among the multiple neighbor candidate points are determined, where K is a positive integer greater than or equal to 1. The above-mentioned first target neighbor point can be understood as the K candidate neighbor points whose geometric distance is closer to the point to be encoded and whose attribute values ​​have the smallest difference.

[0081] S502: The encoder predicts the attribute of the point to be encoded according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the point to be encoded.

[0082] An optional implementation method is to calculate the attribute prediction value of the point to be coded by the following formula:

[0083]

[0084] Among them, predAttr represents the attribute prediction value of the current point to be encoded, nearestNeighNum represents the number of nearest neighbor points finally selected for predicting the point to be encoded, reconAttr[i] represents the reconstructed attribute value of the i-th nearest neighbor point, and w[i] is the weight coefficient corresponding to the i-th nearest neighbor point, which can be determined based on the target distance or geometric distance between the point to be encoded and the first target neighbor point. Optionally, the above weight coefficient can be the inverse of the target distance between the point to be encoded and the first target neighbor point.

[0085] Another optional implementation is to calculate the rate-distortion cost corresponding to each first target neighbor point, and then use the first target neighbor point with the smallest rate-distortion cost to predict the attribute of the point to be encoded, so as to obtain the attribute prediction value of the point to be encoded.

[0086] S503: The encoding end encodes the attribute residual of the to-be-encoded point to generate an encoding bitstream corresponding to the to-be-encoded point.

[0087] It should be understood that the attribute residual of the point to be encoded is determined based on the attribute prediction value of the point to be encoded and the original attribute value of the point to be encoded. Optionally, the difference between the attribute original value and the attribute prediction value of the point to be encoded can be determined as the attribute residual of the point to be encoded, and then the attribute residual of the point to be encoded is encoded to generate the encoding code stream corresponding to the point to be encoded.

[0088] In the embodiment of the present application, based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point in the multiple candidate neighbor points, K first target neighbor points among the multiple neighbor candidate points are determined; the attribute of the point to be encoded is predicted according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the point to be encoded; the attribute residual of the point to be encoded is encoded to generate the encoding code stream corresponding to the point to be encoded. Compared with the related art, in which the nearest neighbor point is determined only based on the geometric information of the encoded point, the present embodiment determines the nearest neighbor point based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point, so that the spatial distance between the nearest neighbor point and the point to be encoded is close and the attribute value difference is not large, and then the attribute encoding of the point to be encoded is performed based on the attribute value of the nearest neighbor point, and the encoding code stream with less information redundancy is obtained, thereby reducing the bit rate of the encoding code stream.

[0089] Optionally, the determining K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point among the multiple candidate neighbor points includes:

[0090] Calculating the geometric distance between the point to be encoded and each of the candidate neighbor points, and determining the attribute distance between the point to be encoded and each of the candidate neighbor points based on the attribute information of the point to be encoded and the attribute information of each of the candidate neighbor points;

[0091] Determine a target distance between the point to be encoded and each candidate neighbor point according to a geometric distance and an attribute distance between the point to be encoded and each candidate neighbor point;

[0092] Determine K candidate neighbor points with the smallest corresponding target distances among the multiple candidate neighbor points as K first neighbor points;

[0093] According to the azimuth distribution relationship between the point to be encoded and each first neighbor point, the K first neighbor points are updated to obtain the K first target neighbor points.

[0094] In this embodiment, the geometric information of the point to be encoded and the geometric information of each candidate neighbor point can be obtained, and then the geometric distance between the point to be encoded and each candidate neighbor point is calculated based on the geometric information of the point to be encoded and the geometric information of each candidate neighbor point. The geometric information includes geometric coordinates, which can be Cartesian coordinates, spherical coordinates, cylindrical coordinates, etc. The geometric distance between the point to be encoded and the candidate neighbor point can be the Euclidean distance or the Manhattan distance between the point to be encoded and the candidate neighbor point.

[0095] In this embodiment, the attribute information of the point to be encoded and the attribute information of each candidate neighbor point are obtained, and then based on the attribute information of the encoding point and the attribute information of each candidate neighbor point, the attribute distance between the point to be encoded and each candidate neighbor point is determined. The attribute distance can represent the difference between the attribute information of the encoding point and the attribute information of the candidate neighbor point.

[0096] It should be understood that the above-mentioned attribute information includes two types, namely reflectivity information and color information, wherein the color information includes Y component information, U component information and V component information.

[0097] After determining the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point, the target distance between the point to be encoded and each candidate neighbor point can be determined based on the geometric distance and attribute distance. Optionally, the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point can be weighted and summed to obtain the target distance between the point to be encoded and each candidate neighbor point. For specific implementation methods of how to determine the target distance between the point to be encoded and each candidate neighbor point, please refer to the subsequent embodiments.

[0098] The above-mentioned target distance can characterize the correlation between the attribute information of the point to be encoded and the attribute information of the candidate neighbor points, and can also characterize the correlation between the geometric information of the point to be encoded and the geometric information of the candidate neighbor points. Therefore, the K candidate neighbor points with the smallest corresponding target distance among multiple candidate neighbor points can be determined as the K first neighbor points, that is, the geometric distance between these K first neighbor points and the point to be encoded is relatively close, and the attribute information of these K first neighbor points is not much different from the attribute information of the point to be encoded.

[0099] In this embodiment, the K first neighbor points are updated according to the azimuth distribution relationship between the point to be encoded and each first neighbor point to obtain the updated K first target neighbor points.

[0100] In this embodiment, the nearest neighbor point is determined according to the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point, thereby obtaining a first target neighbor point that is close to the point to be encoded in space and has attribute values ​​close to the point to be encoded.

[0101] In other embodiments, after determining multiple candidate neighbor points, the geometric distance between the point to be encoded and each candidate neighbor point is calculated, K first neighbor points are determined, and the K first neighbor points are updated according to the azimuth distribution relationship between the point to be encoded and each first neighbor point. Then, according to the target distance between the point to be encoded and each updated first neighbor point, the updated K first neighbor points are sorted to obtain K first target neighbor points.

[0102] In other embodiments, after determining multiple candidate neighbor points, the geometric distance between the point to be encoded and each candidate neighbor point is calculated, K first neighbor points are determined, and the K first neighbor points are updated according to the target distance between the point to be encoded and each first neighbor point. Then, according to the azimuth distribution relationship between the point to be encoded and each updated first neighbor point, K first target neighbor points are obtained.

[0103] Optionally, the determining the attribute distance between the point to be encoded and each candidate neighbor point based on the attribute information of the point to be encoded and the attribute information of each candidate neighbor point includes:

[0104] For any first candidate neighbor point among the multiple candidate neighbor points, calculating an attribute difference value between an attribute value of the point to be encoded and an attribute value of the first candidate neighbor point; the attribute value of the point to be encoded is determined based on attribute information of the point to be encoded, the attribute value of the first candidate neighbor point is determined based on attribute information of the first candidate neighbor point, and the attribute information of the point to be encoded and the attribute information of the first candidate neighbor point are of the same attribute type;

[0105] The product of the weight value corresponding to the first candidate neighbor point and the attribute difference value is determined as the attribute distance between the point to be encoded and the first candidate neighbor point.

[0106] In this embodiment, the attribute distance between the point to be encoded and the first candidate neighbor point can be determined by the following formula:

[0107]

[0108] Among them, attrDis represents the attribute information of the encoded type of the point to be encoded, attrNeighbour represents the attribute information of the first candidate neighbor point, and the two attribute information are of the same type, dimAttr represents the number of components contained in the attribute information, and wAttr[i] represents the preset weight of the i-th component of the attribute information when calculating the attribute distance.

[0109] In this embodiment, since the attribute distance between the point to be encoded and the candidate neighbor points is determined based on the attribute information of the point to be encoded and the attribute information of the candidate neighbor points, the attribute distance between the point to be encoded and the candidate neighbor points can accurately represent the difference between the attribute information of the point to be encoded and the attribute information of each candidate neighbor point.

[0110] Optionally, determining the target distance between the point to be encoded and each candidate neighbor point according to the geometric distance and the attribute distance between the point to be encoded and each candidate neighbor point includes:

[0111] For any second candidate neighbor point among the multiple candidate neighbor points, determine the sum of the first product corresponding to the second candidate neighbor point and the second product corresponding to the second candidate neighbor point as the target distance between the point to be encoded and the second candidate neighbor point;

[0112] Among them, the first product is the product of the geometric distance weight value corresponding to the second candidate neighbor point and the geometric distance corresponding to the second candidate neighbor point, and the second product is the product of the attribute distance weight value corresponding to the second candidate neighbor point and the attribute distance corresponding to the second candidate neighbor point.

[0113] In this embodiment, the target distance between the point to be encoded and the second candidate neighbor point can be determined by the following formula:

[0114]

[0115] Among them, overallDis represents the target distance, geomDis represents the geometric distance, attrDis[i] represents the i-th encoded attribute distance of different types. attrCodedNum represents the number of types of encoded attribute information, geomW represents the weight corresponding to the geometric distance, and attrW[i] represents the weight corresponding to the i-th encoded attribute distance of different types.

[0116] Optionally, the weight corresponding to the i-th encoded attribute distance of different types can be determined by the following formula:

[0117] attrW[i]=k·attrQuantParam+b

[0118] Wherein, k and b are arbitrary real numbers, and attrQuantParam represents the preset attribute quantization parameter.

[0119] In other embodiments, the geometric distance and the attribute distance between the to-be-coded point and the candidate neighbor points may be weightedly summed to obtain the target distance between the to-be-coded point and the candidate neighbor points.

[0120] Optionally, updating the K first neighbor points according to the azimuth distribution relationship between the point to be encoded and each first neighbor point includes:

[0121] When the azimuth distribution relationship between the point to be encoded and any two first neighbor points is not relative, the first neighbor points of the K first neighbor points that are farthest from the target distance between the point to be encoded are updated as second target neighbor points of the N second neighbor points;

[0122] The N second neighbor points are some of the neighbor points among the multiple candidate neighbor points except the K first neighbor points, the second target neighbor point is a second neighbor point among the N second neighbor points that meets the preset conditions, and N is a positive integer greater than or equal to 1;

[0123] The preset conditions include:

[0124] The target distance between the second neighbor point and the point to be encoded is less than or equal to a preset distance; and

[0125] The orientation between the second neighbor point and the point to be encoded is relative to the orientation between any first neighbor point and the point to be encoded, and any first neighbor point is the first neighbor point among the K first neighbor points except the first neighbor point farthest from the target point to be encoded.

[0126] In this embodiment, the azimuth distribution relationship between the point to be encoded and any two first neighboring points is determined, and when the azimuth distribution relationship between the point to be encoded and any two first neighboring points is not relative in direction, K first neighboring points are updated. For the implementation scheme of how to determine the azimuth distribution relationship between the point to be encoded and any two first neighboring points, please refer to the above embodiment, which will not be repeated here.

[0127] The specific scheme for updating K first neighbor points is:

[0128] Determine N neighbor points other than the K first neighbor points among the plurality of candidate neighbor points as N second neighbor points, and determine a second neighbor point that meets a preset condition among the N second neighbor points as a second target neighbor point. The number of the second target neighbor points may be one or more.

[0129] The above-mentioned preset conditions include: the target distance between the second neighbor point and the point to be encoded is less than or equal to the preset distance; and the orientation between the second neighbor point and the point to be encoded is relative to the orientation between any first neighbor point and the point to be encoded, and any first neighbor point is the first neighbor point among the K first neighbor points except the first neighbor point with the farthest target distance from the point to be encoded. Optionally, the above-mentioned preset conditions include that the target distance between the second neighbor point and the point to be encoded is less than or equal to the preset distance, which can be replaced by that the geometric distance between the second neighbor point and the point to be encoded is less than or equal to the preset distance.

[0130] For example, the target distance between the second neighbor point and the point to be encoded is less than the preset distance, and the orientation between the second neighbor point and the point to be encoded is located at Figure 4 The area where the marker 0 is located is located. The direction between the first neighbor point and the point to be encoded is located at Figure 4If the area marked with marker 7 is located, and the first neighbor point is not the first neighbor point farthest from the target point to be encoded among the K first neighbor points, it is determined that the second neighbor point is the second target neighbor point that meets the preset conditions.

[0131] Optionally, one of the K first neighbor points with the farthest target distance from the point to be encoded may be updated to one of the N second neighbor points; or multiple first neighbor points with the farthest target distance from the point to be encoded may be updated to multiple second target neighbor points among the N second neighbor points. This embodiment does not limit the specific number of second target neighbor points.

[0132] In this embodiment, by updating some of the first neighbor points with the farthest target distance from the point to be encoded among the K first neighbor points as second target neighbor points, the K first target neighbor points obtained after the update are arranged relative to the azimuth distribution of the point to be encoded, thereby improving the accuracy of the attribute prediction value of the point to be encoded determined by the K first target neighbor points.

[0133] Optionally, before determining K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be encoded and each of the multiple candidate neighbor points, the method further includes:

[0134] Acquire point cloud data; the point cloud data includes a point to be encoded, a plurality of encoded points and a coding identifier;

[0135] When the attribute information of the plurality of encoded points corresponds to different attribute types and the encoding identifier is used to represent attribute encoding based on the attribute type performed on the point to be encoded, a geometric distance and an attribute distance between the point to be encoded and each candidate neighbor point are determined.

[0136] In this embodiment, point cloud data is obtained, and the point cloud data includes a point to be encoded, multiple encoded points and a coding identifier, wherein the above-mentioned coding identifier is also called an enabling identifier for prediction between attribute types. Optionally, the sequence parameter set of the point cloud or the attribute parameter set of the point cloud includes the coding identifier.

[0137] When the attribute information of multiple encoded points corresponds to different attribute types, and the encoding identifier is used to characterize the attribute encoding based on the attribute type to be performed on the point to be encoded, the attribute encoding method provided in the embodiment of the present application is used to perform attribute encoding on the point to be encoded, that is, the step of determining the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point is performed.

[0138] In this embodiment, a coding identifier is provided, which indicates that attribute coding based on attribute type is performed on the to-be-coded point, and when the attribute information of multiple coded points corresponds to different attribute types, the attribute coding method provided in the embodiment of the present application is used to perform attribute coding on the to-be-coded point, that is, different types of coded attribute information are introduced into the attribute prediction to measure the correlation between the to-be-predicted point and its neighboring points, so as to improve the attribute coding efficiency.

[0139] To facilitate understanding of the technical effects of the attribute encoding method provided in the embodiments of the present application, please refer to Table 1 and Table 2.

[0140] Table 1:

[0141] Y component U Component V Component Point cloud type 1 -6.5% -5.7% -6.3% Point cloud type 2 -4.5% -5.1% -6.1%

[0142] Table 2:

[0143] Reflectivity Point cloud type 3 -6.7% Point cloud type 4 -4.7%

[0144] Among them, the values ​​in Table 1 and Table 2 are used to characterize the bit rate ratio between the bit stream generated by the attribute coding provided in the embodiment of the present application and the bit stream generated using the related technology when the peak signal-to-noise ratio is the same. It should be understood that the lower the value, the more the bit rate is reduced.

[0145] For example, "-6.5%" in the second row and second column of Table 1 indicates that the bit rate of the Y component generated by the transform coefficient encoding provided in the embodiment of the present application is reduced by 6.5% compared with the bit rate of the Y component generated using the related technology.

[0146] To understand the overall technical solution, please refer to Figure 6 ,like Figure 6 As shown, the candidate neighbor points corresponding to the point to be encoded are determined, the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point are calculated, and then the target distance between the point to be encoded and each candidate neighbor point is determined based on the geometric distance and attribute distance, and K first neighbor points are determined according to the target distance. After traversing all the candidate neighbor points, the K first neighbor points are updated based on the azimuth distribution relationship between the point to be encoded and each first neighbor point to obtain K first target neighbor points, and then the K first target neighbor points are used to predict the attributes of the point to be encoded to obtain the attribute prediction value of the point to be encoded, and the attribute prediction value is encoded to obtain the encoded bitstream.

[0147] In other embodiments, the correlation between different types of attribute information can be used to segmentally fit the regression curve between the type corresponding to the attribute information of the point to be encoded and the type corresponding to the attribute information of the encoded point. Among them, the type corresponding to the attribute information of the above-mentioned point to be encoded is also called the type to be encoded, and the type corresponding to the attribute information of the encoded point is also called the encoded type. Optionally, the form of the above-mentioned regression curve includes but is not limited to the form of a linear function. Optionally, L points can be selected from the point cloud in sequence, and the selected L points are formed into a point set, where L can be a positive integer greater than or equal to 20. Based on the type to be encoded and the encoded type of these L points, the model parameters are determined. For example, the least squares method can be used to fit the straight line to obtain the fitted straight line y=ax+b between multiple attributes. It should also be noted that a method different from the least squares method can also be used to fit the straight line, such as the gradient descent method or the Gauss-Newton method.

[0148] For each point to be encoded, the reconstructed attribute value of the encoded type and the prediction model are used to calculate the predicted value of the type to be encoded, and then the prediction residual is obtained by checking the predicted value and the original attribute value, and the prediction residual is encoded to obtain the bitstream.

[0149] The decoding end parses and obtains the parameters of the prediction model, and then determines the prediction value corresponding to the point to be decoded according to the parameters, and obtains the attribute reconstruction value of the point to be decoded according to the prediction value and the prediction residual.

[0150] In other embodiments, the correlation between different types of attribute information may be used to piecewise fit a regression curve between the type corresponding to the attribute information of the point to be encoded and the type corresponding to the attribute information of the encoded point.

[0151] For each point to be encoded, the attribute residual of the type to be encoded is represented according to the attribute residual of the encoded type using the parameters of the prediction model of the point to be encoded.

[0152] The decoding end parses and obtains the parameters of the prediction model, and then determines the prediction value corresponding to the point to be decoded according to the parameters, and obtains the attribute reconstruction value of the point to be decoded according to the prediction value and the prediction residual.

[0153] See also Figure 7 , Figure 7 : is a flow chart of the attribute decoding method provided in the embodiment of the present application. The attribute decoding method provided in this embodiment includes the following steps:

[0154] S701, the decoding end parses the acquired coded bitstream to obtain a point to be decoded and a plurality of decoded points.

[0155] In this step, the decoding section obtains the encoded code stream, and parses the encoded code stream to obtain a point to be decoded and a plurality of decoded points.

[0156] S702: The decoding end determines K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point among the multiple candidate neighbor points.

[0157] One optional implementation is to use the bottom-level points and the reconstructed points at the same level to predict the high-level points, and use the bottom-level points and the points at the same level as reference points to obtain candidate neighbor points. Another optional implementation is to use the reconstructed points in the decoded frame for prediction, use the reference frame points with high correlation as reference points, and then use the points in a certain search range of the reference points as candidate neighbor points.

[0158] The geometric distance and attribute distance between the point to be decoded and each candidate neighbor point are calculated, and then K first target neighbor points among the multiple neighbor candidate points are determined based on the geometric distance and attribute distance.

[0159] The candidate neighbor point is a part of the decoded points among the multiple decoded points, the attribute distance is determined based on the attribute information of the point to be decoded and the attribute information of the candidate neighbor point, and K is a positive integer greater than or equal to 1.

[0160] S703: The decoding end predicts the attribute of the point to be decoded according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the point to be decoded.

[0161] In this step, the same method as the encoding end can be applied to predict the attribute of the point to be decoded according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the point to be decoded, which will not be repeated here.

[0162] S704: The decoding end determines a reconstructed attribute value of the point to be decoded according to the predicted attribute value of the point to be decoded and the attribute residual of the point to be decoded.

[0163] It should be understood that the attribute residual of the point to be decoded is obtained based on parsing the coded bitstream. Optionally, the sum of the attribute prediction value of the point to be decoded and the attribute residual of the point to be decoded can be determined as the attribute reconstruction value of the point to be decoded.

[0164] Compared with the related art, in which the nearest neighbor point is determined only based on the geometric information of the decoded point, this embodiment determines the nearest neighbor point based on the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point, so that the spatial distance between the above-mentioned nearest neighbor point and the point to be decoded is relatively close and the attribute value difference is not large, and then the attribute decoding of the point to be decoded is performed based on the attribute value of the above-mentioned nearest neighbor point, so as to complete the decoding of the code stream with less information redundancy.

[0165] Optionally, determining K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point among the multiple candidate neighbor points includes:

[0166] Calculating the geometric distance between the point to be decoded and each of the candidate neighbor points, and determining the attribute distance between the point to be decoded and each of the candidate neighbor points based on the attribute information of the point to be decoded and the attribute information of each of the candidate neighbor points;

[0167] Determine a target distance between the point to be decoded and each of the candidate neighbor points according to a geometric distance and an attribute distance between the point to be decoded and each of the candidate neighbor points;

[0168] Determine K candidate neighbor points with the smallest corresponding target distances among the multiple candidate neighbor points as K first neighbor points;

[0169] According to the azimuth distribution relationship between the point to be decoded and each first neighbor point, the K first neighbor points are updated to obtain the K first target neighbor points.

[0170] In this embodiment, the Euclidean distance or Manhattan distance between the point to be decoded and the candidate neighbor point can be determined as the geometric distance between the point to be decoded and the candidate neighbor point. The attribute information of the point to be decoded and the attribute information of each candidate neighbor point are obtained, and then the attribute distance between the point to be decoded and each candidate neighbor point is determined based on the attribute information of the decoding point and the attribute information of each candidate neighbor point. Then, based on the geometric distance and the attribute distance, the target distance between the point to be decoded and each candidate neighbor point is determined.

[0171] In this embodiment, K candidate neighbor points with the smallest corresponding target distance among multiple candidate neighbor points can be determined as K first neighbor points with a relatively close geometric distance to the point to be decoded and whose attribute information is not much different from that of the point to be decoded. Then, according to the azimuth distribution relationship between the point to be decoded and each first neighbor point, the above K first neighbor points are updated to obtain the updated K first target neighbor points.

[0172] Optionally, the determining the attribute distance between the point to be decoded and each candidate neighbor point based on the attribute information of the point to be decoded and the attribute information of each candidate neighbor point includes:

[0173] For any first candidate neighbor point among the multiple candidate neighbor points, calculating an attribute difference value between an attribute value of the point to be decoded and an attribute value of the first candidate neighbor point; the attribute value of the point to be decoded is determined based on the attribute information of the point to be decoded, the attribute value of the first candidate neighbor point is determined based on the attribute information of the first candidate neighbor point, and the attribute information of the point to be decoded and the attribute information of the first candidate neighbor point are of the same attribute type;

[0174] The product of the weight value corresponding to the first candidate neighbor point and the attribute difference value is determined as the attribute distance between the point to be decoded and the first candidate neighbor point.

[0175] In this embodiment, the attribute distance between the point to be decoded and each candidate neighbor point may be determined by adopting a method in which the encoding end determines the attribute distance, which will not be described repeatedly here.

[0176] Optionally, determining the target distance between the point to be decoded and each candidate neighbor point according to the geometric distance and the attribute distance between the point to be decoded and each candidate neighbor point includes:

[0177] For any second candidate neighbor point among the multiple candidate neighbor points, determine the sum of the first product corresponding to the second candidate neighbor point and the second product corresponding to the second candidate neighbor point as the target distance between the point to be decoded and the second candidate neighbor point;

[0178] Among them, the first product is the product of the geometric distance weight value corresponding to the second candidate neighbor point and the geometric distance corresponding to the second candidate neighbor point, and the second product is the product of the attribute distance weight value corresponding to the second candidate neighbor point and the attribute distance corresponding to the second candidate neighbor point.

[0179] In this embodiment, the target distance between the point to be decoded and each candidate neighbor point may be determined by adopting the method of determining the target distance at the encoding end, which will not be repeated here.

[0180] Optionally, updating the K first neighbor points according to the azimuth distribution relationship between the point to be decoded and each first neighbor point includes:

[0181] When the azimuth distribution relationship between the to-be-decoded point and any two first neighbor points is not relative, the first neighbor points of the K first neighbor points that are farthest from the target distance between the to-be-decoded point and the first neighbor points are updated as second target neighbor points of the N second neighbor points;

[0182] The N second neighbor points are some of the neighbor points among the multiple candidate neighbor points except the K first neighbor points, the second target neighbor point is the second neighbor point among the N second neighbor points that meets the preset conditions and has the smallest corresponding target distance, and N is a positive integer greater than or equal to 1;

[0183] The preset conditions include:

[0184] The target distance between the second neighbor point and the point to be decoded is less than or equal to a preset distance; and

[0185] The orientation between the second neighbor point and the point to be decoded is relative to the orientation between any first neighbor point and the point to be decoded, and any first neighbor point is the first neighbor point among the K first neighbor points except the first neighbor point farthest from the target point to be decoded.

[0186] In this embodiment, the azimuth distribution relationship between the point to be decoded and any two first neighboring points is determined, and when the azimuth distribution relationship between the point to be decoded and any two first neighboring points is not relative in direction, K first neighboring points are updated.

[0187] Among them, the K first neighbor points can be updated in a manner where the encoding end updates the K first neighbor points, which will not be repeated here.

[0188] Optionally, the encoded bitstream includes a decoding identifier, and before determining K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point among the multiple candidate neighbor points, the method further includes:

[0189] When the attribute information of the plurality of decoded points corresponds to different attribute types and the decoding identifier is used to represent attribute decoding based on the attribute type performed on the point to be decoded, a geometric distance and an attribute distance between the point to be decoded and each candidate neighbor point are determined.

[0190] In this embodiment, the encoding code stream transmitted by the encoding end includes an encoding identifier. When the attribute information of multiple decoded points corresponds to different attribute types, and the decoding identifier is used to represent the attribute decoding based on the attribute type performed on the point to be decoded, the attribute decoding method provided in the embodiment of the present application is used to perform attribute decoding on the point to be decoded, that is, to perform the step of determining the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point.

[0191] The attribute coding method provided in the embodiment of the present application may be executed by an attribute coding device. In the embodiment of the present application, the attribute coding device executing the attribute coding method is taken as an example to illustrate the attribute coding device provided in the embodiment of the present application.

[0192] like Figure 8 As shown, the embodiment of the present application further provides an attribute encoding device 800, including:

[0193] A first determination module 801 is used to determine K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point among the multiple candidate neighbor points; the candidate neighbor points are at least some of the encoded points among the multiple encoded points, the attribute distance is determined based on the attribute information of the point to be encoded and the attribute information of the candidate neighbor points, and K is a positive integer greater than or equal to 1;

[0194] A prediction module 802 is used to perform attribute prediction on the to-be-coded point according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the to-be-coded point;

[0195] The generating module 803 is used to encode the attribute residual of the point to be encoded to generate an encoding code stream corresponding to the point to be encoded; the attribute residual of the point to be encoded is determined based on the attribute prediction value of the point to be encoded and the original attribute value of the point to be encoded.

[0196] Optionally, the first determining module 801 is specifically configured to:

[0197] Calculating the geometric distance between the point to be encoded and each of the candidate neighbor points, and determining the attribute distance between the point to be encoded and each of the candidate neighbor points based on the attribute information of the point to be encoded and the attribute information of each of the candidate neighbor points;

[0198] Determine a target distance between the point to be encoded and each candidate neighbor point according to a geometric distance and an attribute distance between the point to be encoded and each candidate neighbor point;

[0199] Determine K candidate neighbor points with the smallest corresponding target distances among the multiple candidate neighbor points as K first neighbor points;

[0200] According to the azimuth distribution relationship between the point to be encoded and each first neighbor point, the K first neighbor points are updated to obtain the K first target neighbor points.

[0201] Optionally, the first determining module 801 is further specifically configured to:

[0202] For any first candidate neighbor point among the multiple candidate neighbor points, calculating an attribute difference value between an attribute value of the point to be encoded and an attribute value of the first candidate neighbor point; the attribute value of the point to be encoded is determined based on attribute information of the point to be encoded, the attribute value of the first candidate neighbor point is determined based on attribute information of the first candidate neighbor point, and the attribute information of the point to be encoded and the attribute information of the first candidate neighbor point are of the same attribute type;

[0203] The product of the weight value corresponding to the first candidate neighbor point and the attribute difference value is determined as the attribute distance between the point to be encoded and the first candidate neighbor point.

[0204] Optionally, the first determining module 801 is further specifically configured to:

[0205] For any second candidate neighbor point among the multiple candidate neighbor points, determine the sum of the first product corresponding to the second candidate neighbor point and the second product corresponding to the second candidate neighbor point as the target distance between the point to be encoded and the second candidate neighbor point;

[0206] Among them, the first product is the product of the geometric distance weight value corresponding to the second candidate neighbor point and the geometric distance corresponding to the second candidate neighbor point, and the second product is the product of the attribute distance weight value corresponding to the second candidate neighbor point and the attribute distance corresponding to the second candidate neighbor point.

[0207] Optionally, the first determining module 801 is further specifically configured to:

[0208] When the azimuth distribution relationship between the point to be encoded and any two first neighbor points is not relative, the first neighbor points of the K first neighbor points that are farthest from the target distance between the point to be encoded are updated as second target neighbor points of the N second neighbor points;

[0209] The N second neighbor points are some of the neighbor points among the multiple candidate neighbor points except the K first neighbor points, the second target neighbor point is a second neighbor point among the N second neighbor points that meets the preset conditions, and N is a positive integer greater than or equal to 1;

[0210] The preset conditions include:

[0211] The target distance between the second neighbor point and the point to be encoded is less than or equal to a preset distance; and

[0212] The orientation between the second neighbor point and the point to be encoded is relative to the orientation between any first neighbor point and the point to be encoded, and any first neighbor point is the first neighbor point among the K first neighbor points except the first neighbor point farthest from the target point to be encoded.

[0213] Optionally, it is characterized in that the attribute encoding device 800 further includes:

[0214] An acquisition module, used to acquire point cloud data; the point cloud data includes a point to be encoded, a plurality of encoded points and a coding identifier;

[0215] The second determination module is used to determine the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point when the attribute information of the multiple encoded points corresponds to different attribute types and the encoding identifier is used to represent the attribute encoding based on the attribute type performed on the point to be encoded.

[0216] Compared with the related art, in which the nearest neighbor point is determined only based on the geometric information of the encoded point, the present embodiment determines the nearest neighbor point based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point, so that the spatial distance between the nearest neighbor point and the point to be encoded is relatively close and the attribute value difference is not large. Then, attribute encoding is performed on the point to be encoded based on the attribute value of the nearest neighbor point, and an encoded code stream with less information redundancy is obtained, thereby reducing the bit rate of the encoded code stream.

[0217] This device embodiment is similar to the above Figure 5 Corresponding to the attribute encoding method embodiment shown, each implementation process and implementation mode of the encoding end in the above method embodiment can be applied to the device embodiment and can achieve the same technical effect.

[0218] The attribute decoding method provided in the embodiment of the present application may be executed by an attribute decoding device. In the embodiment of the present application, the attribute decoding device provided in the embodiment of the present application is described by taking the attribute decoding method executed by the attribute decoding device as an example.

[0219] like Fig. 9 As shown, the embodiment of the present application further provides an attribute decoding device 900, including:

[0220] The parsing module 901 is used to parse the acquired coded bitstream to obtain a point to be decoded and a plurality of decoded points;

[0221] A first determination module 902 is used to determine K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point among the multiple candidate neighbor points; the candidate neighbor points are at least some of the decoded points among the multiple decoded points, the attribute distance is determined based on the attribute information of the point to be decoded and the attribute information of the candidate neighbor points, and K is a positive integer greater than or equal to 1;

[0222] A prediction module 903 is used to perform attribute prediction on the to-be-decoded point according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the to-be-decoded point;

[0223] The second determination module 904 is used to determine the attribute reconstruction value of the point to be decoded according to the attribute prediction value of the point to be decoded and the attribute residual of the point to be decoded; the attribute residual of the point to be decoded is obtained by parsing the encoded bitstream.

[0224] Optionally, the first determining module 902 is specifically configured to:

[0225] Calculating the geometric distance between the point to be decoded and each of the candidate neighbor points, and determining the attribute distance between the point to be decoded and each of the candidate neighbor points based on the attribute information of the point to be decoded and the attribute information of each of the candidate neighbor points;

[0226] Determine a target distance between the point to be decoded and each of the candidate neighbor points according to a geometric distance and an attribute distance between the point to be decoded and each of the candidate neighbor points;

[0227] Determine K candidate neighbor points with the smallest corresponding target distances among the multiple candidate neighbor points as K first neighbor points;

[0228] According to the azimuth distribution relationship between the point to be decoded and each first neighbor point, the K first neighbor points are updated to obtain the K first target neighbor points.

[0229] Optionally, the first determining module 902 is further specifically configured to:

[0230] For any first candidate neighbor point among the multiple candidate neighbor points, calculating an attribute difference value between an attribute value of the point to be decoded and an attribute value of the first candidate neighbor point; the attribute value of the point to be decoded is determined based on the attribute information of the point to be decoded, the attribute value of the first candidate neighbor point is determined based on the attribute information of the first candidate neighbor point, and the attribute information of the point to be decoded and the attribute information of the first candidate neighbor point are of the same attribute type;

[0231] The product of the weight value corresponding to the first candidate neighbor point and the attribute difference value is determined as the attribute distance between the point to be decoded and the first candidate neighbor point.

[0232] Optionally, the first determining module 902 is further specifically configured to:

[0233] For any second candidate neighbor point among the multiple candidate neighbor points, determine the sum of the first product corresponding to the second candidate neighbor point and the second product corresponding to the second candidate neighbor point as the target distance between the point to be decoded and the second candidate neighbor point;

[0234] Among them, the first product is the product of the geometric distance weight value corresponding to the second candidate neighbor point and the geometric distance corresponding to the second candidate neighbor point, and the second product is the product of the attribute distance weight value corresponding to the second candidate neighbor point and the attribute distance corresponding to the second candidate neighbor point.

[0235] Optionally, the first determining module 902 is further specifically configured to:

[0236] When the azimuth distribution relationship between the to-be-decoded point and any two first neighbor points is not relative, the first neighbor points of the K first neighbor points that are farthest from the target distance between the to-be-decoded point and the first neighbor points are updated as second target neighbor points of the N second neighbor points;

[0237] The N second neighbor points are some of the neighbor points among the multiple candidate neighbor points except the K first neighbor points, the second target neighbor point is the second neighbor point among the N second neighbor points that meets the preset conditions and has the smallest corresponding target distance, and N is a positive integer greater than or equal to 1;

[0238] The preset conditions include:

[0239] The target distance between the second neighbor point and the point to be decoded is less than or equal to a preset distance; and

[0240] The orientation between the second neighbor point and the point to be decoded is relative to the orientation between any first neighbor point and the point to be decoded, and any first neighbor point is the first neighbor point among the K first neighbor points except the first neighbor point farthest from the target point to be decoded.

[0241] Optionally, the attribute decoding device 900 further includes:

[0242] The third determination module is used to determine the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point when the attribute information of the multiple decoded points corresponds to different attribute types and the decoding identifier is used to represent the attribute decoding based on the attribute type performed on the point to be decoded.

[0243] Compared with the related art, in which the nearest neighbor point is determined only based on the geometric information of the decoded point, this embodiment determines the nearest neighbor point based on the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point, so that the spatial distance between the above-mentioned nearest neighbor point and the point to be decoded is relatively close and the attribute value difference is not large, and then the attribute decoding of the point to be decoded is performed based on the attribute value of the above-mentioned nearest neighbor point, so as to complete the decoding of the code stream with less information redundancy.

[0244] The attribute decoding device provided in the embodiment of the present application can achieve Figure 7 The various processes implemented by the method embodiment and achieving the same technical effect are not described here to avoid repetition.

[0245] The attribute encoding device and the attribute decoding device in the embodiment of the present application can be an electronic device, such as an electronic device with an operating system, or a component in an electronic device, such as an integrated circuit or a chip. The electronic device can be a terminal, or can be other devices other than a terminal. Exemplarily, the terminal can include but is not limited to the types of terminals listed above, and other devices can be servers, network attached storage (NAS), etc., which are not specifically limited in the embodiment of the present application.

[0246] The attribute encoding device provided in the embodiment of the present application can achieve Figure 5 The various processes implemented by the method embodiment and achieving the same technical effect are not described here to avoid repetition.

[0247] The attribute decoding device provided in the embodiment of the present application can achieve Figure 7 The various processes implemented by the method embodiment and achieving the same technical effect are not described here to avoid repetition.

[0248] Alternatively, if Fig.10 As shown, an embodiment of the present application further provides an electronic device 1000, including a processor 1001 and a memory 1002, wherein the memory 1002 stores programs or instructions that can be executed on the processor 1001. For example, when the electronic device 1000 is a terminal, the program or instructions are executed by the processor 1001 to implement the various steps of the above-mentioned attribute encoding method embodiment, or to implement the various steps of the above-mentioned attribute decoding method embodiment, and can achieve the same technical effect.

[0249] The embodiment of the present application also provides a terminal, including a processor and a communication interface, wherein the communication interface is coupled to the processor, and the processor is used to run a program or instruction to implement the following Figure 5 The steps in the method embodiment shown in FIG. Figure 7 The steps in the method embodiment shown. This terminal embodiment corresponds to the above-mentioned terminal side method embodiment, and each implementation process and implementation method of the above-mentioned method embodiment can be applied to this terminal embodiment and can achieve the same technical effect. Specifically, Fig.11 A schematic diagram of the hardware structure of a terminal for implementing an embodiment of the present application.

[0250] The terminal 1100 includes but is not limited to: a radio frequency unit 1101, a network module 1102, an audio output unit 1103, an input unit 1104, a sensor 1105, a display unit 1106, a user input unit 1107, an interface unit 1108, a memory 1109, and a processor 1110 and other components.

[0251] Those skilled in the art will appreciate that the terminal 1100 may also include a power source (such as a battery) for supplying power to each component, and the power source may be logically connected to the processor 1110 through a power management system, thereby implementing functions such as managing charging, discharging, and power consumption management through the power management system. Fig.11 The terminal structure shown in the figure does not constitute a limitation on the terminal. The terminal may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently, which will not be described in detail here.

[0252] It should be understood that in the embodiment of the present application, the input unit 1104 may include a graphics processor (Graphics Processing Unit, GPU) 11041 and a microphone 11042, and the graphics processor 11041 processes the image data of the static picture or video obtained by the image capture device (such as a camera) in the video capture mode or the image capture mode. The display unit 1106 may include a display panel 11061, and the display panel 11061 may be configured in the form of a liquid crystal display, an organic light emitting diode, etc. The user input unit 1107 includes a touch panel 11071 and at least one of other input devices 11072. The touch panel 11071 is also called a touch screen. The touch panel 11071 may include two parts: a touch detection device and a touch controller. Other input devices 11072 may include, but are not limited to, a physical keyboard, function keys (such as volume control keys, switch keys, etc.), a trackball, a mouse, and a joystick, which will not be repeated here.

[0253] In the embodiment of the present application, after receiving downlink data from the network side device, the RF unit 1101 can transmit the data to the processor 1111 for processing; the RF unit 1101 can send uplink data to the network side device. Generally, the RF unit 1101 includes but is not limited to an antenna, an amplifier, a transceiver, a coupler, a low noise amplifier, a duplexer, etc.

[0254] The memory 1109 can be used to store software programs or instructions and various data. The memory 1109 may mainly include a first storage area for storing programs or instructions and a second storage area for storing data, wherein the first storage area may store an operating system, an application program or instruction required for at least one function (such as a sound playback function, an image playback function, etc.), etc. In addition, the memory 1109 may include a volatile memory or a 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), a static random access memory (SRAM), a dynamic random access memory (DRAM), a synchronous dynamic random access memory (SDRAM), a double data rate synchronous dynamic random access memory (DDRSDRAM), an enhanced synchronous dynamic random access memory (ESDRAM), a synchronous link dynamic random access memory (SLDRAM) and a direct memory bus random access memory (DRRAM). The memory 1109 in the embodiment of the present application includes but is not limited to these and any other suitable types of memory.

[0255] The processor 1110 may include one or more processing units; optionally, the processor 1110 integrates an application processor and a modem processor, wherein the application processor mainly processes operations related to an operating system, a user interface, and application programs, and the modem processor mainly processes wireless communication signals, such as a baseband processor. It is understandable that the modem processor may not be integrated into the processor 1110.

[0256] The processor 1101 is used to perform the following operations:

[0257] Based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point in the plurality of candidate neighbor points, determine K first target neighbor points in the plurality of neighbor candidate points; the candidate neighbor points are at least some of the encoded points in the plurality of encoded points, the attribute distance is determined based on the attribute information of the point to be encoded and the attribute information of the candidate neighbor points, and K is a positive integer greater than or equal to 1;

[0258] Performing attribute prediction on the point to be encoded according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the point to be encoded;

[0259] The attribute residual of the point to be encoded is encoded to generate an encoding code stream corresponding to the point to be encoded; the attribute residual of the point to be encoded is determined based on the attribute prediction value of the point to be encoded and the original attribute value of the point to be encoded.

[0260] Alternatively, the processor 1101 is further configured to perform the following operations:

[0261] Parse the obtained encoded code stream to obtain the point to be decoded and multiple decoded points;

[0262] Based on the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point in the plurality of candidate neighbor points, K first target neighbor points among the plurality of neighbor candidate points are determined; the candidate neighbor points are at least some of the decoded points among the plurality of decoded points, the attribute distance is determined based on the attribute information of the point to be decoded and the attribute information of the candidate neighbor points, and K is a positive integer greater than or equal to 1;

[0263] Performing attribute prediction on the to-be-decoded point according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the to-be-decoded point;

[0264] The attribute reconstruction value of the point to be decoded is determined according to the attribute prediction value of the point to be decoded and the attribute residual of the point to be decoded; the attribute residual of the point to be decoded is obtained based on parsing the encoded bitstream.

[0265] The embodiment of the present application further provides a readable storage medium, on which a program or instruction is stored. When the program or instruction is executed by a processor, each process of the above-mentioned attribute encoding method embodiment or each process of the above-mentioned attribute decoding method embodiment is implemented, and the same technical effect can be achieved. To avoid repetition, it will not be repeated here.

[0266] The processor is the processor in the terminal described in the above embodiment. The readable storage medium includes a computer readable storage medium, such as a computer read-only memory ROM, a random access memory RAM, a magnetic disk or an optical disk. In some examples, the readable storage medium may be a non-transient readable storage medium.

[0267] An embodiment of the present application further provides a chip, which includes a processor and a communication interface, wherein the communication interface is coupled to the processor, and the processor is used to run a program or instruction to implement each process of the above-mentioned attribute encoding method embodiment, or to implement each process of the above-mentioned attribute decoding method embodiment, and can achieve the same technical effect. To avoid repetition, it will not be repeated here.

[0268] It should be understood that the chip mentioned in the embodiments of the present application can also be called a system-level chip, a system chip, a chip system or a system-on-chip chip, etc.

[0269] The embodiments of the present application further provide a computer program / program product, which is stored in a storage medium, and is executed by at least one processor to implement the various processes of the above-mentioned attribute encoding method embodiment, or to implement the various processes of the above-mentioned attribute decoding method embodiment, and can achieve the same technical effect. To avoid repetition, it will not be repeated here.

[0270] It should be noted that, in this article, the terms "comprise", "include" or any other variant thereof are intended to cover non-exclusive inclusion, so that the process, method, article or device including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise one..." do not exclude the presence of other identical elements in the process, method, article or device including the element. In addition, it should be pointed out that the scope of the methods and devices in the embodiments of the present application is not limited to performing functions in the order shown or discussed, and may also include performing functions in a substantially simultaneous manner or in reverse order according to the functions involved, for example, the described method may be performed in an order different from that described, and various steps may also be added, omitted, or combined. In addition, the features described with reference to certain examples may be combined in other examples.

[0271] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of a computer software product plus a necessary general hardware platform, and of course, can also be implemented by hardware. The computer software product is stored in a storage medium (such as ROM, RAM, disk, CD, etc.), including several instructions to enable a terminal or a network-side device to execute the methods described in each embodiment of the present application.

[0272] The embodiments of the present application are described above in conjunction with the accompanying drawings, but the present application is not limited to the above-mentioned specific implementation methods. The above-mentioned specific implementation methods are merely illustrative and not restrictive. Under the guidance of the present application, ordinary technicians in this field can also make many forms of implementation methods without departing from the purpose of the present application and the scope of protection of the claims, and these implementation methods are all within the protection of the present application.

Claims

1. An attribute encoding method, characterized in that: include: The encoder determines K first target neighbor points from among the multiple candidate neighbor points based on the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point from among the multiple candidate neighbor points; The candidate neighbor point is at least part of the encoded points among the multiple encoded points, the attribute distance is determined based on the attribute information of the point to be encoded and the attribute information of the candidate neighbor point, and K is a positive integer greater than or equal to 1; The encoder predicts the attribute of the point to be encoded according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the point to be encoded; The encoding end encodes the attribute residual of the to-be-encoded point to generate an encoding bitstream corresponding to the to-be-encoded point; The attribute residual of the point to be encoded is determined based on the attribute prediction value of the point to be encoded and the original attribute value of the point to be encoded.

2. The method according to claim 1, characterized in that The step of determining K first target neighbor points among the plurality of neighbor candidate points based on the geometric distance and the attribute distance between the point to be encoded and each of the plurality of candidate neighbor points comprises: The encoder calculates the geometric distance between the point to be encoded and each of the candidate neighbor points, and determines the attribute distance between the point to be encoded and each of the candidate neighbor points based on the attribute information of the point to be encoded and the attribute information of each of the candidate neighbor points; The encoder determines, according to the geometric distance and attribute distance between the point to be encoded and each of the candidate neighbor points, a target distance between the point to be encoded and each of the candidate neighbor points; The encoder determines, from among the plurality of candidate neighbor points, K candidate neighbor points with the smallest corresponding target distances as K first neighbor points; The encoding end updates the K first neighbor points according to the azimuth distribution relationship between the point to be encoded and each first neighbor point, and obtains the K first target neighbor points.

3. The method according to claim 2, characterized in that The determining the attribute distance between the point to be encoded and each candidate neighbor point based on the attribute information of the point to be encoded and the attribute information of each candidate neighbor point includes: The encoder calculates, for any first candidate neighbor point among the multiple candidate neighbor points, an attribute difference value between an attribute value of the point to be encoded and an attribute value of the first candidate neighbor point; the attribute value of the point to be encoded is determined based on attribute information of the point to be encoded, the attribute value of the first candidate neighbor point is determined based on attribute information of the first candidate neighbor point, and the attribute information of the point to be encoded and the attribute information of the first candidate neighbor point are of the same attribute type; The encoding end determines the product of the weight value corresponding to the first candidate neighbor point and the attribute difference value as the attribute distance between the point to be encoded and the first candidate neighbor point.

4. The method according to claim 2, characterized in that: The step of determining a target distance between the point to be encoded and each candidate neighbor point according to a geometric distance and an attribute distance between the point to be encoded and each candidate neighbor point comprises: The encoder determines, for any second candidate neighbor point among the plurality of candidate neighbor points, a sum of a first product corresponding to the second candidate neighbor point and a second product corresponding to the second candidate neighbor point as a target distance between the point to be encoded and the second candidate neighbor point; Among them, the first product is the product of the geometric distance weight value corresponding to the second candidate neighbor point and the geometric distance corresponding to the second candidate neighbor point, and the second product is the product of the attribute distance weight value corresponding to the second candidate neighbor point and the attribute distance corresponding to the second candidate neighbor point.

5. The method according to claim 2, characterized in that: The updating of the K first neighbor points according to the azimuth distribution relationship between the point to be encoded and each first neighbor point includes: When the orientation distribution relationship between the point to be encoded and any two first neighbor points is not relative, the encoding end updates the first neighbor points of the K first neighbor points that are farthest from the target distance between the point to be encoded as second target neighbor points of the N second neighbor points; The N second neighbor points are some of the neighbor points among the multiple candidate neighbor points except the K first neighbor points, the second target neighbor point is a second neighbor point among the N second neighbor points that meets the preset conditions, and N is a positive integer greater than or equal to 1; The preset conditions include: The target distance between the second neighbor point and the point to be encoded is less than or equal to a preset distance; and The orientation between the second neighbor point and the point to be encoded is relative to the orientation between any first neighbor point and the point to be encoded, and any first neighbor point is the first neighbor point among the K first neighbor points except the first neighbor point farthest from the target point to be encoded.

6. The method according to any one of claims 1 to 5, characterized in that Before determining K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be encoded and each of the multiple candidate neighbor points, the method further includes: The encoding end obtains point cloud data; the point cloud data includes a point to be encoded, a plurality of encoded points and an encoding identifier; The encoding end determines the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point when the attribute information of the multiple encoded points corresponds to different attribute types and the encoding identifier is used to represent the attribute encoding based on the attribute type performed on the point to be encoded.

7. A method for decoding an attribute, characterized in that: include: The decoding end parses the obtained coded bitstream to obtain a point to be decoded and multiple decoded points; The decoding end determines K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point among the multiple candidate neighbor points; The candidate neighbor point is at least part of the decoded points among the multiple decoded points, the attribute distance is determined based on the attribute information of the point to be decoded and the attribute information of the candidate neighbor point, and K is a positive integer greater than or equal to 1; The decoding end predicts the attribute of the to-be-decoded point according to the attribute value of each first target neighbor point to obtain the attribute prediction value of the to-be-decoded point; The decoding end determines the attribute reconstruction value of the point to be decoded according to the attribute prediction value of the point to be decoded and the attribute residual of the point to be decoded; the attribute residual of the point to be decoded is obtained based on parsing the encoded bitstream.

8. The method according to claim 7, characterized in that The step of determining K first target neighbor points among the plurality of neighbor candidate points based on the geometric distance and the attribute distance between the point to be decoded and each of the plurality of neighbor candidate points comprises: The decoding end calculates the geometric distance between the point to be decoded and each of the candidate neighbor points, and determines the attribute distance between the point to be decoded and each of the candidate neighbor points based on the attribute information of the point to be decoded and the attribute information of each of the candidate neighbor points; The decoding end determines a target distance between the point to be decoded and each of the candidate neighbor points according to a geometric distance and an attribute distance between the point to be decoded and each of the candidate neighbor points; The decoding end determines K candidate neighbor points with the smallest corresponding target distances among the multiple candidate neighbor points as K first neighbor points; The decoding end updates the K first neighbor points according to the azimuth distribution relationship between the point to be decoded and each first neighbor point, and obtains the K first target neighbor points.

9. The method according to claim 8, characterized in that The determining the attribute distance between the point to be decoded and each candidate neighbor point based on the attribute information of the point to be decoded and the attribute information of each candidate neighbor point includes: The decoding end calculates, for any first candidate neighbor point among the multiple candidate neighbor points, an attribute difference value between an attribute value of the point to be decoded and an attribute value of the first candidate neighbor point; the attribute value of the point to be decoded is determined based on attribute information of the point to be decoded, the attribute value of the first candidate neighbor point is determined based on attribute information of the first candidate neighbor point, and the attribute information of the point to be decoded and the attribute information of the first candidate neighbor point are of the same attribute type; The decoding end determines the product of the weight value corresponding to the first candidate neighbor point and the attribute difference value as the attribute distance between the point to be decoded and the first candidate neighbor point.

10. The method according to claim 8, characterized in that The step of determining a target distance between the point to be decoded and each candidate neighbor point according to a geometric distance and an attribute distance between the point to be decoded and each candidate neighbor point comprises: The decoding end determines, for any second candidate neighbor point among the plurality of candidate neighbor points, a sum of a first product corresponding to the second candidate neighbor point and a second product corresponding to the second candidate neighbor point as a target distance between the point to be decoded and the second candidate neighbor point; Among them, the first product is the product of the geometric distance weight value corresponding to the second candidate neighbor point and the geometric distance corresponding to the second candidate neighbor point, and the second product is the product of the attribute distance weight value corresponding to the second candidate neighbor point and the attribute distance corresponding to the second candidate neighbor point.

11. The method according to claim 8, characterized in that The updating of the K first neighbor points according to the azimuth distribution relationship between the point to be decoded and each first neighbor point includes: The decoding end updates the first neighbor points of the K first neighbor points that are farthest from the target distance between the point to be decoded as second target neighbor points of the N second neighbor points when the azimuth distribution relationship between the point to be decoded and any two first neighbor points is not relative to each other; The N second neighbor points are some of the neighbor points among the multiple candidate neighbor points except the K first neighbor points, the second target neighbor point is the second neighbor point among the N second neighbor points that meets the preset conditions and has the smallest corresponding target distance, and N is a positive integer greater than or equal to 1; The preset conditions include: The target distance between the second neighbor point and the point to be decoded is less than or equal to a preset distance; and The orientation between the second neighbor point and the point to be decoded is relative to the orientation between any first neighbor point and the point to be decoded, and any first neighbor point is the first neighbor point among the K first neighbor points except the first neighbor point farthest from the target point to be decoded.

12. The method according to any one of claims 7 to 11, characterized in that: The encoded code stream includes a decoding identifier. Before determining K first target neighbor points among the multiple neighbor candidate points based on the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point among the multiple candidate neighbor points, the method further includes: The decoding end determines the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point when the attribute information of the multiple decoded points corresponds to different attribute types and the decoding identifier is used to represent that attribute decoding based on the attribute type is performed on the point to be decoded.

13. An attribute encoding device, characterized in that: include: A first determination module, configured to determine K first target neighbor points among the plurality of neighbor candidate points based on a geometric distance and an attribute distance between the point to be encoded and each of the plurality of neighbor candidate points; The candidate neighbor point is at least part of the encoded points among the multiple encoded points, the attribute distance is determined based on the attribute information of the point to be encoded and the attribute information of the candidate neighbor point, and K is a positive integer greater than or equal to 1; A prediction module, used to predict the attribute of the point to be encoded according to the attribute value of each first target neighbor point, and obtain the attribute prediction value of the point to be encoded; A generating module, used for encoding the attribute residual of the to-be-encoded point to generate an encoding stream corresponding to the to-be-encoded point; The attribute residual of the point to be encoded is determined based on the attribute prediction value of the point to be encoded and the original attribute value of the point to be encoded.

14. The device according to claim 13, characterized in that The first determining module is specifically configured to: Calculating the geometric distance between the point to be encoded and each of the candidate neighbor points, and determining the attribute distance between the point to be encoded and each of the candidate neighbor points based on the attribute information of the point to be encoded and the attribute information of each of the candidate neighbor points; Determine a target distance between the point to be encoded and each of the candidate neighbor points according to a geometric distance and an attribute distance between the point to be encoded and each of the candidate neighbor points; Determine K candidate neighbor points with the shortest corresponding target distances among the multiple candidate neighbor points as K first neighbor points; According to the azimuth distribution relationship between the point to be encoded and each first neighbor point, the K first neighbor points are updated to obtain the K first target neighbor points.

15. The device according to claim 14, characterized in that The first determining module is further specifically configured to: For any first candidate neighbor point among the multiple candidate neighbor points, calculating an attribute difference value between the attribute value of the point to be encoded and the attribute value of the first candidate neighbor point; The attribute value of the to-be-encoded point is determined based on the attribute information of the to-be-encoded point, the attribute value of the first candidate neighbor point is determined based on the attribute information of the first candidate neighbor point, and the attribute information of the to-be-encoded point and the attribute information of the first candidate neighbor point are of the same attribute type; The product of the weight value corresponding to the first candidate neighbor point and the attribute difference value is determined as the attribute distance between the point to be encoded and the first candidate neighbor point.

16. The device according to claim 14, characterized in that The first determining module is further specifically configured to: For any second candidate neighbor point among the multiple candidate neighbor points, determine the sum of the first product corresponding to the second candidate neighbor point and the second product corresponding to the second candidate neighbor point as the target distance between the point to be encoded and the second candidate neighbor point; Among them, the first product is the product of the geometric distance weight value corresponding to the second candidate neighbor point and the geometric distance corresponding to the second candidate neighbor point, and the second product is the product of the attribute distance weight value corresponding to the second candidate neighbor point and the attribute distance corresponding to the second candidate neighbor point.

17. The device according to claim 14, characterized in that The first determining module is further specifically configured to: When the azimuth distribution relationship between the point to be encoded and any two first neighbor points is not relative, the first neighbor points of the K first neighbor points that are farthest from the target distance between the point to be encoded are updated as second target neighbor points of the N second neighbor points; The N second neighbor points are some of the neighbor points among the multiple candidate neighbor points except the K first neighbor points, the second target neighbor point is a second neighbor point among the N second neighbor points that meets the preset conditions, and N is a positive integer greater than or equal to 1; The preset conditions include: The target distance between the second neighbor point and the point to be encoded is less than or equal to a preset distance; and The orientation between the second neighbor point and the point to be encoded is relative to the orientation between any first neighbor point and the point to be encoded, and any first neighbor point is the first neighbor point among the K first neighbor points except the first neighbor point farthest from the target point to be encoded.

18. The device according to any one of claims 13 to 17, characterized in that The device also includes: An acquisition module, used to acquire point cloud data; the point cloud data includes a point to be encoded, a plurality of encoded points and a coding identifier; The second determination module is used to determine the geometric distance and attribute distance between the point to be encoded and each candidate neighbor point when the attribute information of the multiple encoded points corresponds to different attribute types and the encoding identifier is used to represent the attribute encoding based on the attribute type performed on the point to be encoded.

19. An attribute decoding device, characterized in that: include: A parsing module is used to parse the acquired coded bitstream to obtain a point to be decoded and multiple decoded points; A first determination module, configured to determine K first target neighbor points among the plurality of neighbor candidate points based on a geometric distance and an attribute distance between the point to be decoded and each of the plurality of neighbor candidate points; The candidate neighbor point is at least part of the decoded points among the multiple decoded points, the attribute distance is determined based on the attribute information of the point to be decoded and the attribute information of the candidate neighbor point, and K is a positive integer greater than or equal to 1; A prediction module, used to predict the attribute of the to-be-decoded point according to the attribute value of each first target neighbor point, and obtain the attribute prediction value of the to-be-decoded point; The second determination module is used to determine the attribute reconstruction value of the point to be decoded according to the attribute prediction value of the point to be decoded and the attribute residual of the point to be decoded; the attribute residual of the point to be decoded is obtained by parsing the encoded bitstream.

20. The device according to claim 19, characterized in that The first determining module is specifically configured to: Calculating the geometric distance between the point to be decoded and each of the candidate neighbor points, and determining the attribute distance between the point to be decoded and each of the candidate neighbor points based on the attribute information of the point to be decoded and the attribute information of each of the candidate neighbor points; Determine a target distance between the point to be decoded and each of the candidate neighbor points according to a geometric distance and an attribute distance between the point to be decoded and each of the candidate neighbor points; Determine K candidate neighbor points with the smallest corresponding target distances among the multiple candidate neighbor points as K first neighbor points; According to the azimuth distribution relationship between the point to be decoded and each first neighbor point, the K first neighbor points are updated to obtain the K first target neighbor points.

21. The device according to claim 20, characterized in that The first determining module is further specifically configured to: For any first candidate neighbor point among the plurality of candidate neighbor points, calculating an attribute difference value between an attribute value of the point to be decoded and an attribute value of the first candidate neighbor point; The attribute value of the to-be-decoded point is determined based on the attribute information of the to-be-decoded point, the attribute value of the first candidate neighbor point is determined based on the attribute information of the first candidate neighbor point, and the attribute information of the to-be-decoded point and the attribute information of the first candidate neighbor point are of the same attribute type; The product of the weight value corresponding to the first candidate neighbor point and the attribute difference value is determined as the attribute distance between the point to be decoded and the first candidate neighbor point.

22. The device according to claim 20, characterized in that The first determining module is further specifically configured to: For any second candidate neighbor point among the multiple candidate neighbor points, determine the sum of the first product corresponding to the second candidate neighbor point and the second product corresponding to the second candidate neighbor point as the target distance between the point to be decoded and the second candidate neighbor point; Among them, the first product is the product of the geometric distance weight value corresponding to the second candidate neighbor point and the geometric distance corresponding to the second candidate neighbor point, and the second product is the product of the attribute distance weight value corresponding to the second candidate neighbor point and the attribute distance corresponding to the second candidate neighbor point.

23. The device according to claim 20, characterized in that The first determining module is further specifically configured to: When the azimuth distribution relationship between the to-be-decoded point and any two first neighbor points is not relative, the first neighbor points of the K first neighbor points that are farthest from the target distance between the to-be-decoded point and the first neighbor points are updated as second target neighbor points of the N second neighbor points; The N second neighbor points are some of the neighbor points among the multiple candidate neighbor points except the K first neighbor points, the second target neighbor point is the second neighbor point among the N second neighbor points that meets the preset conditions and has the smallest corresponding target distance, and N is a positive integer greater than or equal to 1; The preset conditions include: The target distance between the second neighbor point and the point to be decoded is less than or equal to a preset distance; and The orientation between the second neighbor point and the point to be decoded is relative to the orientation between any first neighbor point and the point to be decoded, and any first neighbor point is the first neighbor point among the K first neighbor points except the first neighbor point farthest from the target point to be decoded.

24. The device according to any one of claims 19 to 23, characterized in that The device also includes: The third determination module is used to determine the geometric distance and attribute distance between the point to be decoded and each candidate neighbor point when the attribute information of the multiple decoded points corresponds to different attribute types and the decoding identifier is used to represent the attribute decoding based on the attribute type performed on the point to be decoded.

25. An electronic device, characterized in that: The method comprises a processor and a memory, wherein the memory stores a program or instruction that can be run on the processor, and when the program or instruction is executed by the processor, the attribute encoding step according to any one of claims 1 to 6 is implemented, or the attribute decoding step according to any one of claims 7 to 12 is implemented.

26. A readable storage medium, characterized in that: The readable storage medium stores a program or an instruction, and when the program or the instruction is executed by a processor, the attribute encoding step according to any one of claims 1 to 6 is implemented, or the attribute decoding step according to any one of claims 7 to 12 is implemented.

Citation Information

Patent Citations

  • Neighbor weight-based parameter selection and transmission point cloud attribute encoding and decoding method and equipment

    CN110572655A

  • Coding method and decoding method of point cloud attribute information, storage medium and terminal equipment

    CN111405281A

  • Point cloud data processing method and device, storage medium and encoding and decoding equipment

    CN115086658A

  • Prediction coding and decoding method and device for point cloud attribute information

    CN115412715A

  • Point cloud prediction method and device, point cloud coding method and device and point cloud decoding method and device

    CN115720272A

Cited By

  • Attribute encoding method, attribute decoding method, and electronic device

    EP4746405A1