Motion Vector Prediction Candidate Reordering for Video Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current motion estimation and compensation techniques in video coding, such as those in HEVC, face inefficiencies in transmitting motion information due to redundant candidate lists and limited predictive coding methods, which can lead to increased bandwidth consumption and reduced coding performance.
Innovation Solution
The proposed method involves reordering motion vector prediction candidates based on cost estimation using templates from neighboring blocks and reference blocks, allowing for more efficient selection and encoding of motion vectors, thereby reducing redundancy and improving coding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If motion vector prediction candidates are transmitted in conventional order, then decoding simplicity is maintained, but coding efficiency is reduced due to redundancy
Solution Approach 1:
The patent applies preliminary action by reordering motion vector prediction candidates based on cost estimation before transmission. The encoder calculates costs for each candidate using templates from neighboring blocks and reference blocks, then sorts candidates in ascending order of cost. This pre-processing step optimizes the candidate list before it is transmitted to the decoder, allowing the decoder to simply follow the same reordering process without increasing complexity.
2Measurement precision
If more motion information is transmitted to improve accuracy, then motion compensation precision is improved, but bandwidth consumption increases
Solution Approach 1:
The patent extracts only the essential motion information by using motion vector prediction with reordered candidates. Instead of transmitting full motion vectors for all blocks, the system extracts and transmits only the index of the selected candidate from the reordered list. The reordering is based on cost estimation using templates, which allows the most accurate prediction to be selected with minimal transmitted data, thus reducing bandwidth while maintaining accuracy.
3Productivity
If conventional candidate selection is used, then implementation simplicity is maintained, but compression performance is reduced
Solution Approach 1:
The patent changes the parameter of candidate ordering from conventional fixed order to cost-based dynamic order. The cost parameter is calculated using templates from neighboring blocks and reference blocks, and candidates are sorted based on this cost parameter in ascending order. This parameter change improves compression performance by ensuring the best candidates are selected first, while the implementation remains relatively simple as it follows the existing candidate derivation process with an added sorting step.
Data Source
AI summary
Method and apparatus of Inter prediction for video coding performed by a video encoder or a video decoder that utilizes motion vector prediction (MVP) to code a motion vector (MV) associated with a block coded with Inter mode are disclosed. According to one method, an initial MVP candidate list is generated for the current block. When candidate reordering is selected for the current block, target candidates within a selected candidate set are reordered to generate a reordered MVP candidate list and then the current block is encoded at the video encoder side or decoded at the video decoder sider using the reordered MVP candidate list, where the selected candidate set comprises at least partial candidates of the initial MVP candidate list.