Motion Vector Predictor Ordering for Lower-Bitrate Video Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing Versatile Video Coding (VVC) standard faces challenges in optimizing the derivation and ordering of motion vector predictor candidates, leading to increased bitrate and reduced coding efficiency, particularly in the selection of lower-ranked candidates.
Innovation Solution
The proposed method involves generating and positioning pairwise motion vector predictor candidates in the list to improve coding performance by ensuring they are placed near the top of the list, thereby reducing bitrate and enhancing coding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If more motion vector predictor candidates are added to the list to improve coding efficiency, then the diversity of candidates increases, but the bitrate increases due to selecting candidates lower down the list
Solution Approach 1:
The pairwise motion vector predictor candidate is pre-calculated and inserted at a predetermined position (e.g., fifth position) in the candidate list before encoding. This preliminary action ensures the candidate is available when needed without requiring additional bitrate for signaling, as the position is predetermined and known to both encoder and decoder
Solution Approach 2:
The pairwise candidate is inserted at a specific position in the candidate list rather than being added to the end. This local insertion strategy ensures that the candidate is positioned where it can be effectively selected without increasing the bitrate, as the insertion position is predetermined and does not require signaling
2Adaptability or versatility
If candidates are placed lower in the list to maintain diversity, then more candidates are available, but the number of bits required to signal the selected candidate increases
Solution Approach 1:
The pairwise candidate is inserted at a predetermined position in the list before the encoding process begins. This preliminary positioning ensures that the candidate is available at a known location without requiring additional bits for signaling its position, as both encoder and decoder know the insertion position in advance
Solution Approach 2:
The candidate is inserted at a specific local position (e.g., fifth position) in the candidate list rather than being added to the end. This localized insertion maintains candidate diversity while avoiding increased signaling overhead, since the insertion position is predetermined and does not require transmission
Data Source
AI summary
Improvements to the derivation and ordering of one or more pairwise motion vector predictor candidates in the list of motion vector predictor candidates are disclosed. An initial list of motion vector predictor candidates is generated for decoding a portion of an image, and when candidate reordering is selected for the image portion, reordering at least a portion of said initial list to generate a reordered motion vector predictor candidate list; and adding a pairwise motion vector predictor candidate into said reordered list.