3D Point Cloud Encoding With Same-Parent Node Referencing

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing three-dimensional data encoding methods face challenges in improving coding efficiency and reducing processing amounts, particularly in the context of point cloud compression.

Innovation Solution

A three-dimensional data encoding and decoding method that utilizes an N-ary tree structure, allowing reference to information of neighboring nodes with the same parent node while prohibiting reference to nodes with different parent nodes, thereby optimizing coding efficiency and reducing processing requirements.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If reference is made to all neighboring nodes in three-dimensional data encoding, then coding efficiency is improved, but processing amount increases

Engineering Contradiction:

Improvecoding efficiencyVSAvoidprocessing amount

Core Design Contradiction:

ProductivityVSLoss of time

Solution Approach 1:

The patent applies local quality by differentiating between two types of neighboring nodes: nodes with the same parent node (first neighboring nodes) and nodes with different parent nodes (second neighboring nodes). The encoding process selectively references only the first neighboring nodes, which have higher local correlation with the current node, while excluding the second neighboring nodes. This localized referencing strategy improves coding efficiency by focusing on the most relevant data while reducing processing amount by excluding unnecessary nodes.

Inventive Principle:

Principle #3Local quality

2Quantity of substance

If compression of three-dimensional data is implemented, then data transmission efficiency is improved, but coding complexity increases

Engineering Contradiction:

Improvedata compression ratioVSAvoidcoding complexity

Core Design Contradiction:

Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent segments the three-dimensional data into an N-ary tree structure where nodes are organized in hierarchical generations. The encoding process processes nodes in a specific order (e.g., depth-first or breadth-first traversal), dividing the complex compression task into manageable segments. By segmenting the data structure and processing order, the patent achieves effective compression while maintaining manageable coding complexity through systematic, ordered processing.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent implements preliminary action by performing prediction and reference operations on neighboring nodes before encoding the current node. The encoder prepares reference information from first neighboring nodes (nodes with the same parent) in advance, which facilitates more efficient compression. This preliminary preparation of reference data reduces the computational burden during the actual encoding phase, balancing compression ratio with coding complexity.

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS12532034B2Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device

Publication Date: 2026.01.20 PANASONIC INTELLECTUAL PROPERTY CORP OF AMERICA

AI summary

A three-dimensional data encoding method includes encoding information of a current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, where N is an integer greater than or equal to 2. In the encoding, reference to information of a first node included in neighboring nodes spatially neighboring the current node is permitted, and reference to information of a second node included in the neighboring nodes is prohibited, the first node having a same parent node as the current node, the second node having a different parent node from the parent node of the current node.