Adaptive Point Cloud Attribute Coding for Efficient Compression

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current graph-based point cloud compression (G-PCC) methods ignore local point distribution when generating levels of detail (LoD), leading to inefficient compression and representation of 3D point clouds, particularly in applications requiring real-time communication and dynamic mapping.

Innovation Solution

Adaptive point cloud attribute coding method that determines a centroid of candidate points and selects points closest to it for lower LoD layers, while excluding them from upper layers, thereby considering local point statistics for more optimal LoD layer generation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If fixed-rate regular sampling is used to generate LoD layers, then the global point distribution is captured, but the local point distribution is ignored resulting in inefficient compression

Engineering Contradiction:
Improveglobal point distribution captureVSAvoidcompression efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent applies local quality by transitioning from uniform fixed-rate sampling to adaptive sampling that considers local point distribution characteristics. The method calculates local density metrics for different regions of the point cloud and adjusts sampling rates accordingly, allowing higher sampling in dense regions and lower sampling in sparse regions, thereby improving compression efficiency while maintaining representation quality.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The patent implements dynamics by making the sampling rate adaptive rather than static. The sampling strategy dynamically adjusts based on local point density calculations, where the sampling rate varies across different spatial regions according to their specific characteristics, enabling the system to respond to local variations in point distribution.

Inventive Principle:
Principle #15Dynamics

2Productivity

If distance-based sampling is used for LoD generation, then local point distribution is considered, but the complexity of determining optimal sample points increases

Engineering Contradiction:
Improvecompression efficiencyVSAvoidsampling algorithm complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by pre-calculating local density metrics and identifying optimal sample points before the actual compression process. The method performs initial analysis to determine regions of high and low density, pre-selects representative points, and prepares sampling strategies in advance, reducing the computational burden during real-time compression operations.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent implements self-service by enabling the point cloud data structure to guide its own sampling process. The algorithm uses intrinsic properties of the point cloud (such as spatial coordinates and density distributions) to automatically determine sampling rates and select sample points without requiring external intervention or complex manual configuration.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS11140395B2Method and apparatus for adaptive point cloud attribute coding
Publication Date: 2021.10.05 TENCENT AMERICA LLC
  • US11140395B2 patent drawing
  • US11140395B2 patent drawing
  • US11140395B2 patent drawing

AI summary

A method of adaptive point cloud attribute coding is performed by at least one processor and includes determining a centroid of k candidate points of a point cloud, k being a predetermined sampling rate of all points of the point cloud, and selecting one of the k candidate points that is closest to the centroid. The method further includes determining a first levels-of-detail (LoD) layer comprising the one of the k candidate points, and a second LoD layer without the one of the k candidate points, and performing coding of attributes of the all points, based on the first LoD layer and the second LoD layer.