Point Cloud Coding Node Attribute Prediction Across Partition Depths

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing point cloud coding techniques have limitations in coding efficiency, particularly in predicting attribute information across nodes with different partition depths and in utilizing attribute information from neighbor nodes effectively.

Innovation Solution

The proposed method improves point cloud coding efficiency by predicting attribute information of a node based on attribute information of another node with a different partition depth, and by using attribute information from neighbor nodes to enhance coding performance.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If attribute information is predicted based on nodes with different partition depths, then coding efficiency is improved, but prediction accuracy may deteriorate due to spatial heterogeneity

Engineering Contradiction:
Improvecoding efficiencyVSAvoidprediction accuracy
Core Design Contradiction:
ProductivityVSMeasurement precision

Solution Approach 1:

The patent applies local quality by differentiating prediction strategies based on spatial location and partition depth. Different weights are assigned to neighboring nodes at different depths, and the prediction process adapts to the specific spatial context of each node being predicted. This allows the system to capture local spatial relationships while accounting for the hierarchical structure of the point cloud partitioning.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The patent segments the prediction process into multiple stages by first identifying neighboring nodes at different partition depths, then selectively using their attribute information based on predefined rules. The segmentation of the prediction task into depth-based components allows efficient compression while maintaining accuracy through structured approach.

Inventive Principle:
Principle #1Segmentation

2Productivity

If attribute information from neighbor nodes is utilized, then coding effectiveness is improved, but computational complexity increases due to additional prediction operations

Engineering Contradiction:
Improvecoding effectivenessVSAvoidcomputational complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent performs preliminary action by pre-identifying and pre-calculating the set of neighboring nodes at different partition depths before the actual prediction process. This preliminary structure definition allows the prediction to proceed more efficiently by avoiding complex real-time calculations, thus reducing overall computational burden while maintaining effectiveness.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent changes parameters by introducing weight coefficients that can be adjusted based on the relative importance of different neighboring nodes. This parameter adjustment mechanism allows the system to optimize the balance between prediction accuracy and computational complexity by emphasizing more informative neighbors while downweighting less relevant ones.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS20250148652A1Method, apparatus, and medium for point cloud coding
Publication Date: 2025.05.08 DOUYIN VISION CO LTD
  • US20250148652A1 patent drawing
  • US20250148652A1 patent drawing
  • US20250148652A1 patent drawing

AI summary

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.