3D Point Cloud Encoding via Subspace Segmentation

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

There is a demand to reduce the data volume of bitstreams in encoding and decoding of three-dimensional data, as existing methods do not efficiently manage the large amounts of data associated with point cloud representations.

Innovation Solution

A three-dimensional data encoding method that divides a current space containing three-dimensional points into subspaces, generates encoded data by encoding these subspaces, and creates a bitstream including the encoded data and additional information indicating the structure of each subspace, thereby reducing data volume by omitting unnecessary information for subspaces with no points.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If point cloud data is encoded using conventional methods, then the three-dimensional data can be represented, but the data volume of the bitstream becomes excessively large

Engineering Contradiction:

Improvedata volumeVSAvoidinformation completeness

Core Design Contradiction:

Quantity of substanceVSLoss of information

Solution Approach 1:

The current space containing three-dimensional points is divided into multiple subspaces. Each subspace is encoded separately, allowing selective omission of information for subspaces containing no points. This segmentation enables efficient data compression while maintaining the integrity of the overall three-dimensional data representation.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent extracts and omits unnecessary information specifically for subspaces that contain no points. By identifying and excluding redundant data corresponding to empty subspaces, the bitstream volume is reduced without losing essential three-dimensional data information.

Inventive Principle:

Principle #2Taking out (Extraction)

2Reliability

If all subspace information is encoded, then complete three-dimensional data representation is achieved, but the bitstream size increases unnecessarily

Engineering Contradiction:

Improvedata integrityVSAvoidbitstream size

Core Design Contradiction:

ReliabilityVSQuantity of substance

Solution Approach 1:

Different encoding strategies are applied to different subspaces based on their local characteristics. Subspaces containing points are encoded with full information to maintain data integrity, while subspaces containing no points have their information omitted. This local differentiation achieves both data reliability and compression efficiency.

Inventive Principle:

Principle #3Local quality

Data Source

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

Publication Date: 2025.01.23 PANASONIC INTELLECTUAL PROPERTY CORP OF AMERICA

AI summary

A three-dimensional data encoding method includes: generating pieces of encoded data by encoding subspaces obtained by dividing a current space including three-dimensional points; and generating a bitstream including the pieces of encoded data and pieces of first information each of which corresponds to a corresponding one of the subspaces. Each of the pieces of first information indicates whether the bitstream includes second information indicating a structure of the corresponding one of the subspaces.