# US 2025/0148652 A1 · Method, apparatus, and medium for point cloud coding > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2025/0148652 A1 - Document ID: US20250148652A1 - Status: Published application - Kind: A1 - Application number: 19/015,338 - Filed: 2025-01-09 - Published: 2025-05-08 - Earliest claimed: 2022-07-09 - Assignees: Douyin Vision (Beijing) Co., Ltd.; Bytedance Inc. - Applicants: Douyin Vision (Beijing) Co., Ltd.; Bytedance Inc. - Inventors: Wenyi WANG; Yingzhan XU; Kai ZHANG; Li ZHANG - Web page: https://patentgrep.com/patent/US20250148652A1 ## CPC - G06T 9/001: {Model-based coding, e.g. wire frame} - H04N 19/597: specially adapted for multi-view video sequence encoding - H04N 19/96: Tree coding, e.g. quad-tree coding - G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION ## Abstract Embodiments of the present disclosure provide a solution for point cloud coding. A method for point cloud coding is proposed. The method comprises: determining, for a conversion between a current frame of a point cloud sequence and a bitstream of the point cloud sequence, first attribute information of a first node of the current frame based on second attribute information of a second node of the current frame, a node representing a spatial partition of the current frame, a first partition depth of the first node being different from a second partition depth of the second node; and performing the conversion based on the first attribute information. ## Claims ### Claim 1 A method for point cloud coding, comprising: determining, for a conversion between a current frame of a point cloud sequence and a bitstream of the point cloud sequence, at least one neighbour sub-node of a current node of the current frame, a node representing a spatial partition of the current frame, a sub-node being a portion of a node; determining first attribute information of a sub-node of the current node based on at least one second attribute information of the at least one neighbour sub-node; and performing the conversion based on the first attribute information. ### Claim 2 (depends on 1) The method of claim 1, wherein the at least one neighbour sub-node of the current node comprises a plurality of sub-nodes of a neighbour node of the current node. ### Claim 3 (depends on 2) The method of claim 2, wherein the neighbour node shares at least one of the following with the sub-node of the current node: a face, an edge or a vertex, and/or wherein the neighbour node shares at least one of the following with the current node: a face, an edge or a vertex. ### Claim 4 (depends on 2) The method of claim 2, further comprising: revising third attribute information of the neighbour node based on the at least one second attribute information of the at least one neighbour sub-node. ### Claim 5 (depends on 4) The method of claim 4, wherein revising the third attribute information of the neighbour node comprises: if a neighbour sub-node of the at least one neighbour sub-node shares at least one of the following with the sub-node of the current node: a face, an edge, or a vertex, revising the third attribute information. ### Claim 6 (depends on 4) The method of claim 4, wherein revising the third attribute information of the neighbour node comprises: replacing the third attribute information with the at least one second attribute information. ### Claim 7 (depends on 1) The method of claim 1, wherein a processing operation is applied to the at least one neighbour sub-node of the current node before being applied to the sub-node of the current node. ### Claim 8 (depends on 7) The method of claim 7, wherein the processing operation comprises one of: an encoding operation, or a decoding operation. ### Claim 9 (depends on 7) The method of claim 7, wherein the processing operation comprises one of: a transformation operation, or an inverse transformation operation. ### Claim 10 (depends on 1) The method of claim 1, wherein the at least one neighbour sub-node of the current node share at least one of the following with the sub-node of the current node: a face, an edge or a vertex, and/or wherein the at least one neighbour sub-node of the current node share at least one of the following with the current node: a face, an edge or a vertex. ### Claim 11 (depends on 1) The method of claim 1, wherein first information regarding whether to use a prediction of the at least one attribute information of the at least one neighbour sub-node during the conversion is included in the bitstream. ### Claim 12 (depends on 1) The method of claim 1, further comprising: determining first information regarding whether to use a prediction of the at least one attribute information of the at least one neighbour sub-node during the conversion. ### Claim 13 (depends on 1) The method of claim 1, wherein the at least one neighbour sub-node comprises a plurality of neighbour sub-nodes, and second information regarding a target neighbour sub-node in the plurality of neighbour sub-nodes is included in the bitstream, a prediction of second attribute information of the target neighbour sub-node being used during the conversion. ### Claim 14 (depends on 1) The method of claim 1, wherein the at least one neighbour sub-node comprises a plurality of neighbour sub-nodes, and the method further comprises: determining second information regarding a target neighbour sub-node in the plurality of neighbour sub-nodes, a prediction of second attribute information of the target neighbour sub-node being used during the conversion. ### Claim 15 (depends on 1) The method of claim 1, wherein a first neighbour sub-node of the at least one neighbour sub-node is adjacent to the current node. ### Claim 16 (depends on 1) The method of claim 1, wherein a second neighbour sub-node of the at least one neighbour sub-node is non-adjacent to the current node. ### Claim 17 (depends on 1) The method of claim 1, wherein the conversion includes encoding the current frame into the bitstream, and/or wherein the conversion includes decoding the current frame from the bitstream. ### Claim 18 An apparatus for processing point cloud data comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: determine, for a conversion between a current frame of a point cloud sequence and a bitstream of the point cloud sequence, at least one neighbour sub-node of a current node of the current frame, a node representing a spatial partition of the current frame, a sub-node being a portion of a node; determine first attribute information of a sub-node of the current node based on at least one second attribute information of the at least one neighbour sub-node; and perform the conversion based on the first attribute information. ### Claim 19 A non-transitory computer-readable storage medium storing instructions that cause a processor to: determine, for a conversion between a current frame of a point cloud sequence and a bitstream of the point cloud sequence, at least one neighbour sub-node of a current node of the current frame, a node representing a spatial partition of the current frame, a sub-node being a portion of a node; determine first attribute information of a sub-node of the current node based on at least one second attribute information of the at least one neighbour sub-node; and perform the conversion based on the first attribute information. ### Claim 20 A non-transitory computer-readable recording medium storing a bitstream of a point cloud sequence which is generated by a method performed by a point cloud processing apparatus, wherein the method comprises: determining at least one neighbour sub-node of a current node of a current frame of the point cloud sequence, a node representing a spatial partition of the current frame, a sub-node being a portion of a node; determining first attribute information of a sub-node of the current node based on at least one second attribute information of the at least one neighbour sub-node; and generating the bitstream based on the first attribute information.