Video Merge Candidate Expansion for Better Inter Prediction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video compression technologies face limitations in improving inter prediction efficiency, particularly in deriving merge candidates for video encoding and decoding, especially as display panels increase in size and demand for higher quality video services grows.
Innovation Solution
The method involves generating a merge candidate list for a first block, selecting one merge candidate, and performing motion compensation, with the addition of inter-region merge candidates from an inter-region motion information list when they differ from existing candidates by a threshold value.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If merge candidates are derived only from candidate blocks adjacent to a current block, then the derivation process is simple and fast, but the inter prediction efficiency is limited
Solution Approach 1:
The patent segments the merge candidate derivation process into multiple sources: adjacent blocks (traditional approach) and non-adjacent blocks (new approach). By dividing the search space into these segments, the system can efficiently incorporate diverse motion information without overwhelming complexity, resolving the contradiction between prediction efficiency and derivation simplicity.
Solution Approach 2:
The patent extends the derivation process from a one-dimensional adjacent-block search to a multi-dimensional search that includes non-adjacent blocks. This dimensional expansion allows access to a broader range of motion information, improving inter prediction efficiency while managing complexity through structured search regions.
2Measurement precision
If more merge candidates are added to the merge candidate list, then the prediction accuracy improves, but the processing time increases
Solution Approach 1:
The patent performs preliminary actions by pre-defining search regions and pre-establishing the merge candidate list structure. Non-adjacent blocks are identified and processed in advance within predetermined regions, allowing the system to efficiently evaluate multiple candidates without significant time penalty during actual prediction.
Solution Approach 2:
The patent applies local quality by differentiating between adjacent and non-adjacent block regions. Different search strategies and evaluation criteria are applied to different spatial regions, optimizing the balance between candidate diversity (for accuracy) and processing efficiency (for time).
Data Source
AI summary
A video decoding method includes the steps of: generating a merge candidate list for a first block; selecting one among merge candidates included in the merge candidate list; and performing motion compensation for the first block based on motion information of the selected merge candidate. At this point, an inter-region merge candidate included in an inter-region motion information list may be added to the merge candidate list based on the number of spatial merge candidates and temporal merge candidates included in the merge candidate list.