Video Codec Candidate List Pruning for Complexity Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video codecs face inefficiencies due to non-unique candidates in lists used for motion vector prediction and intra prediction, leading to increased complexity and reduced performance.
Innovation Solution
A method and apparatus for candidate list pruning in video codecs, ensuring uniqueness of candidates by performing operations on coding component candidates and adding them to lists only if they are not already present, thereby improving diversity and reducing complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If candidate lists are constructed with unlimited size to ensure all possible candidates are included, then the completeness of candidate selection is improved, but the computational complexity increases
Solution Approach 1:
The patent extracts and removes duplicate candidates from the candidate list through a pruning process. The method identifies redundant candidates that are identical to existing ones and eliminates them, keeping only unique candidates. This extraction of duplicates resolves the contradiction by maintaining completeness of unique candidates while reducing the list size and computational complexity.
2Device complexity
If candidate lists are pruned to remove duplicates and reduce size, then the computational complexity is reduced, but the diversity of candidates may be compromised
Solution Approach 1:
The patent uses copying to create modified versions of candidates through geometric transformations (translation, rotation, reflection). Instead of removing all duplicates, the system generates transformed copies that maintain diversity while eliminating exact redundancies. This allows the system to reduce complexity by removing identical candidates while preserving diversity through transformed variations.
3Adaptability or versatility
If operations are performed on coding component candidates to generate modified candidates, then the diversity within candidate lists is improved, but the processing time increases
Solution Approach 1:
The patent applies geometric transformations and pruning operations during the candidate list construction phase, before the actual video coding process. By performing diversity-enhancing operations preliminarily when building the candidate list, the system ensures diverse candidates are available without incurring additional processing time during the main coding operation. The transformations are computed once during list generation rather than repeatedly during encoding/decoding.
Data Source
AI summary
Video signal coding and decoding functions can generate lists of potential candidates to use in coding and decoding, for example, predictors. Video signal coding component candidates undergo operations before potential inclusion in candidate lists. The candidates are checked after being modified by the operations to see if other equal candidates are already in the candidate list. If equal candidates are not in the list, the modified candidates are added to the candidate list. If equal candidates are already in the list, the modified candidates are not added to the list. Operations that can be performed comprise rounding and clipping.