HMVP Filtering for Lower-Complexity Merge Candidate Motion Lists
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The complexity of constructing a merge candidate motion information list in video coding technologies affects coding performance, particularly due to inefficient processes in determining candidate motion information.
Innovation Solution
A method for constructing a merge candidate motion information list that involves obtaining and adding motion information to candidate sets based on spatial and temporal neighbors, using history-based motion vector prediction when necessary, and padding with default values to reach a preset threshold, thereby optimizing the list construction process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional methods are used to determine candidate motion information from spatial and temporal neighbors, then the merge candidate motion information list can be constructed, but the determining process becomes complex and affects coding performance
Solution Approach 1:
The patent performs preliminary actions by first obtaining motion information from spatial and temporal neighbors, then proactively checking if the list needs padding before finalization. This advance preparation reduces complexity during the main coding process by pre-identifying when default values need to be added, thereby improving coding performance without excessive computational overhead.
Solution Approach 2:
The patent changes the parameter of the candidate motion information list by dynamically adjusting its content based on the quantity of obtained motion information. When the list quantity is insufficient, default values are introduced to pad the list to a preset threshold, transforming the list from incomplete to complete form, thus resolving the complexity-performance contradiction.
2Productivity
If the quantity of motion information in the candidate list is insufficient, then default values must be used to pad the list, but this results in low-efficient outputs
Solution Approach 1:
The patent performs preliminary checking of the motion information quantity before finalizing the merge candidate list. By proactively identifying when padding is needed and adding default values in advance, the system avoids low-efficient outputs during actual decoding/encoding operations, thereby improving list construction efficiency while maintaining output quality.
Solution Approach 2:
The candidate motion information list performs self-service by automatically monitoring its own quantity and adding default values when insufficient. This self-regulating mechanism ensures the list always meets the preset threshold without external intervention, improving efficiency while maintaining reliability through automated quality control.
Data Source
AI summary
This application discloses an apparatus for constructing a merge candidate motion information list, including: one or more processors; a non-transitory memory storage comprising instructions which when executed by the one or more processors, cause the apparatus to obtain first motion information and add the first motion information to a first candidate motion information set, to obtain a second candidate motion information set; obtain second motion information based on an HMVP candidate motion information list; when the second motion information is different from all motion information in the second candidate motion information set, add the second motion information to the second candidate motion information set, to obtain a merge candidate motion information list, wherein a quantity of pieces of motion information in the merge candidate motion information set is equal to a preset threshold. Implementing this application reduces complexity in constructing the merge candidate motion information list, and improve coding efficiency.