CN118175341A - Geometric coding method, geometric decoding method and terminal - Google Patents
Geometric coding method, geometric decoding method and terminal Download PDFInfo
- Publication number
- CN118175341A CN118175341A CN202211583723.XA CN202211583723A CN118175341A CN 118175341 A CN118175341 A CN 118175341A CN 202211583723 A CN202211583723 A CN 202211583723A CN 118175341 A CN118175341 A CN 118175341A
- Authority
- CN
- China
- Prior art keywords
- node
- decoded
- encoded
- nodes
- point cloud
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 91
- 108091026890 Coding region Proteins 0.000 claims description 4
- 238000004891 communication Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 9
- 230000000694 effects Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000013139 quantization Methods 0.000 description 5
- 238000005192 partition Methods 0.000 description 4
- 230000001360 synchronised effect Effects 0.000 description 4
- 238000004590 computer program Methods 0.000 description 3
- 230000003190 augmentative effect Effects 0.000 description 2
- 238000004040 coloring Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000012512 characterization method Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 239000011521 glass Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000002310 reflectometry Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000005406 washing Methods 0.000 description 1
- 210000000707 wrist Anatomy 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/96—Tree coding, e.g. quad-tree coding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/44—Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
- H04N19/597—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding specially adapted for multi-view video sequence encoding
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The application discloses a geometric coding method, a geometric decoding method and a terminal, which belong to the technical field of coding and decoding, and the geometric coding method provided by the embodiment of the application comprises the following steps: obtaining geometric information of a point cloud to be encoded; generating a bounding box corresponding to the point cloud to be encoded according to the geometric information of the point cloud to be encoded; the bounding box comprises at least two nodes to be encoded, and the nodes to be encoded are determined based on multi-branch tree division of the bounding box; for each node to be encoded, determining at most N encoded nodes associated with the node to be encoded according to node parameters corresponding to the point cloud to be encoded; generating context information corresponding to the nodes to be encoded according to the occupation information of at most N encoded nodes; and carrying out geometric coding on the node to be coded based on the context information corresponding to the node to be coded, and generating a target code stream.
Description
Technical Field
The application belongs to the technical field of encoding and decoding, and particularly relates to a geometric encoding method, a geometric decoding method and a terminal.
Background
A point cloud is a set of irregularly distributed discrete points in space that represent the spatial structure and surface properties of a three-dimensional object or scene.
In performing multi-tree-based geometric coding on the point cloud, the current node to be coded needs to be subjected to geometric coding according to context information corresponding to the current node to be coded, wherein the context information consists of the occupation codes of the coded nodes. Thus, for the node to be encoded close to the leaf node, a large number of occupied codes of the encoded node need to be stored, and a large amount of memory space is occupied.
Disclosure of Invention
The embodiment of the application provides a geometric coding method, a geometric decoding method and a terminal, which can solve the problem that a large amount of space occupied by the space occupied by a large number of coded nodes is required to be stored in the related technology.
In a first aspect, a geometric coding method is provided, including:
the method comprises the steps that an encoding end obtains geometric information of a point cloud to be encoded;
The encoding end generates a bounding box corresponding to the point cloud to be encoded according to the geometric information of the point cloud to be encoded; the bounding box comprises at least two nodes to be encoded, and the nodes to be encoded are determined based on multi-tree division of the bounding box;
the encoding end determines a maximum of N encoded nodes associated with each node to be encoded according to node parameters corresponding to the point cloud to be encoded, wherein the node to be encoded is a non-initial node in the point cloud to be encoded, and N is an integer greater than or equal to 1;
The encoding end generates context information corresponding to the node to be encoded according to the occupation information of the maximum N encoded nodes;
And the encoding end performs geometric encoding on the node to be encoded based on the context information corresponding to the node to be encoded, and generates a target code stream.
In a second aspect, there is provided a geometric decoding method comprising:
the decoding end obtains a target code stream;
The decoding end decodes the target code stream to obtain point cloud to be decoded, wherein the point cloud to be decoded comprises at least two nodes to be decoded;
The decoding end determines a maximum of N decoded nodes associated with each node to be decoded according to node parameters corresponding to the point cloud to be decoded, wherein the node to be decoded is a non-initial node in the point cloud to be decoded, and N is an integer greater than or equal to 1;
the decoding end generates context information corresponding to the nodes to be decoded according to the occupation information of the maximum N decoded nodes;
and the decoding end performs geometric decoding on the node to be decoded based on the context information corresponding to the node to be decoded, and generates reconstruction geometric information corresponding to the point cloud to be decoded.
In a third aspect, there is provided a geometric coding apparatus comprising:
the acquisition module is used for acquiring the geometric information of the point cloud to be encoded;
the first generation module is used for generating a bounding box corresponding to the point cloud to be encoded according to the geometric information of the point cloud to be encoded; the bounding box comprises at least two nodes to be encoded, and the nodes to be encoded are determined based on multi-tree division of the bounding box;
The determining module is used for determining a maximum of N coded nodes associated with each node to be coded according to the node parameters corresponding to the point cloud to be coded, wherein the node to be coded is a non-initial node in the point cloud to be coded, and N is an integer greater than or equal to 1;
the second generation module is used for generating context information corresponding to the nodes to be coded according to the occupation information of the at most N coded nodes;
and the third generating module is used for geometrically encoding the node to be encoded based on the context information corresponding to the node to be encoded, and generating a target code stream.
In a fourth aspect, there is provided a geometric decoding apparatus comprising:
The acquisition module is used for acquiring the target code stream;
The decoding module is used for decoding the target code stream to obtain point clouds to be decoded, and the point clouds to be decoded comprise at least two nodes to be decoded;
The determining module is used for determining a maximum of N decoded nodes associated with each node to be decoded according to the node parameters corresponding to the point cloud to be decoded, wherein the node to be decoded is a non-initial node in the point cloud to be decoded, and N is an integer greater than or equal to 1;
the first generation module is used for generating context information corresponding to the nodes to be decoded according to the occupation information of the at most N decoded nodes;
and the second generation module is used for performing geometric decoding on the node to be decoded based on the context information corresponding to the node to be decoded, and generating reconstruction geometric information corresponding to the point cloud to be decoded.
In a fifth aspect, there is provided a terminal comprising a processor and a memory storing a program or instructions executable on the processor, which when executed by the processor, performs the steps of the method according to the first aspect, or performs the steps of the method according to the second aspect.
In a sixth aspect, there is provided a readable storage medium having stored thereon a program or instructions which when executed by a processor, performs the steps of the method according to the first aspect or performs the steps of the method according to the second aspect.
In a seventh aspect, there is provided a chip comprising a processor and a communication interface, the communication interface and the processor being coupled, the processor being for running a program or instructions to implement the method according to the first aspect or to implement the steps of the method according to the second aspect.
In an eighth aspect, a computer program/program product is provided, stored in a storage medium, which is executed by at least one processor to implement the steps of the method as described in the first aspect, or to implement the steps of the method as described in the second aspect.
In the embodiment of the application, for each node to be encoded, the geometric encoding of the node to be encoded can be realized only according to the occupation information of at most N encoded nodes associated with the node to be encoded. Compared with the scheme that the space occupation information of all the encoded nodes is needed to carry out geometric encoding on the nodes to be encoded in the related art, the embodiment of the application can carry out geometric encoding on the nodes to be encoded through the space occupation information of the encoded nodes with a small number, thereby reducing the storage space of the space occupation information of the encoded nodes and releasing a large amount of memory space.
Drawings
FIG. 1 is a schematic diagram of a point cloud AVS point cloud encoding apparatus framework;
FIG. 2 is a schematic diagram of a point cloud AVS point cloud decoding apparatus framework;
FIG. 3 is a schematic flow chart of a geometric coding method according to an embodiment of the present application;
FIG. 4 is a flow chart of a geometric decoding method according to an embodiment of the present application;
FIG. 5 is a block diagram of a geometry-coding device provided by an embodiment of the application;
Fig. 6 is a block diagram of a geometry decoding device according to an embodiment of the present application;
Fig. 7 is a block diagram of a communication device according to an embodiment of the present application;
fig. 8 is a schematic hardware structure of a terminal according to an embodiment of the present application.
Detailed Description
The technical solutions of the embodiments of the present application will be clearly described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which are derived by a person skilled in the art based on the embodiments of the application, fall within the scope of protection of the application.
The terms first, second and the like in the description and in the claims, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the application are capable of operation in sequences other than those illustrated or otherwise described herein, and that the "first" and "second" distinguishing between objects generally are not limited in number to the extent that the first object may, for example, be one or more. Furthermore, in the description and claims, "and/or" means at least one of the connected objects, and the character "/" generally means a relationship in which the associated object is an "or" before and after.
The geometry encoding device corresponding to the geometry encoding method and the geometry decoding device corresponding to the geometry decoding method in the embodiments of the present application may be terminals, which may also be referred to as terminal devices or User Equipment (UE), and the terminals may be Mobile phones, tablet computers (Tablet Personal Computer), laptop computers (Laptop computers) or terminal-side devices such as notebook computers, personal digital assistants (Personal DIGITAL ASSISTANT, PDA), palm computers, netbooks, ultra-Mobile Personal computers (ultra-Mobile Personal Computer, UMPC), mobile internet surfing devices (Mobile INTERNET DEVICE, MID), augmented reality (augmented reality, AR)/Virtual Reality (VR) devices, robots, wearable devices (Wearable Device) or vehicle-mounted devices (VUE), pedestrian terminals (PUE), smart home (devices with wireless communication functions, such as refrigerators, televisions, washing machines or furniture), game machines, personal computers (Personal Computer, PC), teller machines or self-service machines, and the like, and the wearable devices include: intelligent wrist-watch, intelligent bracelet, intelligent earphone, intelligent glasses, intelligent ornament (intelligent bracelet, intelligent ring, intelligent necklace, intelligent anklet, intelligent foot chain etc.), intelligent wrist strap, intelligent clothing etc.. It should be noted that the specific type of the terminal 11 is not limited in the embodiment of the present application.
For ease of understanding, some of the following descriptions are directed to embodiments of the present application:
Referring to fig. 1, as shown in fig. 1, in the digital audio/video codec technology standard, the geometric information and the attribute information of the point cloud are separately encoded by using a point cloud AVS point cloud encoding device. Firstly, carrying out coordinate transformation on geometric information to enable the point cloud to be contained in a bounding box, and then carrying out coordinate quantization. Quantization mainly plays a role of scaling, and since quantization rounds geometric coordinates, geometric information of a part of points is the same, namely repeated points, whether repeated points are removed or not is determined according to parameters, and two steps of quantization and repeated point removal are called voxel forming. Next, a multi-tree division, such as an octree, quadtree, or binary tree division, is performed on the bounding box. In a multi-tree-based geometric information coding framework, the bounding box is divided into 8 subcubes in an eighth mode, the non-empty subcubes are continuously divided until division is carried out to obtain a unit cube with leaf nodes of 1x1x1, division is stopped, points in the leaf nodes are coded, and a binary code stream is generated.
After the geometric coding is completed, the geometric information is reconstructed for later re-coloring. Attribute coding is mainly directed to color and reflectivity information. Firstly, judging whether to perform color space conversion according to parameters, and if so, converting color information from Red Green Blue (RGB) color space to brightness color (YUV) color space. And then, re-coloring the geometric reconstruction point cloud by utilizing the original point cloud so that the uncoded attribute information corresponds to the reconstructed geometric information. In color information coding, after point clouds are ordered through Morton codes or Hilbert codes, nearest neighbors of points to be predicted are searched through a geometric space relation, the points to be predicted are predicted through reconstruction attribute values of the found neighbors to obtain predicted attribute values, then real attribute values and the predicted attribute values are differentiated to obtain predicted residual errors, and finally the predicted residual errors are quantized and coded to generate binary code streams.
It should be understood that the decoding process in the digital audio/video encoding and decoding technical standard corresponds to the above-mentioned encoding process, and specifically, the frame of the AVS point cloud decoding device is shown in fig. 2.
The application provides a geometric coding method, and the geometric coding method provided by the embodiment of the application is described in detail through some embodiments and application scenes thereof by combining with the attached drawings.
Referring to fig. 3, fig. 3 is a flowchart of a geometric coding method according to an embodiment of the application. The geometric coding method provided by the embodiment comprises the following steps:
S301, the encoding end obtains geometric information of a point cloud to be encoded.
S302, the encoding end generates a bounding box corresponding to the point cloud to be encoded according to the geometric information of the point cloud to be encoded.
In this step, after the geometric information of the point cloud to be encoded is obtained, coordinate translation and coordinate quantization may be performed on the geometric position of the point cloud to be encoded, so as to generate a bounding box containing the point cloud to be encoded. And determining at least two nodes to be encoded, which are included by the bounding box, by performing multi-tree division on the bounding box.
Among these, the multi-tree partitions include, but are not limited to, binary tree partitions, quadtree partitions, and octree partitions.
S303, for each node to be encoded, the encoding end determines at most N encoded nodes associated with the node to be encoded according to node parameters corresponding to the point cloud to be encoded.
The node to be encoded is a non-initial node in the point cloud to be encoded, and N is an integer greater than or equal to 1. For a specific implementation of determining a maximum of N encoded nodes associated with a node to be encoded according to node parameters, refer to the following examples.
It should be noted that, for an initial node in the point cloud to be encoded, geometric encoding may be performed on the initial node according to a default value preset by the initial node.
It should be noted that the number of encoded nodes associated with different nodes to be encoded may be the same or different, but the number of encoded nodes associated with each node to be encoded does not exceed N.
S304, the coding end generates context information corresponding to the nodes to be coded according to the occupying information of the maximum N coded nodes.
The occupancy information includes an occupancy code.
In this step, arithmetic operation may be performed on at least some of the space occupying codes of all the encoded nodes, to obtain context information corresponding to the node to be encoded.
It should be appreciated that the occupancy information of the encoded nodes described above may be stored in a cache at the encoding end.
S305, the encoding end performs geometric encoding on the node to be encoded based on the context information corresponding to the node to be encoded, and generates a target code stream.
In the embodiment of the application, for each node to be encoded, the geometric encoding of the node to be encoded can be realized only according to the occupation information of at most N encoded nodes associated with the node to be encoded. Compared with the scheme that the space occupation information of all the encoded nodes is needed to carry out geometric encoding on the nodes to be encoded in the related art, the embodiment of the application can carry out geometric encoding on the nodes to be encoded through the space occupation information of the encoded nodes with a small number, thereby reducing the storage space of the space occupation information of the encoded nodes and releasing a large amount of memory space.
Optionally, the node parameter is used for characterizing the number of encoded nodes, and the determining, according to the node parameter corresponding to the point cloud to be encoded, a maximum of N encoded nodes associated with the node to be encoded includes:
The encoding end determines a maximum of N encoded nodes with the encoding sequence positioned in front of the node to be encoded as a maximum of N encoded nodes associated with the node to be encoded based on the encoding sequence of the node to be encoded.
In this embodiment, the node parameter is used to characterize the number of encoded nodes. In this embodiment, the encoded nodes whose encoding order is located before the node to be encoded may be determined as the encoded nodes associated with the node to be encoded, and further context information corresponding to the node to be encoded is generated based on the occupancy information of the encoded nodes, where the number of encoded nodes represented by the node parameter does not exceed N.
In this embodiment, the number of encoded nodes associated with the node to be encoded is defined by the node parameter, and then in the subsequent step, geometric encoding can be performed on the node to be encoded by using the occupation information of the encoded nodes with a smaller number, so that the storage space of the occupation information of the encoded nodes is reduced, and a large amount of memory space is released.
Optionally, the determining, according to the node parameters corresponding to the point cloud to be encoded, a maximum of N encoded nodes associated with the node to be encoded includes:
The encoding end takes the geometric position corresponding to the node to be encoded as a search center, performs search operation on the point cloud to be encoded, and the search range of the search operation is determined based on the node parameters;
and the coding end determines the searched coded nodes as at most N coded nodes associated with the node to be coded.
In this embodiment, the node parameter may represent a search range. In this embodiment, the geometric position corresponding to the node to be encoded may be used as a search center, and the search operation may be performed on the point cloud to be encoded, and the encoded node located in the search range may be determined as the encoded node associated with the node to be encoded.
As described above, the occupancy information of the encoded nodes may be stored in a cache at the encoding end. In the case that the point parameter may represent the search range, the array may be represented by an array, where the index of the array is a morton code calculated according to the geometric coordinates of the node to be encoded, the value of the array is the occupancy information of each encoded node associated with the node to be encoded, and the capacity of the array is the size of the search range represented by the node parameter.
The method for updating the group is as follows: and updating the array subscript according to the Morton code calculated by the geometric coordinates of the node to be encoded, thereby realizing the updating of the array.
Another way to update the tuple is: in the process of determining the maximum N coded nodes associated with the nodes to be coded, if the array has reached the upper limit of the cache capacity, the occupation information of the coded points located outside the search range of the node parameter characterization is cleared.
In this embodiment, the number of encoded nodes associated with the node to be encoded is defined by the node parameter, and then in the subsequent step, geometric encoding can be performed on the node to be encoded by using the occupation information of the encoded nodes with a smaller number, so that the storage space of the occupation information of the encoded nodes is reduced, and a large amount of memory space is released.
Optionally, the geometric coding of the node to be coded based on the context information corresponding to the node to be coded includes:
The encoding end encodes the context information corresponding to the node to be encoded through the context model corresponding to the point cloud to be encoded, generates a target code stream, and writes a model index into the target code stream; the model index is used for representing a context model corresponding to the point cloud to be encoded.
In this embodiment, the encoding end selects a set of context models from the multiple sets of context models to encode the context information through adaptive judgment, and writes a model index representing the context model into the target code stream. It should be appreciated that if the encoding end only stores one set of context models, the model index is not written into the target code stream.
Optionally, the node parameter is a parameter agreed by a protocol, or the node parameter is determined based on pre-acquired indication information.
An alternative implementation manner is that the node parameter is the number of shifts agreed by the protocol. In this embodiment, the node parameters may be specified directly at the encoding end.
Another alternative embodiment is: the node parameters are determined by the pre-acquired indication information. In this embodiment, the node parameter is determined by analyzing the instruction information.
Referring to fig. 4, fig. 4 is a flowchart illustrating a geometric decoding method according to an embodiment of the application. The geometric decoding method provided by the embodiment comprises the following steps:
S401, the decoding end obtains a target code stream.
S402, the decoding end decodes the target code stream to obtain point cloud to be decoded.
In the step, the obtained target code stream is decoded to obtain point cloud to be decoded, wherein the point cloud to be decoded comprises at least two nodes to be decoded.
S403, for each node to be decoded, the decoding end determines at most N decoded nodes associated with the node to be decoded according to node parameters corresponding to the point cloud to be decoded.
The node to be decoded is a non-initial node in the point cloud to be decoded, and N is an integer greater than or equal to 1.
It should be noted that, for an initial node in the point cloud to be decoded, geometric decoding may be performed on the initial node according to a default value of the initial node obtained by decoding the target code stream.
It should be noted that the number of decoded nodes associated with different nodes to be decoded may be the same or different, but the number of decoded nodes associated with each node to be decoded does not exceed N.
S404, the decoding end generates context information corresponding to the nodes to be decoded according to the occupying information of the maximum N decoded nodes.
For a specific implementation of determining a maximum of N decoded nodes associated with a node to be decoded according to the node parameters, please refer to the following examples.
S405, the decoding end performs geometric decoding on the node to be decoded based on the context information corresponding to the node to be decoded, and generates reconstruction geometric information corresponding to the point cloud to be decoded.
In the embodiment of the application, for each node to be decoded, geometric decoding of the node to be decoded can be realized only according to the occupation information of at most N decoded nodes associated with the node to be decoded. That is, the geometric decoding can be performed on the nodes to be decoded through the occupation information of the decoded nodes with a small number, so that the storage space of the occupation information of the decoded nodes is reduced, and a large amount of memory space is released.
Optionally, the node parameter is used for representing the number of decoded nodes, and the determining, according to the node parameter corresponding to the point cloud to be decoded, a maximum of N decoded nodes associated with the node to be decoded includes:
the decoding end determines N decoded nodes with the decoding sequence positioned in front of the nodes to be decoded as the maximum N decoded nodes associated with the nodes to be decoded based on the decoding sequence of the nodes to be decoded.
In this embodiment, the node parameter is used to characterize the number of decoded nodes. In this embodiment, the decoded nodes whose decoding order is located before the node to be decoded may be determined as the decoded nodes associated with the node to be decoded, where the number of decoded nodes represented by the node parameter does not exceed N.
Optionally, the determining, according to the node parameters corresponding to the point cloud to be decoded, a maximum of N decoded nodes associated with the node to be decoded includes:
The decoding end takes the geometric position corresponding to the node to be decoded as a search center, performs search operation on the point cloud to be decoded, and the search range of the search operation is determined based on the node parameters;
And the decoding end determines the searched decoded nodes as at most N decoded nodes associated with the nodes to be decoded.
In this embodiment, the node parameter may represent a search range. In this embodiment, the geometric position corresponding to the node to be decoded may be used as a search center, and the search operation may be performed on the point cloud to be decoded, and the decoded node located in the search range may be determined as the decoded node associated with the node to be decoded.
Optionally, the performing geometric decoding on the node to be decoded based on the context information corresponding to the node to be decoded, and generating the reconstructed geometric information corresponding to the point cloud to be decoded includes:
The decoding end decodes the context information corresponding to the node to be decoded through the context model corresponding to the point cloud to be decoded, and generates reconstruction geometry information corresponding to the point cloud to be decoded; the context model is determined based on a model index carried by the target code stream.
In this embodiment, the target code stream may be decoded to obtain a model index, and then the context information corresponding to the node to be decoded is decoded by using the context model represented by the model index, so as to generate the reconstructed geometric information corresponding to the point cloud to be decoded.
Optionally, the parameters agreed by the node parameter protocol, or the node parameters are determined based on the indication information carried by the target code stream.
It should be noted that, the geometric decoding method provided in this embodiment is the inverse of the geometric encoding provided in the above embodiment.
According to the geometric coding method provided by the embodiment of the application, the execution main body can be a geometric coding device. In the embodiment of the present application, a geometric coding method performed by a geometric coding device is taken as an example, and the geometric coding device provided by the embodiment of the present application is described.
As shown in fig. 5, an embodiment of the present application further provides a geometric coding apparatus 500, including:
an obtaining module 501, configured to obtain geometric information of a point cloud to be encoded;
The first generating module 502 is configured to generate a bounding box corresponding to the point cloud to be encoded according to the geometric information of the point cloud to be encoded; the bounding box comprises at least two nodes to be encoded, and the nodes to be encoded are determined based on multi-tree division of the bounding box;
A determining module 503, configured to determine, for each node to be encoded, a maximum of N encoded nodes associated with the node to be encoded according to a node parameter corresponding to the point cloud to be encoded, where the node to be encoded is a non-initial node in the point cloud to be encoded, and N is an integer greater than or equal to 1;
a second generating module 504, configured to generate context information corresponding to the node to be encoded according to the occupancy information of the at most N encoded nodes;
And the third generating module 505 is configured to perform geometric coding on the node to be coded based on the context information corresponding to the node to be coded, and generate a target code stream.
Optionally, the node parameter is used to characterize the number of encoded nodes, and the determining module 503 is specifically configured to:
And determining a maximum N coded nodes with the coding sequence positioned in front of the node to be coded as a maximum N coded nodes associated with the node to be coded based on the coding sequence of the node to be coded.
Optionally, the determining module 503 is further specifically configured to:
Taking the geometric position corresponding to the node to be encoded as a search center, executing search operation on the point cloud to be encoded, wherein the search range of the search operation is determined based on the node parameters;
and determining the searched encoded nodes as at most N encoded nodes associated with the node to be encoded.
Optionally, the third generating module 505 is specifically configured to:
coding the context information corresponding to the node to be coded through the context model corresponding to the point cloud to be coded, generating a target code stream, and writing a model index into the target code stream; the model index is used for representing a context model corresponding to the point cloud to be encoded.
Optionally, the node parameter is a parameter agreed by a protocol, or the node parameter is determined based on pre-acquired indication information.
In the embodiment of the application, for each node to be encoded, the geometric encoding of the node to be encoded can be realized only according to the occupation information of at most N encoded nodes associated with the node to be encoded. Compared with the scheme that the space occupation information of all the encoded nodes is needed to carry out geometric encoding on the nodes to be encoded in the related art, the embodiment of the application can carry out geometric encoding on the nodes to be encoded through the space occupation information of the encoded nodes with a small number, thereby reducing the storage space of the space occupation information of the encoded nodes and releasing a large amount of memory space.
The embodiment of the device corresponds to the embodiment of the geometric coding method shown in fig. 3, and each implementation process and implementation manner of the coding end in the embodiment of the method are applicable to the embodiment of the device, and the same technical effects can be achieved.
According to the geometric decoding method provided by the embodiment of the application, the execution main body can be a geometric decoding device. In the embodiment of the present application, a geometric decoding method performed by a geometric decoding device is taken as an example, and the geometric decoding device provided by the embodiment of the present application is described.
As shown in fig. 6, an embodiment of the present application further provides a geometric decoding apparatus 600, including:
An acquisition module 601, configured to acquire a target code stream;
The decoding module 602 is configured to decode the target code stream to obtain a point cloud to be decoded, where the point cloud to be decoded includes at least two nodes to be decoded;
A determining module 603, configured to determine, for each node to be decoded, a maximum of N decoded nodes associated with the node to be decoded according to a node parameter corresponding to the point cloud to be decoded, where the node to be decoded is a non-initial node in the point cloud to be decoded, and N is an integer greater than or equal to 1;
a first generating module 604, configured to generate context information corresponding to the node to be decoded according to the occupancy information of the at most N decoded nodes;
the second generating module 605 is configured to perform geometric decoding on the node to be decoded based on the context information corresponding to the node to be decoded, and generate reconstructed geometric information corresponding to the point cloud to be decoded.
Optionally, the node parameter is used to characterize the number of decoded nodes, and the determining module 603 is specifically configured to:
And determining a maximum N decoded nodes with the decoding sequence positioned in front of the node to be decoded as a maximum N decoded nodes associated with the node to be decoded based on the decoding sequence of the node to be decoded.
Optionally, the determining module 603 is further specifically configured to:
taking the geometric position corresponding to the node to be decoded as a search center, executing search operation on the point cloud to be decoded, and determining the search range of the search operation based on the node parameters;
And determining the searched decoded nodes as at most N decoded nodes associated with the nodes to be decoded.
Optionally, the second generating module 605 is specifically configured to:
Decoding the context information corresponding to the node to be decoded through the context model corresponding to the point cloud to be decoded, and generating reconstruction geometry information corresponding to the point cloud to be decoded; the context model is determined based on a model index carried by the target code stream.
Optionally, the parameters agreed by the node parameter protocol, or the node parameters are determined based on the indication information carried by the target code stream.
The geometric decoding device provided by the embodiment of the application can realize each process realized by the method embodiment of fig. 4 and achieve the same technical effect, and in order to avoid repetition, the description is omitted here.
The geometry encoding device and the geometry decoding device in the embodiments of the present application may be electronic devices, for example, electronic devices with an operating system, or may be components in electronic devices, for example, integrated circuits or chips. The electronic device may be a terminal, or may be other devices than a terminal. By way of example, the terminals may include, but are not limited to, the types of terminals listed above, other devices may be servers, network attached storage (Network Attached Storage, NAS), etc., and embodiments of the present application are not limited in detail.
Optionally, as shown in fig. 7, the embodiment of the present application further provides a communication device 700, including a processor 701 and a memory 702, where the memory 702 stores a program or instructions that can be executed on the processor 701, for example, when the communication device 700 is a terminal, the program or instructions implement the steps of the embodiment of the geometric coding method or implement the steps of the embodiment of the geometric decoding method when executed by the processor 701, and achieve the same technical effects.
The embodiment of the application also provides a terminal, which comprises a processor and a communication interface, wherein the processor is used for executing the following operations:
Obtaining geometric information of a point cloud to be encoded;
Generating a bounding box corresponding to the point cloud to be encoded according to the geometric information of the point cloud to be encoded;
For each node to be encoded, determining a maximum of N encoded nodes associated with the node to be encoded according to node parameters corresponding to the point cloud to be encoded;
Generating context information corresponding to the nodes to be coded according to the occupation information of the at most N coded nodes;
And performing geometric coding on the node to be coded based on the context information corresponding to the node to be coded, and generating a target code stream.
Or the processor is configured to perform the following operations:
Obtaining a target code stream;
decoding the target code stream to obtain a point cloud to be decoded;
for each node to be decoded, determining a maximum of N decoded nodes associated with the node to be decoded according to node parameters corresponding to the point cloud to be decoded;
Generating context information corresponding to the nodes to be decoded according to the occupation information of the at most N decoded nodes;
And performing geometric decoding on the node to be decoded based on the context information corresponding to the node to be decoded, and generating reconstruction geometric information corresponding to the point cloud to be decoded.
The terminal embodiment corresponds to the terminal-side method embodiment, and each implementation process and implementation manner of the method embodiment can be applied to the terminal embodiment, and the same technical effects can be achieved. Specifically, fig. 8 is a schematic diagram of a hardware structure of a terminal for implementing an embodiment of the present application.
The terminal 800 includes, but is not limited to: radio frequency unit 801, network module 802, audio output unit 803, input unit 804, sensor 805, display unit 806, user input unit 807, interface unit 808, memory 809, and processor 810.
Those skilled in the art will appreciate that the terminal 800 may further include a power source (e.g., a battery) for powering the various components, and that the power source may be logically coupled to the processor 810 by a power management system for performing functions such as managing charging, discharging, and power consumption by the power management system. The terminal structure shown in fig. 8 does not constitute a limitation of the terminal, and the terminal may include more or less components than shown, or may combine certain components, or may be arranged in different components, which will not be described in detail herein.
It should be appreciated that in embodiments of the present application, the input unit 804 may include a graphics processor (Graphics Processing Unit, GPU) 8041 and a microphone 8042, with the graphics processor 8041 processing image data of still pictures or video obtained by an image capturing device (e.g., a camera) in a video capturing mode or an image capturing mode. The display unit 806 may include a display panel 8061, and the display panel 8061 may be configured in the form of a liquid crystal display, an organic light emitting diode, or the like. The user input unit 807 includes at least one of a touch panel 8071 and other input devices 8072. Touch panel 8071, also referred to as a touch screen. The touch panel 8071 may include two parts, a touch detection device and a touch controller. Other input devices 8072 may include, but are not limited to, a physical keyboard, function keys (e.g., volume control keys, switch keys, etc.), a trackball, a mouse, a joystick, and so forth, which are not described in detail herein.
In the embodiment of the present application, after receiving downlink data from the network side device, the radio frequency unit 801 may transmit the downlink data to the processor 88 for processing; the radio frequency unit 801 may send uplink data to the network side device. In general, the radio frequency unit 801 includes, but is not limited to, an antenna, an amplifier, a transceiver, a coupler, a low noise amplifier, a duplexer, and the like.
The memory 809 may be used to store software programs or instructions and various data. The memory 809 may mainly include a first storage area storing programs or instructions and a second storage area storing data, wherein the first storage area may store an operating system, application programs or instructions (such as a sound playing function, an image playing function, etc.) required for at least one function, and the like. Further, the memory 809 may include volatile memory or nonvolatile memory, or the memory 809 may include both volatile and nonvolatile memory. The nonvolatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable EPROM (EEPROM), or a flash Memory. The volatile memory may be random access memory (Random Access Memory, RAM), static random access memory (STATIC RAM, SRAM), dynamic random access memory (DYNAMIC RAM, DRAM), synchronous Dynamic Random Access Memory (SDRAM), double data rate Synchronous dynamic random access memory (Double DATA RATE SDRAM, DDRSDRAM), enhanced Synchronous dynamic random access memory (ENHANCED SDRAM, ESDRAM), synchronous link dynamic random access memory (SYNCH LINK DRAM, SLDRAM), and Direct random access memory (DRRAM). Memory 809 in embodiments of the application includes, but is not limited to, these and any other suitable types of memory.
The processor 810 may include one or more processing units; optionally, the processor 810 integrates an application processor that primarily processes operations involving an operating system, user interface, application programs, etc., and a modem processor that primarily processes wireless communication signals, such as a baseband processor. It will be appreciated that the modem processor described above may not be integrated into the processor 810.
The processor 801 is configured to perform the following operations:
Obtaining geometric information of a point cloud to be encoded;
Generating a bounding box corresponding to the point cloud to be encoded according to the geometric information of the point cloud to be encoded;
For each node to be encoded, determining a maximum of N encoded nodes associated with the node to be encoded according to node parameters corresponding to the point cloud to be encoded;
Generating context information corresponding to the nodes to be coded according to the occupation information of the at most N coded nodes;
And performing geometric coding on the node to be coded based on the context information corresponding to the node to be coded, and generating a target code stream.
Or the processor 801 is further configured to:
Obtaining a target code stream;
decoding the target code stream to obtain a point cloud to be decoded;
for each node to be decoded, determining a maximum of N decoded nodes associated with the node to be decoded according to node parameters corresponding to the point cloud to be decoded;
Generating context information corresponding to the nodes to be decoded according to the occupation information of the at most N decoded nodes;
And performing geometric decoding on the node to be decoded based on the context information corresponding to the node to be decoded, and generating reconstruction geometric information corresponding to the point cloud to be decoded.
The embodiment of the present application further provides a readable storage medium, where a program or an instruction is stored, where the program or the instruction implements each process of the above-mentioned geometric coding method embodiment or implements each process of the above-mentioned geometric decoding method embodiment when executed by a processor, and the process can achieve the same technical effect, so that repetition is avoided and no further description is given here.
Wherein the processor is a processor in the terminal described in the above embodiment. The readable storage medium includes computer readable storage medium such as computer readable memory ROM, random access memory RAM, magnetic or optical disk, etc.
The embodiment of the application further provides a chip, which comprises a processor and a communication interface, wherein the communication interface is coupled with the processor, and the processor is used for running programs or instructions to realize the processes of the embodiment of the geometric coding method or to realize the processes of the embodiment of the geometric decoding method, and can achieve the same technical effects, so that repetition is avoided, and no redundant description is provided here.
It should be understood that the chips referred to in the embodiments of the present application may also be referred to as system-on-chip chips, or the like.
The embodiments of the present application further provide a computer program/program product stored in a storage medium, where the computer program/program product is executed by at least one processor to implement each process of the above-mentioned geometric coding method embodiment, or implement each process of the above-mentioned geometric decoding method embodiment, and achieve the same technical effects, so that repetition is avoided, and no further description is given here.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element. Furthermore, it should be noted that the scope of the methods and apparatus in the embodiments of the present application is not limited to performing the functions in the order shown or discussed, but may also include performing the functions in a substantially simultaneous manner or in an opposite order depending on the functions involved, e.g., the described methods may be performed in an order different from that described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art in the form of a computer software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) comprising instructions for causing a terminal (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the method according to the embodiments of the present application.
The embodiments of the present application have been described above with reference to the accompanying drawings, but the present application is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and many forms may be made by those having ordinary skill in the art without departing from the spirit of the present application and the scope of the claims, which are to be protected by the present application.
Claims (22)
1. A geometric coding method, comprising:
the method comprises the steps that an encoding end obtains geometric information of a point cloud to be encoded;
The encoding end generates a bounding box corresponding to the point cloud to be encoded according to the geometric information of the point cloud to be encoded; the bounding box comprises at least two nodes to be encoded, and the nodes to be encoded are determined based on multi-tree division of the bounding box;
the encoding end determines a maximum of N encoded nodes associated with each node to be encoded according to node parameters corresponding to the point cloud to be encoded, wherein the node to be encoded is a non-initial node in the point cloud to be encoded, and N is an integer greater than or equal to 1;
The encoding end generates context information corresponding to the node to be encoded according to the occupation information of the maximum N encoded nodes;
And the encoding end performs geometric encoding on the node to be encoded based on the context information corresponding to the node to be encoded, and generates a target code stream.
2. The method according to claim 1, wherein the node parameters are used for characterizing the number of encoded nodes, and wherein the determining a maximum of N encoded nodes associated with the node to be encoded according to the node parameters corresponding to the point cloud to be encoded includes:
The encoding end determines a maximum of N encoded nodes with the encoding sequence positioned in front of the node to be encoded as a maximum of N encoded nodes associated with the node to be encoded based on the encoding sequence of the node to be encoded.
3. The method of claim 1, wherein the determining a maximum of N encoded nodes associated with the node to be encoded according to the node parameters corresponding to the point cloud to be encoded comprises:
The encoding end takes the geometric position corresponding to the node to be encoded as a search center, performs search operation on the point cloud to be encoded, and the search range of the search operation is determined based on the node parameters;
and the coding end determines the searched coded nodes as at most N coded nodes associated with the node to be coded.
4. A method according to any one of claims 1-3, wherein geometrically encoding the node to be encoded based on the context information corresponding to the node to be encoded, generating a target code stream comprises:
The encoding end encodes the context information corresponding to the node to be encoded through the context model corresponding to the point cloud to be encoded, generates a target code stream, and writes a model index into the target code stream; the model index is used for representing a context model corresponding to the point cloud to be encoded.
5. The method according to any of claims 1-4, wherein the node parameter is a parameter of a protocol contract or is determined based on pre-acquired indication information.
6. A method of geometric decoding comprising:
the decoding end obtains a target code stream;
The decoding end decodes the target code stream to obtain point cloud to be decoded, wherein the point cloud to be decoded comprises at least two nodes to be decoded;
The decoding end determines a maximum of N decoded nodes associated with each node to be decoded according to node parameters corresponding to the point cloud to be decoded, wherein the node to be decoded is a non-initial node in the point cloud to be decoded, and N is an integer greater than or equal to 1;
the decoding end generates context information corresponding to the nodes to be decoded according to the occupation information of the maximum N decoded nodes;
and the decoding end performs geometric decoding on the node to be decoded based on the context information corresponding to the node to be decoded, and generates reconstruction geometric information corresponding to the point cloud to be decoded.
7. The method of claim 6, wherein the node parameters are used to characterize a number of decoded nodes, and wherein the determining a maximum of N decoded nodes associated with the node to be decoded according to the node parameters corresponding to the point cloud to be decoded comprises:
And the decoding end determines a maximum of N decoded nodes with the decoding sequence positioned in front of the nodes to be decoded as a maximum of N decoded nodes associated with the nodes to be decoded based on the decoding sequence of the nodes to be decoded.
8. The method of claim 6, wherein the determining a maximum of N decoded nodes associated with the node to be decoded according to the node parameters corresponding to the point cloud to be decoded comprises:
The decoding end takes the geometric position corresponding to the node to be decoded as a search center, performs search operation on the point cloud to be decoded, and the search range of the search operation is determined based on the node parameters;
And the decoding end determines the searched decoded nodes as at most N decoded nodes associated with the nodes to be decoded.
9. The method according to any one of claims 6-8, wherein geometrically decoding the node to be decoded based on the context information corresponding to the node to be decoded, and generating the reconstructed geometry information corresponding to the point cloud to be decoded includes:
The decoding end decodes the context information corresponding to the node to be decoded through the context model corresponding to the point cloud to be decoded, and generates reconstruction geometry information corresponding to the point cloud to be decoded; the context model is determined based on a model index carried by the target code stream.
10. The method according to any of claims 6-9, wherein the parameters agreed by the node parameter protocol or the node parameters are determined based on indication information carried by the target code stream.
11. A geometric coding device, comprising:
the acquisition module is used for acquiring the geometric information of the point cloud to be encoded;
the first generation module is used for generating a bounding box corresponding to the point cloud to be encoded according to the geometric information of the point cloud to be encoded; the bounding box comprises at least two nodes to be encoded, and the nodes to be encoded are determined based on multi-tree division of the bounding box;
The determining module is used for determining a maximum of N coded nodes associated with each node to be coded according to the node parameters corresponding to the point cloud to be coded, wherein the node to be coded is a non-initial node in the point cloud to be coded, and N is an integer greater than or equal to 1;
the second generation module is used for generating context information corresponding to the nodes to be coded according to the occupation information of the at most N coded nodes;
and the third generating module is used for geometrically encoding the node to be encoded based on the context information corresponding to the node to be encoded, and generating a target code stream.
12. The apparatus according to claim 11, wherein the node parameter is used for characterizing the number of encoded nodes, and wherein the determining module is specifically configured to:
And determining a maximum N coded nodes with the coding sequence positioned in front of the node to be coded as a maximum N coded nodes associated with the node to be coded based on the coding sequence of the node to be coded.
13. The apparatus of claim 11, wherein the determining module is further specifically configured to:
Taking the geometric position corresponding to the node to be encoded as a search center, executing search operation on the point cloud to be encoded, wherein the search range of the search operation is determined based on the node parameters;
and determining the searched encoded nodes as at most N encoded nodes associated with the node to be encoded.
14. The apparatus according to any one of claims 11-13, wherein the third generating module is specifically configured to:
coding the context information corresponding to the node to be coded through the context model corresponding to the point cloud to be coded, generating a target code stream, and writing a model index into the target code stream; the model index is used for representing a context model corresponding to the point cloud to be encoded.
15. The apparatus according to any of claims 11-14, wherein the node parameter is a parameter of a protocol contract or is determined based on pre-acquired indication information.
16. A geometric decoding apparatus, comprising:
The acquisition module is used for acquiring the target code stream;
The decoding module is used for decoding the target code stream to obtain point clouds to be decoded, and the point clouds to be decoded comprise at least two nodes to be decoded;
The determining module is used for determining a maximum of N decoded nodes associated with each node to be decoded according to the node parameters corresponding to the point cloud to be decoded, wherein the node to be decoded is a non-initial node in the point cloud to be decoded, and N is an integer greater than or equal to 1;
the first generation module is used for generating context information corresponding to the nodes to be decoded according to the occupation information of the at most N decoded nodes;
and the second generation module is used for performing geometric decoding on the node to be decoded based on the context information corresponding to the node to be decoded, and generating reconstruction geometric information corresponding to the point cloud to be decoded.
17. The apparatus according to claim 16, wherein the node parameter is used for characterizing the number of decoded nodes, and wherein the determining module is specifically configured to:
And determining a maximum N decoded nodes with the decoding sequence positioned in front of the node to be decoded as a maximum N decoded nodes associated with the node to be decoded based on the decoding sequence of the node to be decoded.
18. The apparatus of claim 16, wherein the determining module is further specifically configured to:
taking the geometric position corresponding to the node to be decoded as a search center, executing search operation on the point cloud to be decoded, and determining the search range of the search operation based on the node parameters;
And determining the searched decoded nodes as at most N decoded nodes associated with the nodes to be decoded.
19. The apparatus according to any one of claims 16-18, wherein the second generating module is specifically configured to:
Decoding the context information corresponding to the node to be decoded through the context model corresponding to the point cloud to be decoded, and generating reconstruction geometry information corresponding to the point cloud to be decoded; the context model is determined based on a model index carried by the target code stream.
20. The apparatus according to any of claims 16-19, wherein the parameters agreed by the node parameter protocol or the node parameters are determined based on indication information carried by the target code stream.
21. A terminal comprising a processor and a memory storing a program or instructions executable on the processor, which when executed by the processor, performs the steps of the geometric coding method according to any one of claims 1 to 5, or performs the steps of the geometric decoding method according to any one of claims 6 to 10.
22. A readable storage medium, characterized in that the readable storage medium has stored thereon a program or instructions which, when executed by a processor, implement the steps of the geometric encoding method according to any of claims 1-5 or the steps of the geometric decoding method according to any of claims 6-10.
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202211583723.XA CN118175341A (en) | 2022-12-09 | 2022-12-09 | Geometric coding method, geometric decoding method and terminal |
PCT/CN2023/136035 WO2024120326A1 (en) | 2022-12-09 | 2023-12-04 | Geometric coding method, geometric decoding method and terminal |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202211583723.XA CN118175341A (en) | 2022-12-09 | 2022-12-09 | Geometric coding method, geometric decoding method and terminal |
Publications (1)
Publication Number | Publication Date |
---|---|
CN118175341A true CN118175341A (en) | 2024-06-11 |
Family
ID=91349563
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202211583723.XA Pending CN118175341A (en) | 2022-12-09 | 2022-12-09 | Geometric coding method, geometric decoding method and terminal |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN118175341A (en) |
WO (1) | WO2024120326A1 (en) |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10904564B2 (en) * | 2018-07-10 | 2021-01-26 | Tencent America LLC | Method and apparatus for video coding |
EP3595180B1 (en) * | 2018-07-10 | 2021-12-08 | BlackBerry Limited | Methods and devices for neighbourhood-based occupancy prediction in point cloud compression |
MX2022011469A (en) * | 2020-03-20 | 2022-11-16 | Guangdong Oppo Mobile Telecommunications Corp Ltd | Point cloud encoding method and decoding method, encoder and decoder, and storage medium. |
CN112565795B (en) * | 2020-12-03 | 2022-10-04 | 西安电子科技大学 | Point cloud geometric information encoding and decoding method |
CN115131449A (en) * | 2022-06-18 | 2022-09-30 | 腾讯科技(深圳)有限公司 | Point cloud processing method and device, computer equipment and storage medium |
-
2022
- 2022-12-09 CN CN202211583723.XA patent/CN118175341A/en active Pending
-
2023
- 2023-12-04 WO PCT/CN2023/136035 patent/WO2024120326A1/en unknown
Also Published As
Publication number | Publication date |
---|---|
WO2024120326A1 (en) | 2024-06-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2022257970A1 (en) | Point cloud geometric information encoding processing method, decoding processing method, and related device | |
WO2022257968A1 (en) | Point cloud coding method, point cloud decoding method, and terminal | |
WO2022257969A1 (en) | Point cloud coding method, decoding method, and related device | |
CN109413152B (en) | Image processing method, image processing device, storage medium and electronic equipment | |
US20240121439A1 (en) | Point cloud attribute information encoding method and apparatus, point cloud attribute information decoding method and apparatus, and related device | |
WO2022257978A1 (en) | Point cloud coding method and apparatus, and point cloud decoding method and apparatus | |
CN118175341A (en) | Geometric coding method, geometric decoding method and terminal | |
WO2024120325A1 (en) | Point cloud coding method, point cloud decoding method, and terminal | |
WO2023098802A1 (en) | Point cloud attribute encoding method, point cloud attribute decoding method, and terminal | |
WO2023098801A1 (en) | Point cloud attribute encoding method, point cloud decoding method, and terminal | |
CN118175333A (en) | Attribute transformation decoding method, attribute transformation encoding method and terminal | |
WO2024149182A1 (en) | Transform coefficient encoding method, transform coefficient decoding method and terminal | |
CN118175334A (en) | Attribute transformation coding method, attribute transformation decoding method and terminal | |
WO2023155779A1 (en) | Encoding method, decoding method, apparatus, and communication device | |
WO2024149142A1 (en) | Transform coefficient encoding method, transform coefficient decoding method, and terminal | |
WO2024217303A1 (en) | Transform coefficient coding method, transform coefficient decoding method, and terminal | |
WO2023098803A1 (en) | Point cloud encoding processing method, point cloud decoding processing method and related device | |
WO2024146591A1 (en) | List creating method and terminal | |
CN116614623A (en) | Predictive encoding method, predictive decoding method and terminal | |
CN118678075A (en) | Point cloud coding processing method, point cloud decoding processing method and related equipment | |
CN118827996A (en) | Image processing method and terminal | |
CN116233387A (en) | Point cloud coding and decoding methods, devices and communication equipment | |
CN116366841A (en) | Loop filtering method and terminal | |
CN116962686A (en) | Inter-frame prediction method and terminal |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination |