360-Degree Image Decoding with Selective Reference Expansion

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing image processing systems struggle with the massive data generated for 360-degree images in virtual and augmented reality, requiring improved performance in image encoding and decoding.

Innovation Solution

A method for encoding and decoding 360-degree images that includes generating a predicted image using syntax information, combining it with a residual image, and reconstructing the image in specific projection formats like ERP, CMP, OHP, and ISP, with image expansion based on partitioning units and motion information.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of energy

If conventional image encoding methods are used for 360-degree images, then the encoding process is simple, but the compression performance is insufficient for massive data

Engineering Contradiction:
Improvecompression performanceVSAvoidimage processing complexity
Core Design Contradiction:
Loss of energyVSDevice complexity

Solution Approach 1:

The patent divides the 360-degree image into multiple partitioning units (e.g., cube faces, rectangular regions) and processes each unit separately with appropriate encoding strategies. This segmentation allows the system to handle the massive data of 360-degree images in manageable chunks, improving compression performance while maintaining organized processing complexity

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transforms 360-degree spherical images into different projection formats (e.g., cube map projection, equirectangular projection) before encoding. This dimensional transformation enables conventional 2D encoding techniques to be applied effectively to 3D spherical data, significantly improving compression performance while the projection format selection provides flexibility to manage processing complexity

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Measurement precision

If image expansion is performed on the entire reference picture, then prediction accuracy improves, but processing time and complexity increase

Engineering Contradiction:
Improveprediction accuracyVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent performs image expansion only on specific partitioning units or regions that require prediction, rather than expanding the entire reference picture. This selective expansion approach maintains prediction accuracy for critical regions while significantly reducing processing time and computational complexity

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies different expansion strategies to different regions based on their importance and characteristics. High-priority regions with motion or prediction requirements receive full expansion treatment, while static or less important regions use simplified or no expansion, optimizing the balance between prediction accuracy and processing efficiency

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS12556744B2Image data encoding/decoding method and apparatus
Publication Date: 2026.02.17 INST OF IMAGE TECH INC
  • US12556744B2 patent drawing
  • US12556744B2 patent drawing
  • US12556744B2 patent drawing

AI summary

Disclosed are methods and apparatuses for image data encoding/decoding. A method of decoding an image includes receiving a bitstream in which the image is encoded; obtaining index information for specifying a block division type of a current block in the image; and determining the block division type of the current block from a candidate group pre-defined in the decoding apparatus. The candidate group includes a plurality of candidate division types, including at least one of a non-division, a first quad-division, a second quad-division, a binary-division or a triple-division. The method also includes dividing the current block into a plurality of sub-blocks; and decoding each of the sub-blocks with reference to syntax information obtained from the bitstream.