Adaptive Motion Index Parsing for Skip and Direct Video Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face challenges in efficiently determining the motion information index value for skip and direct modes, leading to increased coding and decoding overhead due to fixed maximum index values and varying candidate motion information counts in different picture types.
Innovation Solution
Adopting a flexible approach to determine the motion information index value by parsing sequence-level high-level syntax to dynamically adjust the maximum index value based on the number of motion vector angle prediction and inter-prediction candidate historical motion vector prediction information, reducing bit overhead through optimized binarization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a fixed maximum index value is used for motion information in skip and direct modes, then the coding structure is simple, but the bit overhead increases due to inability to adapt to varying candidate motion information counts
Solution Approach 1:
The patent applies dynamics by making the maximum index value adaptive rather than fixed. The maximum index value is determined based on the actual number of candidate motion information available in the current picture type, allowing the coding system to dynamically adjust its parameters to match the content being encoded, thereby reducing bit overhead while maintaining structural clarity
Solution Approach 2:
The patent changes the parameter of maximum index value from a static fixed value to a dynamic value that varies according to picture type and candidate motion information count. This parameter change enables the system to optimize bit representation for different scenarios, reducing overall bit overhead without significantly complicating the coding structure
2Adaptability or versatility
If the maximum index value is increased to accommodate all candidate motion information, then all cases can be covered, but the number of bits required for coding increases
Solution Approach 1:
The patent applies local quality by using different maximum index values for different picture types (e.g., I pictures, P pictures, B pictures) based on their specific candidate motion information counts. Instead of using a uniformly high maximum value that would cover all cases, the system tailors the index value range to the local requirements of each picture type, thereby reducing the average bit overhead while maintaining complete coverage where needed
Solution Approach 2:
The patent uses partial action by determining the maximum index value based on the actual number of candidate motion information rather than always using the maximum possible value. This partial approach avoids allocating bits for index values that would never be used in practice, reducing coding overhead while still covering all necessary cases
Data Source
Figure 1a
Figure 1b
Figure 2~4
AI summary
Decoding methods and apparatuses, coding methods and apparatuses, devices and machine-readable storage media are provided. In an example of the decoding method, for a received bitstream, by parsing a motion information index value of a skip mode or a direct mode of a current coding unit, a candidate list of the skip mode or the direct mode may be constructed, and determining a prediction mode of the current coding unit, thus, motion compensation can be performed on the current coding unit according to motion information of the current coding unit acquired from the prediction mode of the current coding unit. The motion information index value of the skip mode or the direct mode of the current coding unit is obtained by parsing according to the number of motion vector angle prediction candidate motion information and the number of inter-prediction candidate historical motion vector prediction information.