Motion Compensation Prediction Using Shared Temporal Merge Candidates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing motion compensation prediction methods in moving-picture compression coding, such as MPEG-4AVC and HEVC, face inefficiencies in code size and complexity due to the need for scaling motion vectors and lack of parallel processing capabilities when performing motion compensation on multiple neighboring blocks.
Innovation Solution
A method for efficiently performing motion compensation prediction collectively on multiple neighboring prediction blocks using a motion vector of a processed block, enabling parallel processing and reducing the need for complex scaling operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If motion compensation prediction is performed collectively on multiple neighboring prediction blocks using a motion vector of a processed block, then parallel processing capability is improved, but the accuracy of motion vector prediction may deteriorate
Solution Approach 1:
The patent applies preliminary action by pre-classifying prediction blocks into two categories: those that can undergo parallel motion compensation prediction and those that cannot. This classification is performed before the actual motion compensation process, allowing the system to identify and process compatible blocks in parallel while maintaining accuracy requirements for blocks that need sequential processing. The classification criteria are established in advance based on spatial and temporal relationships between blocks.
Solution Approach 2:
The patent implements local quality by applying different processing strategies to different prediction blocks based on their specific characteristics. Blocks that meet certain criteria (such as having processed neighboring blocks with valid motion vectors) receive parallel processing treatment, while other blocks undergo traditional sequential processing. This localized differentiation ensures that parallel processing is applied only where it maintains prediction accuracy, thereby resolving the contradiction between productivity improvement and precision maintenance.
2Measurement precision
If motion vectors are scaled according to inter-frame distance, then motion compensation accuracy is improved, but computational complexity increases
Solution Approach 1:
The patent applies partial action by selectively performing scaling operations only on motion vectors that require it, rather than uniformly scaling all motion vectors. The system identifies specific cases where scaling is necessary (when inter-frame distance differs from reference) and applies scaling only to those cases. This selective approach maintains motion compensation accuracy where needed while avoiding unnecessary computational complexity in cases where scaling is not required.
Solution Approach 2:
The patent implements parameter changes by dynamically adjusting the scaling factor based on the inter-frame distance and reference picture characteristics. Rather than using a fixed scaling operation, the system modifies the scaling parameters adaptively according to the specific scene and temporal distance, thereby maintaining high accuracy while optimizing computational complexity for different video content scenarios.
3Measurement precision
If the size of block used for motion compensation is reduced, then motion compensation accuracy is improved, but code size of coding vector becomes large
Solution Approach 1:
The patent applies merging by combining multiple small prediction blocks into larger processing units when their motion characteristics are similar. By identifying blocks with comparable motion vectors and grouping them, the system can represent multiple blocks with shared motion information using a single or reduced set of coding vectors. This merging strategy maintains the motion compensation accuracy benefits of fine-grained blocking while reducing the overall code size required to represent the motion data.
Solution Approach 2:
The patent implements copying by reusing motion vector information from processed neighboring blocks when applicable. Instead of encoding independent motion vectors for each block, the system copies motion information from already-processed blocks that have similar motion characteristics, particularly in regions with uniform or smoothly varying motion. This copying approach significantly reduces code size while maintaining accuracy, as the copied motion information serves as an effective predictor for similar blocks.
Data Source
Figure 1A~1B
Figure 2A~2D
Figure 3
AI summary
A temporal merging motion information candidate generation unit 161 derives, when information indicating whether or not to derive a temporal merging motion information candidate shared for all prediction blocks in a coding block is information indicating the derivation of a temporal merging motion information candidate shared for all the prediction blocks in the coding block, a temporal merging motion information candidate shared for all the prediction blocks in the coding block from a prediction block of a coded picture different from a picture having a prediction block subject to coding. A merging motion information candidate list construction unit 140 generates a plurality of merging motion information candidates including a temporal merging motion information candidate.