Pruning Illumination Compensation Flags in Video Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding techniques face challenges in efficiently compressing video data while maintaining high quality, particularly due to the large amounts of data required for high fidelity and resolution, which burdens communication networks and devices, and existing methods for illumination compensation are complex and inefficient.
Innovation Solution
The implementation of a method that constructs a motion information candidate list with an illumination compensation flag, allowing for pruning processes that determine whether to update the flag based on the comparison of motion vectors and flags, thereby simplifying the comparison and improving coding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If motion information candidates are stored in a candidate list for illumination compensation, then coding efficiency is improved, but device complexity and computational burden increase
Solution Approach 1:
The patent extracts only the essential illumination compensation flag from the motion information candidate, separating it from the full motion information. This allows the flag to be stored and processed independently in the candidate list, improving coding efficiency while reducing the complexity of storing and processing complete motion information for all candidates.
Solution Approach 2:
The motion information is segmented into distinct components: motion vectors and illumination compensation flags. This segmentation allows selective processing where only the illumination compensation flag is managed in the candidate list during pruning operations, reducing computational burden while maintaining coding efficiency benefits.
2Manufacturing precision
If complete motion information including illumination compensation flags is stored for all candidates, then illumination compensation accuracy is improved, but redundant information storage increases
Solution Approach 1:
The illumination compensation flag is extracted from the complete motion information and stored separately in the candidate list. This extraction allows the system to maintain accurate illumination compensation data where needed while avoiding redundant storage of the entire motion information set for all candidates.
Solution Approach 2:
The pruning process discards redundant motion information candidates while preserving their illumination compensation flags in the candidate list. This allows the system to eliminate redundant data storage while recovering and retaining the essential illumination compensation information for use in decoding.
3Measurement precision
If pruning processes compare all motion information including flags, then candidate selection accuracy is improved, but computational complexity increases
Solution Approach 1:
The comparison process is segmented into two stages: first comparing motion vectors to identify potential matches, then comparing illumination compensation flags only for candidates with matching motion vectors. This segmentation reduces computational complexity by avoiding unnecessary flag comparisons while maintaining candidate selection accuracy.
Solution Approach 2:
The pruning process performs preliminary comparison of motion vectors before comparing illumination compensation flags. This preliminary action filters out non-matching candidates early, reducing the number of flag comparisons needed and thereby reducing computational complexity while preserving selection accuracy.
Data Source
AI summary
Systems and techniques for processing video data include a pruning processes for motion vector candidate list construction. An illumination compensation flag of a potential motion information candidate to be added to a motion information candidate list can include motion information associated with a block of video data, where the motion information can include a motion vector and an illumination compensation flag. The motion information can be compared with stored motion information in the motion information candidate list, where the stored motion information can include at least one stored motion vector and associated stored illumination compensation flag. When the motion vector matches the stored motion vector, the pruning process can include not adding the motion vector to the motion information candidate list, and updating the stored illumination compensation flag based on a value of the illumination compensation flag and a value of the stored illumination compensation flag.


