Point Cloud Tree Compression With Azimuthal Prediction Contexts

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing point cloud compression methods, particularly in tree-based structures, face challenges in efficiently encoding and decoding the geometry of sparsely populated point clouds, leading to high computational burden and inefficient use of bandwidth and storage due to the recursive splitting of sub-volumes and the signaling of isolated points.

Innovation Solution

The method employs azimuthal prediction angles and angular contexts to encode and decode point clouds using a predicted point tree structure, incorporating planar coding modes and inferred direct coding modes to improve compression efficiency, especially for LiDAR-acquired point clouds with strong directionality.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of substance

If tree-based compression methods are used for point clouds, then compression ratio is improved, but computational burden increases due to recursive splitting of sub-volumes

Engineering Contradiction:
Improvedata sizeVSAvoidcomputational burden
Core Design Contradiction:
Loss of substanceVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by performing azimuthal prediction using previously decoded nodes before encoding the current node. The encoder determines azimuthal prediction angles from closest previously decoded nodes and uses these to predict occupancy of child nodes, avoiding the need to recursively split and examine all sub-volumes. This preliminary prediction step reduces computational burden while maintaining compression effectiveness.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent implements self-service through inferred direct coding mode where isolated points are automatically identified and encoded without requiring manual intervention or complex recursive processing. The system uses azimuthal prediction to self-identify isolated points based on the absence of occupancy in predicted child nodes, enabling automatic compression of sparsely populated regions with reduced computational effort.

Inventive Principle:
Principle #25Self-service

2Loss of substance

If traditional tree-based encoding is used, then compression is achieved, but bandwidth efficiency deteriorates due to signaling of isolated points

Engineering Contradiction:
Improvedata sizeVSAvoidbandwidth efficiency
Core Design Contradiction:
Loss of substanceVSLoss of energy

Solution Approach 1:

The patent extracts isolated points from the traditional tree-based encoding process by using azimuthal prediction to identify them separately. Instead of signaling all nodes through recursive splitting, the method extracts and specially handles isolated points using inferred direct coding mode, where occupancy is inferred from azimuthal prediction results. This extraction approach reduces the number of signals required and improves bandwidth efficiency.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent changes the encoding parameter approach by introducing azimuthal prediction angles and using them to determine occupancy of child nodes. Instead of using fixed recursive splitting parameters, the system dynamically adjusts encoding based on azimuthal prediction results, changing from a uniform tree-based approach to a directionality-aware approach that reduces signaling overhead for isolated points.

Inventive Principle:
Principle #35Parameter changes

3Manufacturing precision

If recursive splitting of sub-volumes is performed, then encoding accuracy is improved, but processing time increases

Engineering Contradiction:
Improveencoding accuracyVSAvoidprocessing time
Core Design Contradiction:
Manufacturing precisionVSLoss of time

Solution Approach 1:

The patent applies preliminary action by performing azimuthal prediction before full recursive encoding. The encoder uses azimuthal prediction angles from previously decoded nodes to predict which child nodes will be occupied, allowing it to skip recursive splitting of obviously empty nodes. This preliminary prediction maintains encoding accuracy for occupied regions while reducing processing time by avoiding unnecessary recursion into empty sub-volumes.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent implements partial action by performing recursive splitting only for nodes that are predicted to be occupied based on azimuthal prediction. Instead of recursively splitting all sub-volumes to ensure complete encoding accuracy, the method applies partial recursion only where needed, maintaining sufficient encoding accuracy while significantly reducing processing time for sparsely populated point clouds.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS20250252611A1Method and system for azimuthal angular prior and tree repesentation for cloud compression
Publication Date: 2025.08.07 BLACKBERRY LTD
  • US20250252611A1 patent drawing
  • US20250252611A1 patent drawing
  • US20250252611A1 patent drawing

AI summary

A method of encoding or decoding a point cloud to representing a three-dimensional location of an object, the point cloud being located within a volumetric space, the method including determining at least one closest, relative to azimuthal distance, encoded node to a current node; determining an azimuthal prediction angle for each of the at least one closest encoded node; finding an averaged azimuthal prediction angle from the determined azimuthal prediction angle for each of the at least one closest encoded node; selecting an angular azimuthal context based on the averaged azimuthal predication angle; encoding information representative of the current node based on the azimuthal context to generate the bitstream of compressed point cloud data or decoding information representative of the current node based on the azimuthal context to generate the point cloud data.