Image Inter-Prediction Candidate Lists for HD/UHD Decoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing image encoding/decoding technologies face challenges in effectively determining and managing candidate lists for inter-prediction, particularly in high-definition and ultra-high-definition image processing, which affects image prediction performance and efficiency.

Innovation Solution

The method constructs candidate lists by adding candidates in a specific order, including spatially neighboring, temporally neighboring, and non-neighboring blocks, enhancing the prediction process through a structured approach.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If a candidate list for inter-prediction is constructed using conventional methods, then the encoding/decoding process can proceed, but the prediction performance is insufficient for high-definition and ultra-high-definition images

Engineering Contradiction:
Improveprediction performanceVSAvoidencoding/decoding efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The candidate list is segmented into multiple categories (spatial candidates, temporal candidates, combined candidates) with different construction methods. Each segment serves a specific prediction purpose, allowing the system to achieve high prediction performance for HD/UHD images while maintaining encoding efficiency through selective usage of different candidate types.

Inventive Principle:
Principle #1Segmentation

2Measurement precision

If various types of candidates are added to the candidate list to improve prediction accuracy, then the prediction performance improves, but the complexity of managing the candidate list increases

Engineering Contradiction:
Improveprediction accuracyVSAvoidcandidate list management complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The candidate list construction is made dynamic through adaptive selection of candidate types and numbers based on block characteristics, picture type, and motion complexity. The system can flexibly adjust the composition of spatial, temporal, and combined candidates to optimize prediction accuracy while keeping management complexity manageable through context-based adaptation.

Inventive Principle:
Principle #15Dynamics

3Productivity

If a simple candidate list construction method is used, then the encoding/decoding process is fast, but the image compression efficiency is reduced

Engineering Contradiction:
Improveencoding/decoding speedVSAvoidcompression efficiency
Core Design Contradiction:
ProductivityVSLoss of energy

Solution Approach 1:

Candidate lists are constructed in advance during the encoding process with pre-organized spatial, temporal, and combined candidates. This preliminary construction allows the decoder to quickly retrieve and use appropriate candidates without performing complex searches, thereby maintaining high encoding/decoding speed while achieving improved compression efficiency through better prediction accuracy.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS20250247547A1Image encoding/decoding method, device, and recording medium for storing bitstream
Publication Date: 2025.07.31 ELECTRONICS & TELECOMM RES INST
  • US20250247547A1 patent drawing
  • US20250247547A1 patent drawing
  • US20250247547A1 patent drawing

AI summary

This disclosure provides an image encoding/decoding method and device and recording medium storing a bitstream. The image decoding method may comprise: constructing a candidate list related to prediction of a current block; generating a prediction block of the current block based on a candidate selected from the candidate list; and generating a reconstructed block of the current block based on the prediction block, wherein the constructing of the candidate list includes adding candidates to the candidate list in an order of a first candidate serving as a spatially neighboring block, a second candidate serving as a temporally neighboring block, and a third candidate serving as a non-neighboring block.