3D Point Cloud Sub-Cloud Encoding for Faster Selective Decoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing methods for encoding and decoding three-dimensional data are inefficient, leading to prolonged processing times.

Innovation Solution

The method involves dividing three-dimensional data into independent sub-clouds, appending space information to each sub-cloud's header, and encoding them separately to allow for parallel decoding and selective decoding of each sub-cloud.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of energy

If three-dimensional data is encoded as a single integrated point cloud, then compression efficiency is improved, but processing time increases

Engineering Contradiction:
Improvecompression efficiencyVSAvoidprocessing time
Core Design Contradiction:
Loss of energyVSLoss of time

Solution Approach 1:

The patent divides the three-dimensional point cloud into multiple independent sub-clouds based on spatial regions. Each sub-cloud is encoded separately with its own header containing space information, enabling parallel processing while maintaining compression efficiency through independent encoding of each segment

Inventive Principle:
Principle #1Segmentation

2Reliability

If three-dimensional data is processed as a single unit, then data integrity is maintained, but decoding flexibility is reduced

Engineering Contradiction:
Improvedata integrityVSAvoiddecoding flexibility
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent segments the three-dimensional data into independent sub-clouds, each with its own header containing space information. This segmentation allows selective decoding of specific sub-clouds based on spatial regions of interest while maintaining overall data integrity through proper header structure and independent encoding of each segment

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies local quality by enabling different decoding operations on different sub-clouds based on their spatial locations. Each sub-cloud can be decoded independently with appropriate parameters, allowing optimized processing for different spatial regions while maintaining consistency through the header structure

Inventive Principle:
Principle #3Local quality

3Productivity

If three-dimensional data is divided into sub-clouds for parallel processing, then processing time is reduced, but data structure complexity increases

Engineering Contradiction:
Improveprocessing speedVSAvoiddata structure complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent implements segmentation by dividing the point cloud into sub-clouds with proper spatial organization. The data structure uses hierarchical organization with headers containing space information, enabling parallel processing while managing complexity through structured metadata that describes each sub-cloud's spatial characteristics

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent creates a universal data structure that can handle both single-unit encoding and multi-sub-cloud parallel encoding. The header structure with space information serves multiple purposes: defining spatial regions, enabling parallel processing, and maintaining data integrity, thus reducing overall system complexity despite the segmented approach

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS20250384592A1Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device
Publication Date: 2025.12.18 PANASONIC INTELLECTUAL PROPERTY CORP OF AMERICA
  • US20250384592A1 patent drawing
  • US20250384592A1 patent drawing
  • US20250384592A1 patent drawing

AI summary

A three-dimensional data encoding method includes: dividing three-dimensional points included in three-dimensional data into three-dimensional point sub-clouds including a first three-dimensional point sub-cloud and a second three-dimensional point sub-cloud; appending first information indicating a space of the first three-dimensional point sub-cloud to a header of the first three-dimensional point sub-cloud, and appending second information indicating a space of the second three-dimensional point sub-cloud to a header of the second three-dimensional point sub-cloud; and encoding the first three-dimensional point sub-cloud and the second three-dimensional point sub-cloud so that the first three-dimensional point sub-cloud and the second three-dimensional point sub-cloud are decodable independently of each other.