360-Degree Image Decoding Across Multi-Projection Block Structures
Find Innovative SolutionsGenerate 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 encoding and decoding methods.
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 Equi-Rectangular, CubeMap, OctaHedron, or IcoSahedral, with image expansion based on partitioning units and adjacent pixel information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional image encoding/decoding methods are used for 360-degree images, then the processing can be performed with standard algorithms, but the performance is insufficient when handling large data volumes of high-resolution images
Solution Approach 1:
The patent divides the 360-degree image into multiple projection formats (ERP, CMP, OHP, ISP) and processes different regions using appropriate decoding methods. The image is segmented into face regions, boundary regions, and transition regions, each handled with specific optimization techniques to improve overall processing performance while managing large data volumes.
Solution Approach 2:
The patent transforms the 360-degree image from spherical coordinate system to multiple 2D projection formats. This dimensionality change allows standard 2D image processing algorithms to be applied efficiently to the complex 360-degree data, significantly improving processing performance without sacrificing the immersive quality.
2Adaptability or versatility
If 360-degree images are projected into multiple formats (ERP, CMP, OHP, ISP), then versatility and adaptability are improved, but device complexity increases
Solution Approach 1:
The patent creates a universal decoding framework that can handle multiple projection formats (ERP, CMP, OHP, ISP) through a single integrated system. The decoder is designed to accept syntax information indicating the projection format and automatically applies the appropriate decoding algorithm, making the system multi-functional without requiring separate dedicated decoders for each format.
Solution Approach 2:
The patent performs preliminary classification of the projection format through syntax information extraction before the actual decoding process. This preliminary action allows the system to prepare the appropriate decoding pathway in advance, reducing runtime complexity and making the handling of multiple formats more efficient.
3Loss of energy
If region-wise packing and image expansion techniques are applied, then compression performance is enhanced, but the processing complexity in initial steps increases
Solution Approach 1:
The patent applies different processing techniques to different regions of the 360-degree image. Face regions use standard decoding, boundary regions use expansion techniques with reference to adjacent faces, and transition regions use specialized handling. This local quality approach optimizes compression efficiency for each region type while managing overall processing complexity through systematic regional classification.
Data Source
AI summary
Disclosed are methods and apparatuses for decoding an image. A method includes receiving a bitstream obtained by encoding the image; dividing a first coding block into a plurality of second coding blocks; generating a prediction block of a second coding block based on syntax information obtained from the bitstream; and reconstructing the second coding block based on the prediction block and a residual block of the second coding block, the residual block being obtained by performing a dequantization and an inverse-transform on quantized transform coefficients from the bitstream. The first coding block has a recursive division structure. The first coding block is divided based on at least one of a quad tree division, a binary tree division or a triple tree division.