Video Coding Motion Vector Candidate List Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding technologies face challenges in efficiently reducing redundancy in video data, particularly in motion vectors, which affects compression ratios and storage requirements, due to limitations in motion vector prediction mechanisms.
Innovation Solution
The proposed solution involves calculating hash values based on motion information from previously decoded blocks and comparing them with candidates in a candidate list to determine differences, allowing for the addition or exclusion of new motion information, thereby optimizing the candidate list and improving compression efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of substance
If motion vector prediction mechanisms are used to reduce redundancy in video data, then compression ratio is improved, but device complexity increases due to limitations in existing prediction mechanisms
Solution Approach 1:
The patent replaces complex motion vector comparison operations with hash value computations. Instead of directly comparing motion vectors (the mechanical system), the invention computes hash values from motion vectors and compares these simplified representations. This substitution reduces computational complexity while maintaining the ability to identify duplicate motion information candidates, thereby resolving the contradiction between compression efficiency and device complexity.
Solution Approach 2:
The patent transforms motion vectors into hash values, changing the parameter representation from raw motion vector data to condensed hash representations. This parameter transformation enables more efficient comparison operations and reduces the computational burden of candidate pruning, allowing the system to achieve better compression ratios without proportionally increasing device complexity.
2Productivity
If more motion information candidates are added to the candidate list, then compression efficiency is improved, but processing time increases
Solution Approach 1:
The patent substitutes expensive motion vector comparison operations with faster hash value computations. By replacing the mechanical comparison process with hash-based lookup, the system can efficiently evaluate more candidates without proportionally increasing processing time, thus improving compression efficiency while minimizing time loss.
Solution Approach 2:
The patent performs preliminary hash value computations for motion information candidates before the actual candidate selection process. This preliminary action prepares the data in advance, enabling faster subsequent comparisons and reducing the overall processing time when evaluating multiple candidates for inclusion in the candidate list.
Data Source
AI summary
Aspects of the disclosure provide a method and an apparatus for video decoding. Processing circuitry of the apparatus can decode prediction information of a current block to be reconstructed from a coded video bitstream. The prediction information can be indicative of an inter prediction mode. The processing circuitry can add motion information of a previously decoded block to a candidate list for the current block as a new motion information candidate based on a comparison between a first hash value of the motion information of the previously decoded block and one or more hash values of motion information candidates in the candidate list. The processing circuitry can reconstruct at least one sample of the current block based on current motion information of the current block that is determined based on the candidate list.