AMVP Prediction Block Generation for Video Compression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video compression techniques face inefficiencies in encoding and decoding motion information, particularly in Advanced Motion Vector Prediction (AMVP) mode, leading to increased data overhead and reduced compression rates due to ineffective prediction of motion vectors and increased data transmission for motion information.
Innovation Solution
A method for generating a prediction block in AMVP mode by reconstructing a reference picture index and differential motion vector, searching effective spatial and temporal AMVP candidates, generating an AMVP candidate list, and determining a motion vector predictor to reduce the amount of coded information and improve prediction accuracy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If motion vector information is simply encoded and inserted, then decoding is straightforward, but overhead is increased and compression rate decreases
Solution Approach 1:
The patent uses feedback by predicting the current block's motion vector from neighboring blocks' motion vectors. The encoder and decoder both use the same prediction logic, allowing the decoder to reconstruct the predicted motion vector and thus understand which differential values to expect, reducing the information needed to transmit the full motion vector.
Solution Approach 2:
The patent copies motion vector information from neighboring blocks to create a prediction for the current block. Instead of transmitting the full motion vector, only the difference from the copied/predicted value is transmitted, significantly reducing overhead.
2Ease of operation
If the median value of neighboring blocks is used as motion vector predictor, then prediction is simple, but prediction accuracy decreases when neighboring blocks have different motion vectors
Solution Approach 1:
The patent applies local quality by selecting different prediction strategies based on the local characteristics of neighboring blocks. When neighboring blocks have similar motion vectors, the median is used. When they differ significantly, alternative predictors or methods are employed to maintain accuracy in regions with motion discontinuities.
Solution Approach 2:
The patent introduces dynamics by making the prediction method adaptive rather than static. The system dynamically selects among different prediction approaches based on the actual motion characteristics of neighboring blocks, allowing it to respond to varying local motion patterns rather than always using the fixed median approach.
3Quantity of substance
If prediction blocks are larger and diversified, then residual block data is reduced, but motion information transmission amount increases
Solution Approach 1:
The patent segments the motion information transmission by processing different prediction units independently with their own motion vectors. This allows larger prediction blocks to be divided into smaller units that can be predicted and encoded separately, reducing the overall motion information overhead while maintaining large prediction block benefits.
Data Source
AI summary
A method of decoding an image in a merge mode, the method including deriving, by a motion compensation predictor, motion information using effective spatial and temporal merge candidates of a current prediction unit; generating, by the motion compensation predictor, a prediction block of the current prediction unit using the motion information; entropy decoding, by an entropy decoder, a bitstream to generate a quantized coefficient sequence, inversely scanning, by an inverse quantizer/inverse transformer, the quantized coefficient sequence to generate a quantized block, inversely quantizing, by the inverse quantizer/inverse transformer, the quantized block to generate a transformed block using a quantization parameter, and inversely transforming, by the inverse quantizer/inverse transformer, the transformed block to generate a residual block; and generating, by an adder, a reconstructed block using the prediction block and the residual block, wherein a motion vector of the temporal merge candidate is a motion vector of a temporal merge candidate block within a temporal merge candidate picture, and the quantization parameter is derived using an average of two effective quantization parameters among a left quantization parameter, an upper quantization parameter and a previous quantization parameter of a current coding unit, wherein when the quantized block is larger than a predetermined size, the quantized block is generated with plurality of subblocks, and a scan pattern of inversely scanning for the plurality of subblocks is the same as a scan pattern of inversely scanning for quantized coefficients of each subblock, and wherein the bitstream includes information indicating a position of a last non-zero quantized coefficient in a transform unit.