Encoder and Decoder HMVP Prediction with Block-Size Thresholds
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face challenges in efficiently processing increasing amounts of digital video data, particularly in terms of encoding and decoding efficiency and speed, due to the complexity of operations such as filter selection, block size determination, and motion vector prediction.
Innovation Solution
The implementation of a history-based motion vector predictor (HMVP) table that updates only when the current block size exceeds a threshold, using a first-in-first-out method, and generates a candidate motion vector prediction list without the HMVP table for smaller blocks, optimizing the encoding and decoding processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the HMVP table is updated for every block regardless of size, then the prediction accuracy is improved, but the processing complexity and computational load increase
Solution Approach 1:
The patent applies local quality by differentiating the HMVP table update operation based on block size. Large blocks (exceeding threshold) receive the full HMVP table update treatment for high prediction accuracy, while small blocks (at or below threshold) skip the update to reduce complexity. This localized approach ensures that computational resources are concentrated where they provide the most value - in larger blocks that benefit more from accurate motion vector prediction.
Solution Approach 2:
The patent changes the parameter of block size as the decision criterion for HMVP table updates. By introducing a threshold size parameter, the system dynamically adjusts whether to perform the update operation based on this parameter value. This parameter-based differentiation resolves the contradiction by allowing the system to adapt its processing intensity to the actual needs of each block type.
2Productivity
If the HMVP table is updated for every block, then the encoding efficiency is improved, but the encoding speed decreases due to increased computational load
Solution Approach 1:
The patent applies local quality by differentiating the HMVP table update operation based on block size. Large blocks (exceeding threshold) receive the full HMVP table update treatment for high prediction accuracy, while small blocks (at or below threshold) skip the update to reduce complexity. This localized approach ensures that computational resources are concentrated where they provide the most value - in larger blocks that benefit more from accurate motion vector prediction.
Solution Approach 2:
The patent implements partial action by performing HMVP table updates only for large blocks that exceed the threshold size, rather than for all blocks. This partial application of the update operation maintains encoding efficiency for blocks that need it while avoiding unnecessary processing for small blocks, thereby preserving encoding speed. The selective approach ensures that computational effort is applied partially - only where the benefit justifies the cost.
3Measurement precision
If the HMVP table is updated for every block, then the motion vector prediction accuracy is improved, but the processing time increases
Solution Approach 1:
The patent applies local quality by differentiating the HMVP table update operation based on block size. Large blocks (exceeding threshold) receive the full HMVP table update treatment for high prediction accuracy, while small blocks (at or below threshold) skip the update to reduce complexity. This localized approach ensures that computational resources are concentrated where they provide the most value - in larger blocks that benefit more from accurate motion vector prediction.
Solution Approach 2:
The patent implements partial action by performing HMVP table updates only for large blocks that exceed the threshold size, rather than for all blocks. This partial application of the update operation maintains encoding efficiency for blocks that need it while avoiding unnecessary processing for small blocks, thereby preserving encoding speed. The selective approach ensures that computational effort is applied partially - only where the benefit justifies the cost.
Data Source
AI summary
Provided is an encoder includes: circuitry; and memory coupled to the circuitry, in which in operation, the circuitry: generates a prediction image of a current block to be processed, using a first motion vector; and updates a history based motion vector predictor (HMVP) table using a first candidate having the first motion vector, the HMVP table storing, in a first in first out (FIFO) method, a plurality of second candidates each having a second motion vector used for a processed block, and in the updating of the HMVP table, the circuitry: determines whether a size of the current block is less than or equal to a threshold size; and skips the updating of the HMVP table when the size of the current block is determined to be less than or equal to the threshold size.


