Motion Candidate Table Updates for Efficient Video Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face challenges in efficiently encoding and decoding digital video due to the increasing bandwidth demand, particularly in handling motion information with high computational complexity and inefficiencies in predicting motion vectors across varying block sizes and reference frames.
Innovation Solution
The implementation of motion candidate tables for video processing, which include maintaining and updating these tables based on current video block characteristics, allows for efficient conversion and determination of motion information, using advanced methods like alternative temporal motion vector prediction and spatial-temporal motion vector prediction to enhance encoding and decoding processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If motion candidate tables are maintained and updated based on video block characteristics, then prediction accuracy is improved, but device complexity increases
Solution Approach 1:
The patent pre-establishes motion candidate tables with potential motion vectors before actual video block processing. By preparing candidate motion information in advance based on video block characteristics (size, type, reference frames), the system reduces real-time computational complexity while maintaining prediction accuracy. The tables are updated preliminarily based on characteristics like block dimension and coding mode, so that when encoding/decoding occurs, the system can quickly retrieve pre-computed motion candidates rather than calculating them on-the-fly.
2Productivity
If advanced motion vector prediction methods are used, then compression efficiency is improved, but computational complexity increases
Solution Approach 1:
The system pre-computes and stores motion candidate information in tables before actual video encoding/decoding operations. By preparing alternative temporal motion vectors and spatial-temporal motion vectors in advance, the patent enables advanced prediction methods to be applied efficiently without full computational overhead during real-time processing. The motion candidate tables are updated preliminarily based on video block characteristics, allowing the system to achieve high compression efficiency through sophisticated prediction while keeping runtime computational complexity manageable through table lookup operations.
3Productivity
If motion candidate tables are updated frequently, then encoding speed is optimized, but use of energy increases
Solution Approach 1:
The patent updates motion candidate tables selectively rather than comprehensively for every video block. The update operation is performed partially based on specific characteristics such as block dimension, coding mode, and reference frame type. When video blocks share similar characteristics, the system reuses existing motion candidate table entries without full updates. This partial update strategy maintains encoding speed by ensuring tables are current when needed, while reducing energy consumption by avoiding redundant update operations across all blocks.
Data Source
AI summary
A video processing method is provided to include: maintaining one or more motion candidate tables; performing a conversion between a current video block of a video and a coded representation of the current video block using multiple video processing operations in a sequence using a motion candidate table; and updating the motion candidate table due to completion of a particular processing operation.