LUT Update Rules for Video Coding Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding methods, such as those based on the High Efficiency Video Coding (HEVC) standard, face challenges in efficiently compressing and decompressing high-resolution videos due to increasing bandwidth demands and complex encoding and decoding algorithms, which affect video quality and coding efficiency.
Innovation Solution
The proposed solution involves maintaining tables containing motion candidates with associated motion information, performing conversions between video blocks and bitstream representations, and updating these tables based on specific rules to enhance video processing efficiency, which can be applied to existing and future video coding standards.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If motion candidate tables are updated after every video block conversion, then coding efficiency is improved, but processing time and computational complexity increase
Solution Approach 1:
The patent applies preliminary action by updating motion candidate tables in advance for entire video regions before actual encoding/decoding operations. The method performs region-based LUT updates that prepare motion candidates for multiple blocks ahead of time, allowing the encoder/decoder to retrieve pre-computed candidates during actual conversion operations, thus avoiding repeated computational overhead while maintaining high coding efficiency
Solution Approach 2:
The patent segments the video processing into region-based operations where motion candidate tables are updated for specific video regions rather than uniformly for every block. By dividing the video into regions and performing LUT updates at region boundaries or for region groups, the method reduces the frequency of table updates while still providing accurate motion candidates for each block, thereby decreasing processing time without sacrificing coding efficiency
2Productivity
If motion candidate tables are updated frequently, then video compression performance is improved, but device complexity increases
Solution Approach 1:
The patent applies local quality by performing LUT updates at the region level rather than uniformly across the entire video stream. Different video regions can have different update frequencies and strategies based on their complexity and motion characteristics. This localized approach maintains high compression performance in regions requiring frequent updates while reducing device complexity in regions where less frequent updates suffice
Solution Approach 2:
The patent implements partial action by selectively updating motion candidate tables only for specific video regions that benefit most from frequent updates, rather than uniformly updating all regions. The method identifies regions with high motion activity or complex content and applies LUT updates primarily to those areas, achieving good compression performance while avoiding the excessive computational burden of universal frequent updates
3Loss of energy
If region-based LUT updates are performed until update termination criterion is met, then bandwidth requirements are reduced, but processing time increases
Solution Approach 1:
The patent implements feedback mechanisms through update termination criteria that monitor the convergence of LUT updates across video regions. The system continuously assesses whether further updates would yield significant compression improvements and terminates updates when predefined criteria are met (such as maximum iterations, quality thresholds, or diminishing returns). This feedback-driven approach reduces bandwidth requirements by avoiding unnecessary updates while keeping processing time controlled through objective termination conditions
Data Source
AI summary
Devices, systems and methods for processing video are described. In a representative aspect, a video processing method is provided to include: maintaining tables, wherein each table includes a set of motion candidates and each motion candidate is associated with corresponding motion information; performing a conversion between a first video block and a bitstream representation of a video including the first video block based on the tables; and updating, after performing of the conversion, zero or more tables, based on an update rule.


