Video Decoding Bitstream Syntax for Coding Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional video coding methods face inefficiencies in coding efficiency due to the need for multiple flags and indices, which increase the number of bits in encoded data, making it necessary to develop a method for more efficiently using these elements to limit bit usage.
Innovation Solution
A method and device that utilize a high-level syntax to determine the number of merging candidates for subblock-based motion vector prediction, specifically by receiving a bitstream, determining prediction and affine enabled flags, and calculating a maximum index to reconstruct image frames based on the number of subblock-based merging motion vector prediction candidates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If multiple flags and indices are included in the encoded data for each coding mode, then the coding flexibility and precision are improved, but the number of bits in the encoded data increases
Solution Approach 1:
The patent combines multiple separate flags and indices into a unified syntax structure. Specifically, it merges the affine mode flag and subblock merge flag into a single unified flag system, and consolidates multiple mode candidate indices into a shared index structure. This merging reduces the total number of bits required while preserving the ability to selectively enable different coding modes with sufficient precision.
Solution Approach 2:
The patent creates a universal syntax structure that serves multiple coding modes simultaneously. The unified flag system can indicate the enablement status of affine mode, subblock merge mode, and other prediction modes through a common framework. The shared index structure provides mode candidate information for multiple modes without requiring separate indices for each, making the syntax elements multi-functional and reducing overall bit consumption.
2Measurement precision
If the number of subblock-based merging MVP candidates is increased, then the prediction accuracy is improved, but the complexity of determining and encoding the candidates increases
Solution Approach 1:
The patent implements a dynamic candidate list mechanism where the number of subblock-based merging MVP candidates is not fixed but adaptively determined based on the affine enabled flag and prediction mode enabled flag. When affine mode is enabled, the system dynamically adjusts the candidate list size and composition, allowing for higher prediction accuracy when needed while reducing complexity when affine mode is not used. This dynamic approach enables the system to optimize the balance between accuracy and complexity based on the specific coding context.
Data Source
AI summary
A method of decoding a bitstream by an electronic device is provided. The electronic device receives the bitstream and determines, from the bitstream, a prediction mode enabled flag and an affine enabled flag both corresponding to one or more image frames. The electronic device determines, from the bitstream, a maximum index corresponding to the one or more image frames when the affine enabled flag is true. An index value of the maximum index is in an index range determined based on the prediction mode enabled flag. The electronic device determines a maximum number of zero or more subblock-based merging motion vector prediction (MVP) candidates based on the maximum index when the affine enabled flag is true. The electronic device reconstructs the one or more image frames based on the maximum number of the zero or more subblock-based merging MVP candidates.


