[go: up one dir, main page]

WO2025039122A1 - Procédé de codage de nuage de points, procédé de décodage de nuage de points, flux de code, codeur, décodeur et support de stockage - Google Patents

Procédé de codage de nuage de points, procédé de décodage de nuage de points, flux de code, codeur, décodeur et support de stockage Download PDF

Info

Publication number
WO2025039122A1
WO2025039122A1 PCT/CN2023/113835 CN2023113835W WO2025039122A1 WO 2025039122 A1 WO2025039122 A1 WO 2025039122A1 CN 2023113835 W CN2023113835 W CN 2023113835W WO 2025039122 A1 WO2025039122 A1 WO 2025039122A1
Authority
WO
WIPO (PCT)
Prior art keywords
identification information
current macroblock
state
coding
decoding
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
PCT/CN2023/113835
Other languages
English (en)
Chinese (zh)
Inventor
孙泽星
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong Oppo Mobile Telecommunications Corp Ltd
Original Assignee
Guangdong Oppo Mobile Telecommunications Corp Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guangdong Oppo Mobile Telecommunications Corp Ltd filed Critical Guangdong Oppo Mobile Telecommunications Corp Ltd
Priority to PCT/CN2023/113835 priority Critical patent/WO2025039122A1/fr
Publication of WO2025039122A1 publication Critical patent/WO2025039122A1/fr
Pending legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/597Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding specially adapted for multi-view video sequence encoding

Definitions

  • the reference nodes selected by each child node are shown in Figure 3.
  • the dotted box node is the current node
  • the gray node is the current child node to be encoded
  • the solid-line frame nodes are the reference nodes selected by each child node.
  • the distance has 3 values.
  • This method uses a two-layer context reference relationship configuration, as shown in formula (1).
  • the first layer is the occupancy of the encoded adjacent blocks of the parent node of the current sub-block to be encoded (i.e., ctxIdxParent), and the second layer is the occupancy of the encoded adjacent blocks at the same depth as the current sub-block to be encoded (i.e., ctxIdxChild).
  • idx LUT[ctxIdxParent][ctxIdxChild] (1)
  • each sub-block and the adjacent parent block is obtained by the method of Table 1.
  • the numbers in Table 2 correspond to the Morton sequence in Figure 6.
  • This method takes into account the different sub-block positions and the geometric center rotation symmetry. As can be seen from Figure 6, with the current block as the center, this method has a larger receptive field and can use up to 18 adjacent parent blocks that have been encoded around it.
  • the method used in formula (3) is the combination of the occupancy of the three coplanar parent blocks and the sum of the occupancy of the three colinear parent blocks.
  • Fig. 7 is a schematic diagram of a simplified prediction tree structure. As shown in Fig. 7, the prediction tree adopts a single chain structure, and each tree node has only one child node except for the only leaf node. Except for the root node predicted by the default value, other nodes are provided with geometric prediction values by their parent nodes.
  • a flag is introduced to indicate whether the current node uses the isolated point direct coding mode.
  • the flag uses a context for entropy coding. If the flag is true (True), the isolated point mode is used to directly encode the geometric coordinates of the point, and the octree division is terminated. If the flag is false (False), the occupancy code is encoded and the octree division continues.
  • attribute encoding is mainly performed on color and reflectivity information. First, it is determined whether to perform color space conversion. If color space conversion is performed, the color information is converted from RGB color space to YUV color space. Then, the reconstructed point cloud is recolored using the original point cloud so that the unencoded attribute information corresponds to the reconstructed geometric information.
  • color information encoding it is divided into two modules: attribute prediction and attribute transformation.
  • the attribute prediction process is as follows: first, reorder the point cloud, and then perform differential prediction. There are two reordering methods: Morton reordering and Hilbert reordering.
  • the attribute transformation process is as follows: first, wavelet transform is performed on the point cloud attributes, and the transform coefficients are quantized; secondly, the attribute reconstruction value is obtained by inverse quantization and inverse wavelet transform; then the difference between the original attribute and the attribute reconstruction value is calculated to obtain the attribute residual and quantize it; finally, the quantized transform coefficients and attribute residuals are entropy encoded to generate a binary code stream (specifically, the attribute code stream).
  • FIG8B is a schematic diagram of an AVS decoder framework.
  • the geometric code stream and the attribute code stream in the binary code stream are decoded independently.
  • Entropy decoding-octree reconstruction-inverse coordinate quantization and inverse coordinate translation to obtain the geometric position of the point cloud.
  • the attribute information of the point cloud is obtained through entropy decoding-inverse quantization-attribute prediction compensation-inverse space transformation; or through entropy decoding-inverse quantization-attribute inverse transformation-inverse space transformation to obtain the attribute information of the point cloud.
  • the slice to be encoded can be restored; then after merging the slices, the three-dimensional image model of the input point cloud can be restored.
  • FIG9 is a schematic diagram of a network architecture of point cloud encoding and decoding.
  • the network architecture includes one or more electronic devices 13 to 1N and a communication network 01, wherein the electronic devices 13 to 1N can perform video interaction through the communication network 01.
  • the electronic device can be various types of devices with point cloud encoding and decoding functions.
  • the electronic device can include a mobile phone, a tablet computer, a personal computer, a personal digital assistant, a navigator, a digital phone, a video phone, a television, a sensor device, a server, etc., which is not limited by the embodiment of the present application.
  • the decoder or encoder in the embodiment of the present application can be the above-mentioned electronic device. That is to say, the electronic device in the embodiment of the present application has the point cloud encoding and decoding function, generally including a point cloud encoder (ie, encoder) and a point cloud decoder (ie, decoder).
  • the electronic device in the embodiment of the present application has the point cloud encoding and decoding function, generally including a point cloud encoder (ie, encoder) and a point cloud decoder (ie, decoder).
  • Condition 1 The geometric position is limitedly lossy and the attributes are lossy;
  • Condition 3 The geometric position is lossless, and the attributes are limitedly lossy
  • Condition 4 The geometric position and attributes are lossless.
  • the general test sequence includes five categories: Cat1A, Cat1B, Cat1C, Cat2-frame and Cat3. Among them, Cat1A and Cat2-frame point clouds only contain reflectance attribute information, Cat1B and Cat3 point clouds only contain color attribute information, and Cat1C point cloud contains both color and reflectance attribute information.
  • the points in the point cloud are processed in a certain order (the original acquisition order of the point cloud, the Morton order, the Hilbert order, etc.), and the prediction algorithm is first used to obtain the attribute prediction value, and the attribute residual is obtained according to the attribute value and the attribute prediction value. Then, the attribute residual is quantized to generate a quantized residual, and finally the quantized residual is encoded;
  • the points in the point cloud are processed in a certain order (the original acquisition order of the point cloud, Morton order, Hilbert order, etc.).
  • the prediction algorithm is first used to obtain the attribute prediction value, and then the decoding is performed to obtain the quantized residual.
  • the quantized residual is then dequantized, and finally the attribute reconstruction value is obtained based on the attribute prediction value and the dequantized residual.
  • Prediction transform branch - limited resources attribute compression uses a method based on intra-frame prediction and discrete cosine transform (DCT).
  • DCT discrete cosine transform
  • the points in the point cloud are processed in a certain order (the original acquisition order of the point cloud, the Morton order, the Hilbert order, etc.), and the entire point cloud is first divided into several small groups with a maximum length of Y (such as 2), and then these small groups are combined into several large groups (the number of points in each large group does not exceed X, such as 4096), and then the prediction algorithm is used to obtain the attribute prediction value, and the attribute residual is obtained according to the attribute value and the attribute prediction value.
  • the attribute residual is transformed by DCT in small groups to generate transformation coefficients, and then the transformation coefficients are quantized to generate quantized transformation coefficients, and finally the quantized transformation coefficients are encoded in large groups;
  • the points in the point cloud are processed in a certain order (the original acquisition order of the point cloud, Morton order, Hilbert order, etc.).
  • the entire point cloud is divided into several small groups with a maximum length of Y (such as 2), and then these small groups are combined into several large groups (the number of points in each large group does not exceed X, such as 4096).
  • the quantized transform coefficients are decoded in large groups, and then the prediction algorithm is used to obtain the attribute prediction value.
  • the quantized transform coefficients are dequantized and inversely transformed in small groups.
  • the attribute reconstruction value is obtained based on the attribute prediction value and the dequantized and inversely transformed coefficients.
  • Prediction transform branch - resources are not limited. Attribute compression adopts a method based on intra-frame prediction and DCT transform. When encoding the quantized transform coefficients, there is no limit on the maximum number of points X, that is, all coefficients are encoded together:
  • the points in the point cloud are processed in a certain order (the original acquisition order of the point cloud, the Morton order, the Hilbert order, etc.).
  • the entire point cloud is divided into several small groups with a maximum length of Y (such as 2).
  • the prediction algorithm is used to obtain the attribute prediction value.
  • the attribute residual is obtained according to the attribute value and the attribute prediction value.
  • the attribute residual is subjected to DCT transformation in groups to generate transformation coefficients.
  • the transformation coefficients are then quantized to generate quantized transformation coefficients.
  • the quantized transformation coefficients of the entire point cloud are encoded.
  • the point cloud is processed in a certain order (the original acquisition order of the point cloud, Morton order, Hilbert order, etc.).
  • a certain order the original acquisition order of the point cloud, Morton order, Hilbert order, etc.
  • Y such as 2
  • the entire point cloud is subjected to multi-layer wavelet transform to generate transform coefficients, which are then quantized to generate quantized transform coefficients, and finally the quantized transform coefficients of the entire point cloud are encoded;
  • decoding obtains the quantized transform coefficients of the entire point cloud, and then dequantizes and inversely transforms the quantized transform coefficients to obtain attribute reconstruction values.
  • AVS-PCC when AVS-PCC encodes the geometric information of the point cloud, it uses gps_save_state_flag to control whether to save the context of entropy coding and the hash table information of geometric coding (storing neighbor occupancy information); since the current point cloud coding is based on the geometric macroblock of the largest coding unit (LCU), that is, firstly, the point cloud slice is spatially divided to obtain different geometric macroblocks, and then each geometric macroblock is adaptively encoded. Therefore, the current AVS-PCC stipulates that when encoding each macroblock, when gps_save_state_flag is 1, the stored coding context and the hash table information of geometric coding are restored.
  • LCU largest coding unit
  • gps_save_state_flag When gps_save_state_flag is 1, the stored coding context and the hash table information of the geometry coding can be restored. In this case, the parameter of gps_lcu_dependency_flag can be used to determine whether each geometry macroblock needs to be interdependent or independent.
  • the hash information needs to indicate whether it is the hash information of each layer in the geometric macroblock or the hash information of the leaf node layer in the geometric macroblock.
  • the current AVS-PCC does not explain and indicate the specific parameters of the hash information, which greatly increases the complexity of the encoding and decoding process.
  • the embodiment of the present application provides a point cloud encoding and decoding method
  • the decoder decodes the code stream, determines the geometric encoding and decoding state storage identification information
  • the geometric encoding state storage identification information indicates the storage encoding and decoding state
  • decodes the code stream determines the encoding and decoding state corresponding to the current macroblock depends on the identification information and the identification information of the hash information
  • the encoding and decoding state depends on the identification information indicating that the current macroblock is not independently encoded and decoded, after completing the decoding process of the current macroblock, stores the hash table information corresponding to the current macroblock according to the identification information of the hash information.
  • the encoder determines the geometric encoding and decoding state storage identification information, and writes the geometric encoding and decoding state storage identification information into the code stream; when the geometric encoding state storage identification information indicates the storage encoding and decoding state, determines the encoding and decoding state corresponding to the current macroblock depends on the identification information and the identification information of the hash information, and writes the encoding and decoding state corresponding to the current macroblock depends on the identification information and the identification information of the hash information into the code stream; when the encoding and decoding state depends on the identification information indicating that the current macroblock is not independently encoded and decoded, after completing the encoding process of the current macroblock, stores the hash table information corresponding to the current macroblock according to the identification information of the hash information.
  • the codec can choose to determine the coding and decoding state of the geometric macroblock only when the geometric coding state storage identification information indicates the storage of the coding and decoding state, thereby overcoming the defect of redundant grammatical elements and improving the coding and decoding efficiency; on the other hand, the codec can use the identification information of the hash information of the geometric macroblock to describe and indicate the hash table information that needs to be stored, thereby reducing the complexity of coding and decoding, ensuring the consistency of coding and decoding, and thus improving the accuracy of coding and decoding.
  • FIG. 10 a flowchart of a decoding method provided in an embodiment of the present application is shown.
  • the method for the decoder to perform point cloud decoding may include the following steps:
  • Step 101 Decode the code stream and determine the geometric coding state storage identification information.
  • the code stream may be decoded first to determine the geometric codec state storage identification information, wherein the geometric codec state storage identification information may be used to determine whether to store the codec state.
  • the decoding method of the embodiment of the present application is applied to a point cloud decoder (hereinafter referred to as a "decoder" for short).
  • the method may refer to a point cloud decoding method, specifically a point cloud geometric information decoding method.
  • the decoding method proposed in the embodiment of the present application can be applied to the AVS-PCC decoding framework, or called the AVS-GPCC decoding framework.
  • the geometric coding and decoding state storage identification information may be a syntax element corresponding to the sequence level.
  • the geometry codec state storage identification information may be represented by a syntax element gps_save_state_flag, wherein the geometry codec state storage identification information gps_save_state_flag may indicate whether to store the codec state in the codec process.
  • the geometric coding state storage identification information may be a global control parameter, which may control the sequence level, frame level, slice level, LCU level, etc.
  • the geometric coding state storage identification information can be determined, and then whether to store the coding state during the coding and decoding process can be determined based on the value of the geometric coding state storage identification information.
  • the process of determining whether to store the coding and decoding state according to the value of the geometric coding and decoding state storage identification information when the value of the geometric coding state storage identification information is a first value, it can be determined that the geometric coding state storage identification information indicates that the coding and decoding state is stored; when the value of the geometric coding state storage identification information is a second value, it can be determined that the geometric coding state storage identification information indicates that the coding and decoding state is not stored.
  • the decoded code stream determines the syntax element gps_save_state_flag representing the geometric codec state storage identification information, wherein gps_save_state_flag is a binary variable, and when the value of gps_save_state_flag is a first value, it is determined to store the codec state, and when the value of gps_save_state_flag is a second value, it is determined not to store the codec state.
  • the first value is different from the second value, and the first value and the second value can be in parameter form or in digital form.
  • the first prediction mode identification information and the second prediction mode identification information can be parameters written in the profile, or can be the value of a flag, which is not specifically limited here.
  • the first value can be set to 1 and the second value can be set to 0; or, the first value can be set to 0 and the second value can be set to 1; or, the first value can be set to true and the second value can be set to false; or, the first value can be set to false and the second value can be set to true.
  • the first value is set to 1 and the second value is set to 0, but it is not specifically limited.
  • the geometric coding state storage identification information can be determined first.
  • the decoder may perform decoding processing based on the geometric macroblocks of the largest coding unit LCU.
  • the point cloud to be processed may be spatially divided first, at least one geometric macroblock may be determined, and then the at least one geometric macroblock may be coded and decoded.
  • a point cloud slice may be spatially divided first to obtain different geometric macroblocks, and then each geometric macroblock may be adaptively coded.
  • the at least one divided geometric macroblock may include the current macroblock being encoded and decoded, and may also include the previous macroblock that has completed encoding and decoding, and the next macroblock to be encoded and decoded.
  • the encoding and decoding state in the encoding and decoding process may at least include a context state and hash table information, wherein the context state may be used to determine the context, and the hash table information may be used to determine the neighbor placeholder information.
  • Step 102 When the geometric coding state storage identification information indicates that the coding state is stored, decode the code stream to determine the coding state corresponding to the current macroblock, which depends on the identification information and the hash information.
  • the bitstream after decoding the bitstream and determining the geometric coding state storage identification information, if the geometric coding state storage identification information indicates the storage coding and decoding state, then the bitstream can be decoded to further determine the identification information of the coding and decoding state corresponding to the current macroblock depending on the identification information and the hash information.
  • the geometric coding state storage identification information indicates the storage of the coding and decoding state
  • the coding and decoding state such as the context state and the hash table information in the coding and decoding process is allowed to be stored.
  • the coding and decoding processing of the macroblock can be entered.
  • the coding and decoding state corresponding to the current macroblock can be determined first.
  • Dependency identification information from Based on the codec state dependency identification information, it is determined whether the current macroblock allows independent coding and decoding.
  • the coding and decoding state dependency identification information may be a syntax element corresponding to the LCU level.
  • the codec state dependency identification information may be represented by a syntax element gps_lcu_dependency_flag, wherein the codec state dependency identification information gps_lcu_dependency_flag may indicate whether the current macroblock depends on other macroblocks, that is, whether the current macroblock allows independent coding and decoding.
  • the codec state dependency identification information corresponding to the current macroblock can be determined, and then whether the current macroblock is allowed to be independently encoded and decoded during the encoding and decoding process of the current macroblock can be determined based on the value of the codec state dependency identification information.
  • the decoded code stream determines the syntax element gps_lcu_dependency_flag representing the codec state dependency identification information, wherein gps_lcu_dependency_flag is a binary variable, and when the value of gps_lcu_dependency_flag is the third value, it is determined that the current macroblock is independently coded and decoded, and when the value of gps_lcu_dependency_flag is the fourth value, it is determined that the current macroblock is not independently coded and decoded.
  • the third value is different from the fourth value, and the third value and the fourth value can be in parameter form or in digital form.
  • the first prediction mode identification information and the second prediction mode identification information can be parameters written in the profile, or can be the value of a flag, which is not specifically limited here.
  • the third value can be set to 1 and the fourth value can be set to 0; or, the third value can be set to 0 and the fourth value can be set to 1; or, the third value can be set to true and the fourth value can be set to false; or, the third value can be set to false and the fourth value can be set to true.
  • the third value is set to 1 and the fourth value is set to 0, but it is not specifically limited.
  • the identification information of the hash information can be used to indicate and explain the hash information to be stored corresponding to the current macroblock, and the reference of the stored hash information in the next macroblock.
  • the identification information of the hash information of the current macroblock includes the first identification information and/or the second identification information.
  • the first identification information can be used to indicate and explain the hash information to be stored corresponding to the current macroblock; the second identification information can be used to indicate and explain the reference of the stored hash information corresponding to the current macroblock in the next macroblock.
  • the first identification information may be used to indicate hash information of the i-th layer to the j-th layer of the octree to be stored corresponding to the current macroblock; wherein i and j are both greater than or equal to 0.
  • the second identification information is used to indicate the mth to nth layers of the octree to be applied corresponding to the next macroblock; wherein m and n are both greater than or equal to 0.
  • m and n can be any integer greater than or equal to 0, and m and n can be the same or different.
  • the identification information of the hash information corresponding to the current macroblock can determine which layer or layers of the octree of the current macroblock to store the hash information of the current macroblock in the process of storing the hash table information of the current macroblock, instead of simply and directly storing the hash information of all layers or the last layer of the octree of the current macroblock. In comparison, the complexity of the encoding and decoding process can be effectively reduced.
  • the identification information of the hash information corresponding to the current macroblock can determine, in the process of storing the hash table information of the current macroblock, to which layer or layers of the hash information of the octree of the next macroblock the stored hash table information of the current macroblock will be applied.
  • the complexity of the encoding and decoding process is further reduced, while ensuring the consistency of encoding and decoding, thereby effectively improving the accuracy of encoding and decoding.
  • the process of determining the codec state dependent identification information and the identification information of the hash information of the current macroblock it is possible to simultaneously determine the codec state dependent identification information and the identification information of the hash information of the current macroblock, or it is possible to first determine the codec state dependent identification information of the current macroblock, and then select whether to determine the identification information of the hash information of the current macroblock according to the codec state dependent identification information of the current macroblock.
  • the identification information of the hash information of the current macroblock may depend on the codec state-dependent identification information of the current macroblock, or may not depend on the codec state-dependent identification information of the current macroblock.
  • the decoding bitstream when the geometric coding state storage identification information indicates that the codec state is stored, the decoding bitstream can first determine the codec state dependency identification information corresponding to the current macroblock; then, when the codec state dependency identification information indicates that the current macroblock is not independently encoded and decoded, the decoding bitstream can determine the identification information of the hash information corresponding to the current macroblock.
  • the decoding code stream can first determine the codec state dependency identification information corresponding to the current macroblock; then, when the codec state dependency identification information indicates that the current macroblock is independently encoded and decoded, the identification information determination process of the hash information corresponding to the current macroblock will no longer be executed.
  • the identification information of the hash information of the current macroblock depends on the corresponding codec state dependency identification information, then when it is determined based on the codec state dependency identification information that the current macroblock does not depend on other macroblocks and is independently encoded and decoded, it is no longer necessary to store the hash table information, and therefore there is no need to determine the hash information of the current block.
  • the codec state dependency identification information indicates that the current macroblock is not independently encoded and decoded
  • the hash table information corresponding to the current macroblock can be further stored.
  • the hash table information based on the identification information of the hash information corresponding to the current macroblock, it can be determined which layer or layers of the octree of the current macroblock are to be stored, and it can also be determined which layer or layers of the hash information of the next macroblock the stored hash table information is to be applied to.
  • the first identification information in the identification information of the hash information of the current macroblock can be used to indicate the hash information of the i-th layer to the j-th layer of the octree corresponding to the current macroblock to be stored. Therefore, after the decoding process of the current macroblock is completed, based on the first identification information, the hash information of the i-th layer to the j-th layer of the octree corresponding to the current macroblock can be selected to be stored.
  • the second identification information in the identification information of the hash information of the current macroblock is used to indicate the hash information of the mth to nth layers of the octree to be applied corresponding to the next macroblock, after the decoding process of the current macroblock is completed, the second identification information can be selected to be passed to the next macroblock.
  • the geometric coding state storage identification information indicates the storage coding and decoding state
  • the coding and decoding state dependency identification information corresponding to the current macroblock indicates that the current macroblock is not independently coded and decoded
  • the second identification information for indicating the mth to nth layers of the octree to be applied corresponding to the next macroblock can be passed to the next macroblock.
  • the hash information of the mth to nth layers of the octree corresponding to the next macroblock can be initialized according to the stored hash information corresponding to the current macroblock.
  • m and n can be any integer greater than or equal to 0, and m and n can be the same or different.
  • the codec state dependency identification information corresponding to the current macroblock indicates that the current macroblock is not independently coded and decoded
  • the codec state dependency identification information corresponding to the next macroblock indicates that the next macroblock is not independently coded and decoded
  • the hash information of the i-th to j-th layers of the octree corresponding to the current macroblock can be selected to be stored, and the second identification information indicating the m-th to n-th layers of the octree to be applied corresponding to the next macroblock can be passed to the next macroblock, so that when encoding and decoding the next macroblock, the hash information of the i-th to j-th layers of the octree corresponding to the current macroblock that has been stored can be used to initialize the hash information of the m-th to n-th layers of the octre
  • the codec state dependency identification information corresponding to the current macroblock indicates that the current macroblock is not independently coded and decoded
  • the codec state dependency identification information corresponding to the last coded and decoded macroblock indicates that the last macroblock is not independently coded and decoded
  • the hash information of the i-th to j-th layers of the octree corresponding to the previous macroblock is stored, and the second identification information corresponding to the previous macroblock, indicating the m-th to n-th layers of the octree to be applied corresponding to the current macroblock, is passed to the current macroblock, so that when encoding and decoding the current macroblock, the hash information of the i-th to j-th layers of the octree corresponding to the previous macroblock that has been stored can be used to initialize
  • FIG. 11 is a second schematic diagram of the implementation flow of the point cloud decoding method proposed in an embodiment of the present application.
  • the method for the decoder to perform point cloud decoding may include the following steps:
  • Step 104 When the codec state dependency identification information indicates that the current macroblock is not independently coded or decoded, after the decoding process of the current macroblock is completed, the context state corresponding to the current macroblock is stored.
  • the context state corresponding to the current macroblock can also be stored.
  • the hash table information and context state corresponding to the current macroblock can be passed to the next macroblock, so that the context state and hash table information of the next macroblock can be initialized according to the hash table information and context state corresponding to the current macroblock when the codec state dependency identification information corresponding to the next macroblock indicates that the next macroblock is not independently encoded and decoded.
  • the context state and hash table information corresponding to the current macroblock can also be initialized according to the context state and hash table information corresponding to the last encoded and decoded macroblock.
  • FIG. 12 is a schematic diagram of the implementation flow of the point cloud decoding method proposed in an embodiment of the present application.
  • the method for the decoder to perform point cloud decoding may include the following steps:
  • Step 105 When the geometric coding state storage identification information indicates that the coding and decoding state is not to be stored, initialize the context state and hash table information corresponding to the current macroblock.
  • the context state and hash table information corresponding to the current macroblock can be directly initialized.
  • whether to execute the determination of the coding and decoding state dependency identification information of the geometric macroblock depends on the geometric coding state storage identification information. If the geometric coding state storage identification information indicates that the coding and decoding state is stored, then the coding and decoding state dependency identification information of the geometric macroblock can be further determined; if the geometric coding state storage identification information indicates that the coding and decoding state is not stored, then there is no need to determine the coding and decoding state dependency identification information of the geometric macroblock.
  • the geometric codec state storage identification information can be a global control parameter that can control the sequence level, frame level, slice level, LCU level, etc., therefore, if the geometric coding state storage identification information indicates that the codec state is not stored, then for any geometric macroblock, the codec state will not be stored, that is, the codec state dependency identification information of the geometric macroblock will no longer be meaningful, and therefore the determination of the codec state dependency identification information of the geometric macroblock may not be performed, thereby improving the coding and decoding efficiency.
  • FIG. 13 is a fourth schematic diagram of the implementation flow of the point cloud decoding method proposed in an embodiment of the present application.
  • the method for the decoder to perform point cloud decoding may include the following steps:
  • Step 106 When the codec state dependency identification information indicates that the current macroblock is independently coded or decoded, initialize the context state and hash table information corresponding to the current macroblock.
  • the context state and hash table information corresponding to the current macroblock can be directly initialized.
  • FIG. 14 is a schematic diagram of a fifth implementation flow of the point cloud decoding method proposed in an embodiment of the present application.
  • the method for performing point cloud decoding by the decoder may include the following steps:
  • Step 107 Decode the code stream to determine the encoding and decoding state corresponding to the current macroblock, which depends on the identification information and the hash information.
  • the code stream may be directly decoded to determine the codec state corresponding to the current macroblock, which depends on the identification information and the hash information.
  • whether to execute the coding and decoding state dependency identification information of the geometric macroblock may not depend on the geometric coding state storage identification information, that is, only the coding and decoding state dependency identification information corresponding to the current macroblock may be transmitted in the bitstream, and the geometric coding state storage identification information is no longer determined and transmitted.
  • the process of determining the codec state dependent identification information and the identification information of the hash information of the current macroblock it is possible to simultaneously determine the codec state dependent identification information and the identification information of the hash information of the current macroblock, or it is possible to first determine the codec state dependent identification information of the current macroblock, and then select whether to determine the identification information of the hash information of the current macroblock according to the codec state dependent identification information of the current macroblock.
  • the identification information of the hash information of the current macroblock may depend on the codec state-dependent identification information of the current macroblock, or may not depend on the codec state-dependent identification information of the current macroblock.
  • the codec state dependency identification information corresponding to the current macroblock can be determined first; then, when the codec state dependency identification information indicates that the current macroblock is not independently encoded or decoded, the bitstream is decoded, and then the identification information of the hash information corresponding to the current macroblock is determined.
  • the decoding code stream can first determine the codec state dependency identification information corresponding to the current macroblock; then, when the codec state dependency identification information indicates that the current macroblock is independently encoded and decoded, the identification information determination process of the hash information corresponding to the current macroblock will no longer be executed.
  • Step 108 When the codec state dependency identification information indicates that the current macroblock is not independently coded or decoded, after the decoding process of the current macroblock is completed, the hash table information corresponding to the current macroblock is stored according to the identification information of the hash information.
  • the hash table information corresponding to the current macroblock can be further stored.
  • the hash table information based on the identification information of the hash information corresponding to the current macroblock, it can be determined which layer or layers of the octree of the current macroblock are to be stored, and it can also be determined which layer or layers of the hash information of the next macroblock the stored hash table information is to be applied to.
  • the point cloud decoding method proposed by the above steps 101 to 108 can, on the one hand, correct the relevant syntax regulations and corresponding algorithms for encoding between the current AVS-GPCC geometric context state and the geometric macroblock, for example, use the identification information of the hash information to explain and indicate the hash table information of the geometric macroblock, and further define the common syntax elements and related algorithms, that is, use the indication information of the hash information to define which layer of hash information in the octree encoding process the geometric hash information needs to be stored, and which layer of hash information in the octree encoding process the geometric hash information needs to be applied to. This can ensure the consistency of AVS-GPCC geometric encoding and decoding.
  • Common coding and decoding methods store the neighborhood information of the last layer nodes of the current coding and decoding macroblock when storing the coding and decoding status.
  • each geometric macroblock adopts octree encoding and decoding. Therefore, the coding and decoding method proposed in the embodiment of the present application can further stipulate that when the geometric coding and decoding status is saved, it is necessary to determine the number of octree layers for storing geometric hash information. In this way, a good balance can be achieved between geometric coding memory and geometric coding efficiency.
  • the grammatical meaning of the geometry coding state storage identification information gps_save_state_flag and the codec state dependency identification information gps_lcu_dependency_flag, as well as the relationship between the two, can be further specified.
  • the geometry coding state storage identification information indicates that the context state and the hash information of the geometry coding are not stored in the geometry coding, then the geometry macroblocks cannot be dependent on each other. At this time, it is possible to choose not to determine and transmit the codec state dependency identification information, thereby improving the codec efficiency.
  • the point cloud encoding and decoding method proposed in the embodiment of the present application is not limited to specifying the relationship between the geometric coding state storage identification information gps_save_state_flag and the encoding and decoding state dependency identification information gps_lcu_dependency_flag. It can also only use gps_lcu_dependency_flag to achieve the current function, thereby further improving the encoding and decoding efficiency.
  • point cloud encoding and decoding method proposed in the embodiment of the present application can make corresponding corrections to the syntax elements of the geometric coding context state and hash information in AVS-GPCC, as well as correct the corresponding algorithm.
  • the existing syntax elements gps_save_state_flag and gps_lcu_dependency_flag are saved in the gps, but the meaning and coding of each syntax element need to be modified.
  • the geometric coding state storage flag gps_save_state_flag can be a binary variable. For example, a value of '0' indicates that the coding state, i.e., the hash table information of the entropy coding context and the geometric coding, is not stored; a value of '1' indicates that the coding state is stored. The default value is '1', i.e., the coding state is stored.
  • the indication information of the hash information corresponding to the geometric macroblock can be used to indicate that the hash information of the geometric code is the neighbor placeholder information of the node of the last layer (or any one or more layers).
  • the geometry macroblock coding state dependency flag gps_lcu_dependency_flag (coding and decoding state dependency identification information) can be a binary variable.
  • a value of '0' indicates that the geometry macroblock coding is independent of each other; a value of '1' indicates that the geometry macroblock coding state is dependent.
  • the default value is '1', that is, the geometry macroblocks are dependent on each other.
  • Table 3 shows a syntax table corresponding to the current macroblock LCU, and the description of its syntax elements is shown in Table 3.
  • An embodiment of the present application provides a point cloud decoding method, in which a decoder decodes a bitstream and determines that a geometric coding state stores identification information; when the geometric coding state storage identification information indicates that the coding state is stored, the decoder decodes the bitstream and determines that the coding state corresponding to the current macroblock depends on identification information and identification information of the hash information; when the coding state dependency identification information indicates that the current macroblock is not independently coded and decoded, after completing the decoding process of the current macroblock, the hash table information corresponding to the current macroblock is stored according to the identification information of the hash information.
  • the codec can choose to determine the coding state dependency identification information of the geometric macroblock only when the geometric coding state storage identification information indicates that the coding state is stored, thereby overcoming the defect of redundant grammatical elements and improving coding and decoding efficiency; on the other hand, the codec can use the identification information of the hash information of the geometric macroblock to The hash table information that needs to be stored is described and indicated, thereby reducing the complexity of encoding and decoding, ensuring the consistency of encoding and decoding, and thus improving the accuracy of encoding and decoding.
  • FIG15 a schematic diagram of a flow chart of an encoding method provided by an embodiment of the present application is shown.
  • the method for performing point cloud encoding by an encoder may include the following steps:
  • Step 201 Determine geometric codec state storage identification information, and write the geometric codec state storage identification information into a bitstream.
  • the geometric coding state storage identification information may be determined first, and then the geometric coding state storage identification information may be written into the bitstream, wherein the geometric coding state storage identification information may be used to determine whether to store the coding state.
  • the encoding method of the embodiment of the present application is applied to a point cloud encoder (hereinafter referred to as "encoder" for short).
  • the method may refer to a point cloud encoding method, specifically a point cloud geometric information encoding method.
  • the encoding method proposed in the embodiment of the present application can be applied to the AVS-PCC encoding framework, or called the AVS-GPCC encoding framework.
  • the geometric coding and decoding state storage identification information may be a syntax element corresponding to the sequence level.
  • the geometry codec state storage identification information may be represented by a syntax element gps_save_state_flag, wherein the geometry codec state storage identification information gps_save_state_flag may indicate whether to store the codec state in the codec process.
  • the geometric coding state storage identification information may be a global control parameter, which may control the sequence level, frame level, slice level, LCU level, etc.
  • the value of the geometric encoding and decoding status storage identification information can be set according to whether the encoding and decoding status is stored, and the geometric encoding and decoding status storage identification information can be written into the bitstream and transmitted to the decoding end.
  • the value of the geometric coding state storage identification information when it is determined that the coding state is to be stored, can be set to a first value, so that the geometric coding state storage identification information can indicate the storage coding state; when it is determined that the coding state is not to be stored, the value of the geometric coding state storage identification information can be set to a second value, so that the geometric coding state storage identification information can indicate that the coding state is not to be stored.
  • the decoded code stream determines the syntax element gps_save_state_flag representing the geometric codec state storage identification information, wherein gps_save_state_flag is a binary variable, and when the value of gps_save_state_flag is a first value, it is determined to store the codec state, and when the value of gps_save_state_flag is a second value, it is determined not to store the codec state.
  • the first value is different from the second value, and the first value and the second value can be in parameter form or in digital form.
  • the first prediction mode identification information and the second prediction mode identification information can be parameters written in the profile, or can be the value of a flag, which is not specifically limited here.
  • the first value can be set to 1 and the second value can be set to 0; or, the first value can be set to 0 and the second value can be set to 1; or, the first value can be set to true and the second value can be set to false; or, the first value can be set to false and the second value can be set to true.
  • the first value is set to 1 and the second value is set to 0, but it is not specifically limited.
  • the geometric coding state storage identification information can be determined first.
  • the encoder may perform encoding processing based on the geometric macroblock of the largest coding unit LCU.
  • the point cloud to be processed may be spatially divided first, at least one geometric macroblock may be determined, and then the at least one geometric macroblock may be coded and decoded.
  • a point cloud slice may be spatially divided first to obtain different geometric macroblocks, and then each geometric macroblock may be adaptively coded.
  • the at least one divided geometric macroblock may include the current macroblock being encoded and decoded, and may also include the previous macroblock that has completed encoding and decoding, and the next macroblock to be encoded and decoded.
  • the encoding and decoding state in the encoding and decoding process may at least include a context state and hash table information, wherein the context state may be used to determine the context, and the hash table information may be used to determine the neighbor placeholder information.
  • Step 202 When the geometric coding state storage identification information indicates the storage of the coding state, determine the coding state dependency identification information and the identification information of the hash information corresponding to the current macroblock, and write the coding state dependency identification information and the identification information of the hash information corresponding to the current macroblock into the bitstream.
  • the coding and decoding state dependency identification information and the identification information of the hash information corresponding to the current macroblock can be further determined, and the coding and decoding state dependency identification information and the identification information of the hash information corresponding to the current macroblock can be written into the bitstream.
  • the geometric coding state storage identification information indicates the storage of the coding and decoding state
  • the coding and decoding state such as the context state and hash table information in the coding and decoding process is allowed to be stored.
  • the coding and decoding processing of the macroblock can be entered.
  • the coding and decoding state dependency identification information corresponding to the current macroblock can be determined first, and then based on the coding and decoding state dependency identification information, it can be determined whether the current macroblock allows independent coding and decoding.
  • the coding and decoding state dependency identification information may be a syntax element corresponding to the LCU level.
  • the codec state dependency identification information may be represented by a syntax element gps_lcu_dependency_flag, wherein the codec state dependency identification information gps_lcu_dependency_flag may indicate whether the current macroblock depends on other macroblocks, that is, whether the current macroblock allows independent coding and decoding.
  • the current macroblock is allowed to be independently encoded and decoded during the process of encoding and decoding the current macroblock, and then the value of the encoding and decoding state dependency identification information corresponding to the current macroblock can be set according to whether the current macroblock is allowed to be independently encoded and decoded.
  • the identification information of the hash information corresponding to the current macroblock can also be set, and then the encoding and decoding state dependency identification information and the identification information of the hash information corresponding to the current macroblock can be written into the bitstream and transmitted to the decoding end.
  • the value of the codec state dependency identification information when it is determined that the current macroblock is independently encoded and decoded, can be set to a third value, so that the codec state dependency identification information can indicate that the current macroblock is independently encoded and decoded; when it is determined that the current macroblock is not independently encoded and decoded, the value of the codec state dependency identification information can be set to a fourth value, so that the codec state dependency identification information can indicate that the current macroblock is not independently encoded and decoded.
  • the decoded code stream determines the syntax element gps_lcu_dependency_flag representing the coding and decoding state dependency identification information, wherein gps_lcu_dependency_flag is a binary variable.
  • gps_lcu_dependency_flag is the third value, it is determined that the current macroblock is independently coded and decoded.
  • gps_lcu_dependency_flag is the fourth value, it is determined that the current macroblock is not independently coded and decoded.
  • the third value is different from the fourth value, and the third value and the fourth value can be in parameter form or in digital form.
  • the first prediction mode identification information and the second prediction mode identification information can be parameters written in the profile, or can be the value of a flag, which is not specifically limited here.
  • the third value can be set to 1 and the fourth value can be set to 0; or, the third value can be set to 0 and the fourth value can be set to 1; or, the third value can be set to true and the fourth value can be set to false; or, the third value can be set to false and the fourth value can be set to true.
  • the third value is set to 1 and the fourth value is set to 0, but it is not specifically limited.
  • the identification information of the hash information can be used to indicate and explain the hash information to be stored corresponding to the current macroblock, and the reference of the stored hash information in the next macroblock.
  • the identification information of the hash information of the current macroblock includes the first identification information and/or the second identification information.
  • the first identification information can be used to indicate and explain the hash information to be stored corresponding to the current macroblock; the second identification information can be used to indicate and explain the reference of the stored hash information corresponding to the current macroblock in the next macroblock.
  • the first identification information may be used to indicate hash information of the i-th layer to the j-th layer of the octree to be stored corresponding to the current macroblock; wherein i and j are both greater than or equal to 0.
  • the second identification information is used to indicate the mth to nth layers of the octree to be applied corresponding to the next macroblock; wherein m and n are both greater than or equal to 0.
  • m and n can be any integer greater than or equal to 0, and m and n can be the same or different.
  • the identification information of the hash information corresponding to the current macroblock can determine which layer or layers of the octree of the current macroblock to store the hash information of the current macroblock in the process of storing the hash table information of the current macroblock, instead of simply and directly storing the hash information of all layers or the last layer of the octree of the current macroblock. In comparison, the complexity of the encoding and decoding process can be effectively reduced.
  • the identification information of the hash information corresponding to the current macroblock can be stored in the In the process of hashing the hash table information, it is determined to which layer or layers of the octree of the next macroblock the stored hash table information of the current macroblock will be applied to the hash information.
  • the complexity of the encoding and decoding process is further reduced while ensuring the consistency of encoding and decoding, thereby effectively improving the accuracy of encoding and decoding.
  • the process of determining the codec state dependent identification information and the identification information of the hash information of the current macroblock it is possible to simultaneously determine the codec state dependent identification information and the identification information of the hash information of the current macroblock, or it is possible to first determine the codec state dependent identification information of the current macroblock, and then select whether to determine the identification information of the hash information of the current macroblock according to the codec state dependent identification information of the current macroblock.
  • the identification information of the hash information of the current macroblock may depend on the codec state-dependent identification information of the current macroblock, or may not depend on the codec state-dependent identification information of the current macroblock.
  • the coding and decoding state dependency identification information corresponding to the current macroblock can be determined first; and then, when the coding and decoding state dependency identification information indicates that the current macroblock is not independently encoded and decoded, the identification information of the hash information corresponding to the current macroblock can be determined.
  • the coding and decoding state dependency identification information corresponding to the current macroblock can be determined first; then, when the coding and decoding state dependency identification information indicates that the current macroblock is independently coded and decoded, the identification information determination process of the hash information corresponding to the current macroblock will no longer be executed.
  • the identification information of the hash information of the current macroblock depends on the corresponding codec state dependency identification information, then when it is determined based on the codec state dependency identification information that the current macroblock does not depend on other macroblocks and is independently encoded and decoded, it is no longer necessary to store the hash table information, and therefore there is no need to determine the hash information of the current block.
  • Step 203 When the coding and decoding state dependency identification information indicates that the current macroblock is not independently coded and decoded, after the coding process of the current macroblock is completed, the hash table information corresponding to the current macroblock is stored according to the identification information of the hash information.
  • the codec state dependency identification information indicates that the current macroblock is not independently encoded and decoded, then after completing the encoding process of the current macroblock, you can choose to store the hash table information corresponding to the current macroblock according to the identification information of the hash information.
  • the hash table information corresponding to the current macroblock can be further stored.
  • the hash table information based on the identification information of the hash information corresponding to the current macroblock, it can be determined which layer or layers of the octree of the current macroblock are to be stored, and it can also be determined which layer or layers of the hash information of the next macroblock the stored hash table information is to be applied to.
  • the first identification information in the identification information of the hash information of the current macroblock can be used to indicate the hash information of the i-th layer to the j-th layer of the octree corresponding to the current macroblock to be stored. Therefore, after the encoding process of the current macroblock is completed, based on the first identification information, the hash information of the i-th layer to the j-th layer of the octree corresponding to the current macroblock can be selected to be stored.
  • the second identification information in the identification information of the hash information of the current macroblock is used to indicate the hash information of the mth to nth layers of the octree to be applied corresponding to the next macroblock, after the encoding process of the current macroblock is completed, the second identification information can be selected to be passed to the next macroblock.
  • the geometric coding state storage identification information indicates the storage coding and decoding state
  • the coding and decoding state dependency identification information corresponding to the current macroblock indicates that the current macroblock is not independently coded and decoded
  • the second identification information for indicating the mth to nth layers of the octree to be applied corresponding to the next macroblock can be passed to the next macroblock.
  • the hash information of the mth to nth layers of the octree corresponding to the next macroblock can be initialized according to the stored hash information corresponding to the current macroblock.
  • m and n can be any integer greater than or equal to 0, and m and n can be the same or different.
  • the codec state dependency identification information corresponding to the current macroblock indicates that the current macroblock is not independent. If the next macroblock is to be independently coded and decoded, and the codec state corresponding to the next macroblock depends on the identification information indicating that the next macroblock is not independently coded and decoded, then, after completing the coding and decoding processing of the current macroblock, based on the first identification information, the hash information of the i-th to j-th layers of the octree corresponding to the current macroblock can be selected to be stored, and the second identification information indicating the m-th to n-th layers of the octree to be applied corresponding to the next macroblock can be passed to the next macroblock, so that when encoding and decoding the next macroblock, the hash information of the i-th to j-th layers of the octree corresponding to the current macroblock that has been stored can be used to initialize the hash information of the m
  • the codec state dependency identification information corresponding to the current macroblock indicates that the current macroblock is not independently encoded and decoded
  • the codec state dependency identification information corresponding to the previous macroblock that has been encoded and decoded indicates that the previous macroblock is not independently encoded and decoded
  • the method for the encoder to perform point cloud encoding may include the following steps:
  • Step 204 When the coding and decoding state dependency identification information indicates that the current macroblock is not independently coded and decoded, after the coding process of the current macroblock is completed, the context state corresponding to the current macroblock is stored.
  • the context state corresponding to the current macroblock can also be stored.
  • the hash table information and context state corresponding to the current macroblock can be passed to the next macroblock, so that the context state and hash table information of the next macroblock can be initialized according to the hash table information and context state corresponding to the current macroblock when the codec state dependency identification information corresponding to the next macroblock indicates that the next macroblock is not independently encoded and decoded.
  • the context state and hash table information corresponding to the current macroblock can also be initialized according to the context state and hash table information corresponding to the last encoded and decoded macroblock.
  • the method for the encoder to perform point cloud encoding may include the following steps:
  • Step 205 When the geometric coding state storage identification information indicates that the coding and decoding state is not to be stored, initialize the context state and hash table information corresponding to the current macroblock.
  • the context state and hash table information corresponding to the current macroblock can be directly initialized.
  • whether to execute the determination of the coding and decoding state dependency identification information of the geometric macroblock depends on the geometric coding state storage identification information. If the geometric coding state storage identification information indicates that the coding and decoding state is stored, then the coding and decoding state dependency identification information of the geometric macroblock can be further determined; if the geometric coding state storage identification information indicates that the coding and decoding state is not stored, then there is no need to determine the coding and decoding state dependency identification information of the geometric macroblock.
  • the geometric codec state storage identification information can be a global control parameter that can control the sequence level, frame level, slice level, LCU level, etc., therefore, if the geometric coding state storage identification information indicates that the codec state is not stored, then for any geometric macroblock, the codec state will not be stored, that is, the codec state dependency identification information of the geometric macroblock will no longer be meaningful, and therefore the determination of the codec state dependency identification information of the geometric macroblock may not be performed, thereby improving the coding and decoding efficiency.
  • the method for the encoder to perform point cloud encoding may include the following steps:
  • Step 206 When the codec state dependency identification information indicates that the current macroblock is independently coded or decoded, initialize the context state and hash table information corresponding to the current macroblock.
  • the context state and hash table information corresponding to the current macroblock can be directly initialized.
  • the method for performing point cloud encoding by an encoder may include the following steps:
  • Step 207 Determine the codec state dependency identification information and the identification information of the hash information corresponding to the current macroblock, and write the codec state dependency identification information and the identification information of the hash information corresponding to the current macroblock into the bitstream.
  • the coding and decoding state dependency identification information and the identification information of the hash information corresponding to the current macroblock can be directly determined, and then the coding and decoding state dependency identification information and the identification information of the hash information corresponding to the current macroblock can be written into the bitstream and transmitted to the decoding end.
  • whether to execute the coding and decoding state dependency identification information of the geometric macroblock may not depend on the geometric coding state storage identification information, that is, only the coding and decoding state dependency identification information corresponding to the current macroblock may be transmitted in the bitstream, and the geometric coding state storage identification information is no longer determined and transmitted.
  • the process of determining the codec state dependent identification information and the identification information of the hash information of the current macroblock it is possible to simultaneously determine the codec state dependent identification information and the identification information of the hash information of the current macroblock, or it is possible to first determine the codec state dependent identification information of the current macroblock, and then select whether to determine the identification information of the hash information of the current macroblock according to the codec state dependent identification information of the current macroblock.
  • the identification information of the hash information of the current macroblock may depend on the codec state-dependent identification information of the current macroblock, or may not depend on the codec state-dependent identification information of the current macroblock.
  • the codec state dependency identification information corresponding to the current macroblock may be determined first; and then, when the codec state dependency identification information indicates that the current macroblock is not independently encoded or decoded, the identification information of the hash information corresponding to the current macroblock may be determined.
  • the coding and decoding state dependency identification information corresponding to the current macroblock can be determined first; then, when the coding and decoding state dependency identification information indicates that the current macroblock is independently coded and decoded, the identification information determination process of the hash information corresponding to the current macroblock will no longer be executed.
  • Step 208 When the codec state dependency identification information indicates that the current macroblock is not independently coded or decoded, after the decoding process of the current macroblock is completed, the hash table information corresponding to the current macroblock is stored according to the identification information of the hash information.
  • the hash table information corresponding to the current macroblock can be further stored.
  • the hash table information based on the identification information of the hash information corresponding to the current macroblock, it can be determined which layer or layers of the octree of the current macroblock are to be stored, and it can also be determined which layer or layers of the hash information of the next macroblock the stored hash table information is to be applied to.
  • the point cloud coding method proposed by the above steps 201 to 208 can, on the one hand, correct the relevant syntax regulations and corresponding algorithms for coding between the current AVS-GPCC geometric context state and the geometric macroblock, for example, use the identification information of the hash information to explain and indicate the hash table information of the geometric macroblock, and further define the common syntax elements and related algorithms, that is, use the indication information of the hash information to define which layer of hash information in the octree coding process the geometric hash information needs to be stored, and which layer of hash information in the octree coding process the geometric hash information needs to be applied to. This can ensure the consistency of AVS-GPCC geometric coding and decoding.
  • Common coding and decoding methods store the neighborhood information of the last layer nodes of the current coding and decoding macroblock when storing the coding and decoding status.
  • each geometric macroblock adopts octree encoding and decoding. Therefore, the coding and decoding method proposed in the embodiment of the present application can further stipulate that when the geometric coding and decoding status is saved, it is necessary to determine the number of octree layers for storing geometric hash information. In this way, a good balance can be achieved between geometric coding memory and geometric coding efficiency.
  • the geometric coding state storage identification information gps_save_state_flag and the codec state dependency identification information gps_lcu_dependency_flag when the geometric coding state storage identification information indicates that the context state and the hash information of the geometric coding are not stored in the geometric coding, then the geometric macroblocks cannot be dependent on each other. At this time, it is possible to choose not to determine and transmit the codec state dependency identification information, thereby improving the codec efficiency.
  • the geometric coding state storage identification information indicates that the context state and the hash information of the geometric coding in the geometric coding can be stored, then at this time, it can be further determined according to the syntax gps_lcu_dependency_flag whether each macroblock needs to be independent of each other.
  • the point cloud encoding and decoding method proposed in the embodiment of the present application is not limited to specifying the relationship between the geometric coding state storage identification information gps_save_state_flag and the encoding and decoding state dependency identification information gps_lcu_dependency_flag. It can also only use gps_lcu_dependency_flag to achieve the current function, thereby further improving the encoding and decoding efficiency.
  • point cloud encoding and decoding method proposed in the embodiment of the present application can make corresponding corrections to the syntax elements of the geometric coding context state and hash information in AVS-GPCC, as well as correct the corresponding algorithm.
  • the existing syntax elements gps_save_state_flag and gps_lcu_dependency_flag are saved in the gps, but the meaning and coding of each syntax element need to be modified.
  • the indication information of the hash information corresponding to the geometric macroblock can be used to indicate that the hash information of the geometric code is the neighbor placeholder information of the node of the last layer (or any one or more layers).
  • the geometry macroblock coding state dependency flag gps_lcu_dependency_flag (coding and decoding state dependency identification information) can be a binary variable.
  • a value of '0' indicates that the geometry macroblock coding is independent of each other; a value of '1' indicates that the geometry macroblock coding state is dependent.
  • the default value is '1', that is, the geometry macroblocks are dependent on each other.
  • the embodiment of the present application provides a point cloud encoding method
  • the encoder determines the geometric encoding and decoding state storage identification information, and writes the geometric encoding and decoding state storage identification information into the code stream; when the geometric encoding state storage identification information indicates the storage encoding and decoding state, the encoding and decoding state corresponding to the current macroblock is determined to be dependent on the identification information and the identification information of the hash information, and the identification information of the encoding and decoding state dependent on the identification information and the hash information corresponding to the current macroblock is written into the code stream; when the encoding and decoding state dependent identification information indicates that the current macroblock is not independently encoded and decoded, after completing the encoding process of the current macroblock, the hash table information corresponding to the current macroblock is stored according to the identification information of the hash information.
  • the codec can choose to determine the encoding and decoding state dependency identification information of the geometric macroblock only when the geometric encoding state storage identification information indicates the storage encoding and decoding state, which overcomes the defect of redundant syntax elements and improves the encoding and decoding efficiency; on the other hand, the codec can use the identification information of the hash information of the geometric macroblock to explain and indicate the hash table information that needs to be stored, thereby reducing the complexity of encoding and decoding, and ensuring the consistency of encoding and decoding, thereby improving the accuracy of encoding and decoding.
  • FIG. 16 is a schematic diagram of a composition structure of an encoder.
  • the encoder 100 may include: a first determining unit 111, an encoding unit 112, and a first storage unit 113; wherein,
  • the first determining unit 111 is configured to determine the geometric coding state storage identification information
  • the encoding unit 112 is configured to write the geometric encoding and decoding state storage identification information into a bitstream
  • the first determining unit 111 is further configured to determine the identification information of the coding state dependency identification information and the hash information corresponding to the current macroblock when the geometric coding state storage identification information indicates the storage of the coding state;
  • the encoding unit 112 is further configured to write the encoding and decoding state dependency identification information and the identification information of the hash information corresponding to the current macroblock into a bitstream;
  • the first storage unit 113 is configured to indicate in the codec state dependency identification information that the current macroblock is not independently coded or decoded.
  • the hash table information corresponding to the current macroblock is stored according to the identification information of the hash information.
  • the encoder 100 can also be regarded as a data processing mode (or “entropy encoder”), which is used to encode the values of the syntax elements to be encoded.
  • entropy encoder a data processing mode
  • a "unit” may be a part of a circuit, a part of a processor, a part of a program or software, etc., and of course, it may be a module, or it may be non-modular.
  • the components in the present embodiment may be integrated into a processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above-mentioned integrated unit may be implemented in the form of hardware or in the form of a software functional module.
  • the integrated unit is implemented in the form of a software function module and is not sold or used as an independent product, it can be stored in a computer-readable storage medium.
  • the technical solution of this embodiment is essentially or the part that contributes to the prior art or the whole or part of the technical solution can be embodied in the form of a software product.
  • the computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, server, or network device, etc.) or a processor to perform all or part of the steps of the method described in this embodiment.
  • the aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, etc., which can store program code.
  • an embodiment of the present application provides a computer-readable storage medium, which is applied to the encoder 100.
  • the computer-readable storage medium stores a computer program.
  • the computer program When the computer program is executed by the first processor, it implements the encoding method described in any one of the aforementioned embodiments.
  • Figure 17 is a second schematic diagram of the composition structure of the encoder.
  • the encoder 100 may include: a first memory 121 and a first processor 122, a first communication interface 123 and a first bus system 124.
  • the first memory 121, the first processor 122, and the first communication interface 123 are coupled together through the first bus system 124.
  • the first bus system 124 is used to achieve connection and communication between these components.
  • the first bus system 124 also includes a power bus, a control bus, and a status signal bus.
  • various buses are labeled as the first bus system 124. Among them,
  • the first communication interface 123 is used for receiving and sending signals during the process of sending and receiving information with other external network elements;
  • the first memory 121 is used to store a computer program that can be run on the first processor
  • the first processor 122 is configured to:
  • the geometric coding state storage identification information indicates that the coding state is stored, determining the coding state dependency identification information and the identification information of the hash information corresponding to the current macroblock, and writing the coding state dependency identification information and the identification information of the hash information corresponding to the current macroblock into a bitstream;
  • the hash table information corresponding to the current macroblock is stored according to the identification information of the hash information.
  • the first memory 121 in the embodiment of the present application can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories.
  • the non-volatile memory can 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 can be a random access memory (RAM), which is used as an external cache.
  • RAM static RAM
  • DRAM dynamic RAM
  • SDRAM synchronous DRAM
  • DDRSDRAM double data rate synchronous DRAM
  • ESDRAM enhanced synchronous DRAM
  • SLDRAM synchronous link DRAM
  • DRRAM direct RAM bus RAM
  • the first processor 122 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit or software instructions in the first processor 122.
  • the above-mentioned first processor 122 can be a general-purpose processor, a digital signal processor (Digital Signal Processor, DSP), an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.
  • DSP Digital Signal Processor
  • ASIC Application Specific Integrated Circuit
  • FPGA Field Programmable Gate Array
  • the various methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed.
  • the general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc.
  • the steps of the method disclosed in the embodiments of the present application can be directly embodied as a hardware decoding processor.
  • the execution is completed, or the hardware and software modules in the decoding processor are combined to complete the execution.
  • the software module can be located in a random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, register, and other mature storage media in the art.
  • the storage medium is located in the first memory 121, and the first processor 122 reads the information in the first memory 121 and completes the steps of the above method in combination with its hardware.
  • the processing unit can be implemented in one or more application specific integrated circuits (Application Specific Integrated Circuits, ASIC), digital signal processors (Digital Signal Processing, DSP), digital signal processing devices (DSP Device, DSPD), programmable logic devices (Programmable Logic Device, PLD), field programmable gate arrays (Field-Programmable Gate Array, FPGA), general processors, controllers, microcontrollers, microprocessors, other electronic units for performing the functions described in this application or a combination thereof.
  • ASIC Application Specific Integrated Circuits
  • DSP Digital Signal Processing
  • DSP Device digital signal processing devices
  • PLD programmable logic devices
  • FPGA field programmable gate array
  • general processors controllers, microcontrollers, microprocessors, other electronic units for performing the functions described in this application or a combination thereof.
  • the technology described in this application can be implemented by a module (such as a process, function, etc.) that performs the functions described in this application.
  • the software code can be stored in a memory and executed by a processor.
  • the memory can be implemented in the processor or outside the processor.
  • the first processor 122 is further configured to execute the method described in any one of the aforementioned embodiments when running the computer program.
  • This embodiment provides an encoder, which determines the geometric coding state storage identification information and writes the geometric coding state storage identification information into the code stream; when the geometric coding state storage identification information indicates the storage coding state, determines the coding state dependency identification information and hash information identification information corresponding to the current macroblock, and writes the coding state dependency identification information and hash information identification information corresponding to the current macroblock into the code stream; when the coding state dependency identification information indicates that the current macroblock is not independently coded and decoded, after completing the coding process of the current macroblock, stores the hash table information corresponding to the current macroblock according to the identification information of the hash information.
  • the codec can choose to determine the coding state dependency identification information of the geometric macroblock only when the geometric coding state storage identification information indicates the storage coding state, which overcomes the defect of redundant syntax elements and improves the coding and decoding efficiency; on the other hand, the codec can use the identification information of the hash information of the geometric macroblock to explain and indicate the hash table information that needs to be stored, thereby reducing the complexity of coding and decoding, and ensuring the consistency of coding and decoding, thereby improving the accuracy of coding and decoding.
  • FIG. 18 is a schematic diagram of a structure of a decoder.
  • the decoder 200 may include: a decoding unit 211, a second determining unit 212, and a second storage unit 213; wherein,
  • the decoding unit 211 is configured to decode the code stream
  • the second determining unit 212 is configured to determine the geometric coding state storage identification information
  • the decoding unit 211 is further configured to decode the code stream when the geometric coding state storage identification information indicates the storage coding and decoding state;
  • the second determining unit 212 is further configured to determine the coding and decoding state corresponding to the current macroblock and the identification information of the dependent identification information and the hash information;
  • the second storage unit 213 is configured to store the hash table information corresponding to the current macroblock according to the identification information of the hash information after completing the decoding process of the current macroblock when the encoding and decoding state dependency identification information indicates that the current macroblock is not independently encoded and decoded.
  • the decoder 200 can also be regarded as a data processing mode (or “entropy decoder”), which is used to decode the values of the syntax elements to be decoded.
  • entropy decoder a data processing mode
  • a "unit" can be a part of a circuit, a part of a processor, a part of a program or software, etc., and of course it can also be a module, or it can be non-modular.
  • the components in this embodiment can be integrated into a processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.
  • the above-mentioned integrated unit can be implemented in the form of hardware or in the form of a software functional module.
  • the integrated unit is implemented in the form of a software function module and is not sold or used as an independent product, it can be stored in a computer-readable storage medium.
  • this embodiment provides a computer-readable storage medium, which is applied to the decoder 200, and the computer-readable storage medium stores a computer program. When the computer program is executed by the second processor, the method described in any one of the above embodiments is implemented.
  • FIG19 is a second schematic diagram of the composition structure of the decoder.
  • the decoder 200 may include: a second memory 221 and a second processor 222, a second communication interface 223 and a second bus system 224.
  • the second memory 221 and the second processor 222, and the second communication interface 223 are coupled together through the second bus system 224.
  • the second bus system 224 is used to realize the connection and communication between these components.
  • the second bus system 224 also includes a power bus, a control bus and a status signal bus.
  • the various buses are labeled is the second bus system 224. Among them,
  • the second communication interface 223 is used for receiving and sending signals during the process of sending and receiving information with other external network elements;
  • the second memory 221 is used to store a computer program that can be run on the second processor
  • the second processor 222 is configured to:
  • the geometric coding state storage identification information indicates that the coding and decoding state is stored
  • decoding the code stream to determine the coding and decoding state corresponding to the current macroblock, depending on the identification information and the identification information of the hash information
  • the hash table information corresponding to the current macroblock is stored according to the identification information of the hash information.
  • the second memory 221 in the embodiment of the present application can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories.
  • the non-volatile memory can 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 can be a random access memory (RAM), which is used as an external cache.
  • RAM static RAM
  • DRAM dynamic RAM
  • SDRAM synchronous DRAM
  • DDRSDRAM double data rate synchronous DRAM
  • ESDRAM enhanced synchronous DRAM
  • SLDRAM synchronous link DRAM
  • DRRAM direct RAM bus RAM
  • the second processor 222 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit or software instructions in the second processor 222.
  • the above-mentioned second processor 222 can be a general processor, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.
  • DSP Digital Signal Processor
  • ASIC Application Specific Integrated Circuit
  • FPGA Field Programmable Gate Array
  • the methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed.
  • the general processor can be a microprocessor or the processor can also be any conventional processor, etc.
  • the steps of the method disclosed in the embodiments of the present application can be directly embodied as a hardware decoding processor to execute, or the hardware and software modules in the decoding processor can be executed.
  • the software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc.
  • the storage medium is located in the second memory 221, and the second processor 222 reads the information in the second memory 221 and completes the steps of the above method in combination with its hardware.
  • the processing unit can be implemented in one or more application specific integrated circuits (Application Specific Integrated Circuits, ASIC), digital signal processors (Digital Signal Processing, DSP), digital signal processing devices (DSP Device, DSPD), programmable logic devices (Programmable Logic Device, PLD), field programmable gate arrays (Field-Programmable Gate Array, FPGA), general processors, controllers, microcontrollers, microprocessors, other electronic units for performing the functions described in this application or a combination thereof.
  • ASIC Application Specific Integrated Circuits
  • DSP Digital Signal Processing
  • DSP Device digital signal processing devices
  • PLD programmable logic devices
  • FPGA field programmable gate array
  • general processors controllers, microcontrollers, microprocessors, other electronic units for performing the functions described in this application or a combination thereof.
  • the technology described in this application can be implemented by a module (such as a process, function, etc.) that performs the functions described in this application.
  • the software code can be stored in a memory and executed by a processor.
  • the memory can be implemented in the processor or outside the processor.
  • the second processor 222 is further configured to execute any one of the methods described in the foregoing embodiments when running the computer program.
  • the present embodiment provides a decoder, which decodes a code stream and determines the geometric coding state storage identification information; when the geometric coding state storage identification information indicates the storage coding state, decodes the code stream and determines the coding state dependency identification information and the identification information of the hash information corresponding to the current macroblock; when the coding state dependency identification information indicates that the current macroblock is not independently coded and decoded, after completing the decoding process of the current macroblock, stores the hash table information corresponding to the current macroblock according to the identification information of the hash information.
  • the codec can choose to determine the coding state dependency identification information of the geometric macroblock only when the geometric coding state storage identification information indicates the storage coding state, thereby overcoming the defect of redundant grammatical elements and improving the coding and decoding efficiency; on the other hand, the codec can use the identification information of the hash information of the geometric macroblock to explain and indicate the hash table information that needs to be stored, thereby reducing the complexity of coding and decoding, and ensuring the consistency of coding and decoding, thereby improving the accuracy of coding and decoding.
  • the embodiment of the present application also proposes a code stream, wherein the code stream is bit-coded according to the information to be coded.
  • the information to be encoded includes at least: geometric codec state storage identification information, codec state dependency identification information and hash information identification information corresponding to the current macroblock, codec state dependency identification information corresponding to the next macroblock, and codec state dependency identification information corresponding to the previous macroblock.
  • the decoder decodes the code stream and determines the geometric codec state storage identification information; when the geometric codec state storage identification information indicates the storage codec state, the decoder decodes the code stream and determines the codec state corresponding to the current macroblock depends on the identification information and the identification information of the hash information; when the codec state depends on the identification information and indicates that the current macroblock is not independently coded and decoded, after completing the decoding process of the current macroblock, the hash table information corresponding to the current macroblock is stored according to the identification information of the hash information.
  • the encoder determines the geometric codec state storage identification information and writes the geometric codec state storage identification information into the code stream; when the geometric codec state storage identification information indicates the storage codec state, the codec state corresponding to the current macroblock depends on the identification information and the identification information of the hash information, and writes the codec state corresponding to the current macroblock depends on the identification information and the identification information of the hash information into the code stream; when the codec state depends on the identification information and indicates that the current macroblock is not independently coded and decoded, after completing the encoding process of the current macroblock, the hash table information corresponding to the current macroblock is stored according to the identification information of the hash information.
  • the codec can choose to determine the codec state dependency identification information of the geometry macroblock only when the geometry coding state storage identification information indicates the storage codec state, thereby overcoming the defect of redundant syntax elements and improving the codec efficiency; on the other hand, the codec can use the identification information of the hash information of the geometry macroblock to explain and indicate the hash table information to be stored, thereby reducing the complexity of the codec and ensuring the consistency of the codec, thereby improving the accuracy of the codec. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

La présente demande divulgue un procédé de codage de nuage de points, un procédé de décodage de nuage de points, un flux de code, un codeur, un décodeur et un support de stockage. Le procédé de décodage de nuage de points comprend les étapes suivantes : un décodeur décode un flux de code, de façon à déterminer des informations d'identification de stockage d'état de codage et de décodage géométriques ; lorsque les informations d'identification de stockage d'état de codage et de décodage géométriques indiquent un état de codage et de décodage de stockage, décoder le flux de code, et déterminer des informations d'identification de dépendance d'état de codage et de décodage correspondant à un macro-bloc actuel et des informations d'identification d'informations de hachage, ; et lorsque les informations d'identification de dépendance d'état de codage et de décodage indiquent que le macro-bloc actuel n'est pas codé et décodé de manière indépendante, après que le traitement de décodage du macro-bloc actuel est achevé, sur la base des informations d'identification des informations de hachage, stocker des informations de table de hachage correspondant au macro-bloc actuel.
PCT/CN2023/113835 2023-08-18 2023-08-18 Procédé de codage de nuage de points, procédé de décodage de nuage de points, flux de code, codeur, décodeur et support de stockage Pending WO2025039122A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2023/113835 WO2025039122A1 (fr) 2023-08-18 2023-08-18 Procédé de codage de nuage de points, procédé de décodage de nuage de points, flux de code, codeur, décodeur et support de stockage

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2023/113835 WO2025039122A1 (fr) 2023-08-18 2023-08-18 Procédé de codage de nuage de points, procédé de décodage de nuage de points, flux de code, codeur, décodeur et support de stockage

Publications (1)

Publication Number Publication Date
WO2025039122A1 true WO2025039122A1 (fr) 2025-02-27

Family

ID=94731233

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/113835 Pending WO2025039122A1 (fr) 2023-08-18 2023-08-18 Procédé de codage de nuage de points, procédé de décodage de nuage de points, flux de code, codeur, décodeur et support de stockage

Country Status (1)

Country Link
WO (1) WO2025039122A1 (fr)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210029381A1 (en) * 2018-04-09 2021-01-28 Huawei Technologies Co., Ltd. Method and apparatus for obtaining global matched patch
US20220232253A1 (en) * 2021-01-19 2022-07-21 Tencent America LLC Method and apparatus for point cloud coding
CN115379188A (zh) * 2022-08-18 2022-11-22 腾讯科技(深圳)有限公司 点云数据处理方法、装置、设备及存储介质
CN115866274A (zh) * 2022-09-19 2023-03-28 腾讯科技(深圳)有限公司 一种点云媒体的数据处理方法及相关设备
WO2023059168A1 (fr) * 2021-10-08 2023-04-13 엘지전자 주식회사 Procédé d'émission de données de nuage de points, dispositif d'émission de données de nuage de points, procédé de réception de données de nuage de points et dispositif de réception de données de nuage de points
WO2023147742A1 (fr) * 2022-02-01 2023-08-10 Beijing Xiaomi Mobile Software Co., Ltd. Procédé et appareil de codage/décodage d'une tranche de données de nuage de points

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210029381A1 (en) * 2018-04-09 2021-01-28 Huawei Technologies Co., Ltd. Method and apparatus for obtaining global matched patch
US20220232253A1 (en) * 2021-01-19 2022-07-21 Tencent America LLC Method and apparatus for point cloud coding
WO2023059168A1 (fr) * 2021-10-08 2023-04-13 엘지전자 주식회사 Procédé d'émission de données de nuage de points, dispositif d'émission de données de nuage de points, procédé de réception de données de nuage de points et dispositif de réception de données de nuage de points
WO2023147742A1 (fr) * 2022-02-01 2023-08-10 Beijing Xiaomi Mobile Software Co., Ltd. Procédé et appareil de codage/décodage d'une tranche de données de nuage de points
CN115379188A (zh) * 2022-08-18 2022-11-22 腾讯科技(深圳)有限公司 点云数据处理方法、装置、设备及存储介质
CN115866274A (zh) * 2022-09-19 2023-03-28 腾讯科技(深圳)有限公司 一种点云媒体的数据处理方法及相关设备

Similar Documents

Publication Publication Date Title
WO2024174086A1 (fr) Procédé de décodage, procédé de codage, décodeurs et codeurs
WO2025039122A1 (fr) Procédé de codage de nuage de points, procédé de décodage de nuage de points, flux de code, codeur, décodeur et support de stockage
WO2025039125A1 (fr) Procédé d'encodage, procédé de décodage, encodeur, décodeur, et support de stockage
WO2025039127A1 (fr) Procédé de codage, procédé de décodage, codeur, décodeur et support de stockage
WO2025039120A1 (fr) Procédé de codage, procédé de décodage, codeur, décodeur et support de stockage
WO2025039113A1 (fr) Procédé de codage, procédé de décodage, flux de code, codeur, décodeur, et support de stockage
WO2024103304A1 (fr) Procédé d'encodage de nuage de points, procédé de décodage de nuage de points, encodeur, décodeur, flux de code, et support de stockage
WO2024148598A1 (fr) Procédé de codage, procédé de décodage, codeur, décodeur et support de stockage
WO2024216649A1 (fr) Procédé de codage et de décodage de nuage de points, codeur, décodeur, flux de code et support de stockage
WO2025039236A1 (fr) Procédé de codage et décodage, train de codes, codeur, décodeur et support de stockage
WO2024174092A1 (fr) Procédé de codage/décodage, flux de code, codeur, décodeur et support d'enregistrement
WO2024187380A1 (fr) Procédé de codage, procédé de décodage, flux de code, codeur, décodeur et support de stockage
WO2025076659A1 (fr) Procédé de codage de nuage de points, procédé de décodage de nuage de points, flux de code, codeur, décodeur et support de stockage
WO2025076662A1 (fr) Procédé de codage de nuage de points, procédé de décodage de nuage de points, flux de code, codeur, décodeur et support de stockage
WO2024119420A1 (fr) Procédé de codage, procédé de décodage, flux de code, codeur, décodeur, et support de stockage
WO2024119518A1 (fr) Procédé de codage, procédé de décodage, décodeur, codeur, flux de code et support de stockage
WO2024207235A1 (fr) Procédé de codage/décodage, train de bits, codeur, décodeur et support de stockage
WO2024082152A1 (fr) Procédés et appareils de codage et de décodage, codeur et décodeur, flux de code, dispositif et support de stockage
WO2025145330A1 (fr) Procédé de codage de nuage de points, procédé de décodage de nuage de points, codeurs, décodeurs, flux de code et support de stockage
WO2024119419A1 (fr) Procédé de codage, procédé de décodage, flux binaire, codeur, décodeur et support de stockage
WO2025010600A1 (fr) Procédé de codage, procédé de décodage, flux de code, codeur, décodeur et support de stockage
WO2023240662A1 (fr) Procédé de codage, procédé de décodage, codeur, décodeur, et support de stockage
WO2024216476A1 (fr) Procédé de codage/décodage, codeur, décodeur, flux de code, et support de stockage
WO2024207456A1 (fr) Procédé de codage et de décodage, codeur, décodeur, flux de code et support de stockage
WO2025007355A1 (fr) Procédé de codage, procédé de décodage, flux de code, codeur, décodeur et support de stockage

Legal Events

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

Ref document number: 23949316

Country of ref document: EP

Kind code of ref document: A1