Hierarchical Transform Coding for Efficient Point Cloud Attribute Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing encoding methods for three-dimensional data, such as point clouds, face challenges in improving encoding efficiency.
Innovation Solution
The proposed solution involves calculating a predicted value of a first coefficient using an inter prediction scheme, obtaining a residual value from a bitstream, and performing inverse hierarchical transform to enhance encoding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If point cloud data is compressed for accumulation and transmission, then data storage and transmission efficiency is improved, but decoding complexity increases
Solution Approach 1:
The patent segments the point cloud data into multiple coding units and further divides each coding unit into multiple nodes organized in a tree structure. This segmentation allows for independent processing of different regions, enabling parallel decoding operations and reducing overall decoding complexity while maintaining compression efficiency.
Solution Approach 2:
The patent introduces a hierarchical tree structure dimension to organize the point cloud data, transforming the traditional flat data structure into a multi-level hierarchy. This dimensional change enables more efficient memory access patterns and allows the decoding process to operate at multiple levels of abstraction, reducing computational complexity.
2Productivity
If inter prediction scheme is applied to coefficients in hierarchical transform, then encoding efficiency is improved, but prediction accuracy requirements increase
Solution Approach 1:
The patent applies inter prediction selectively to different nodes in the hierarchical tree structure based on local characteristics. Rather than uniformly applying prediction to all coefficients, the method adapts the prediction process to local regions, using reference coding units that are spatially and hierarchically relevant, thereby reducing prediction accuracy requirements while maintaining encoding efficiency.
Solution Approach 2:
The patent introduces residual values as an intermediary between the predicted coefficients and the actual coefficients. The residual values capture the difference between prediction and actual data, allowing the system to achieve accurate reconstruction without requiring extremely high prediction accuracy, thus balancing encoding efficiency with prediction requirements.
Data Source
AI summary
A decoding method includes: calculating a predicted value of a first coefficient of a first node included in a first tree structure of a current coding unit by using an inter prediction scheme referring to a reference coding unit; obtaining a residual value of the first coefficient from a bitstream; calculating the first coefficient, based on the predicted value and the residual value; performing inverse hierarchical transform on the first coefficient; and calculating an attribute value of a three-dimensional point included in the current coding unit, based on a result of the inverse hierarchical transform.


