Motion Information Candidate Reordering for Video Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video encoding technologies face inefficiencies in transmitting motion information due to its significant contribution to the bitstream, necessitating a method to reduce transmission overhead while maintaining encoding and decoding complexity.
Innovation Solution
The proposed solution involves determining a group type for subgroups of motion information candidates, reordering them based on template matching costs, and constructing a list of candidates for efficient encoding and decoding, specifically by signaling indices in the bitstream based on video block size and available merge candidates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If motion information is transmitted for every video block, then motion compensation accuracy is improved, but transmission overhead increases
Solution Approach 1:
The patent extracts only the necessary motion information (index values) from the full motion data and transmits only these compact representations. Instead of transmitting complete motion vectors and candidate lists, the system transmits condensed index values that reference pre-defined candidate lists at the decoder, significantly reducing transmission overhead while preserving motion compensation accuracy.
Solution Approach 2:
The patent creates compact copies of motion information in the form of index values that reference candidate lists. Rather than transmitting full motion data, the system transmits these index copies that point to candidate motion information stored or reconstructible at the decoder side, achieving efficient compression of motion information.
2Productivity
If motion information is compressed to reduce bitstream size, then transmission efficiency is improved, but encoding and decoding complexity increases
Solution Approach 1:
The patent segments motion information transmission into two parts: compact index values transmitted in the bitstream and candidate list management performed separately. This segmentation allows the decoder to reconstruct full motion information by combining received indices with locally generated or referenced candidate lists, reducing decoding complexity compared to transmitting complete motion data.
Solution Approach 2:
The candidate lists serve multiple functions: they provide reference for index decoding, enable motion compensation, and can be reused across multiple video blocks. This multi-functionality reduces the need for separate processing of each motion vector, simplifying the overall encoding and decoding process while maintaining compression efficiency.
Data Source
AI summary
Implementations of the present disclosure provide a solution for reordering merge candidates. In this solution, during a conversion between a current video block of a video and a bitstream of the video, a template matching cost associated with each of a plurality of candidates of motion information for the current video block is determined. The template matching cost is determined based on a first difference between a set of neighboring samples of the current video block and a set of reference samples corresponding to the set of neighboring samples, and a second difference between a set of reconstructed samples neighboring to the set of neighboring samples and the set of reference samples. The set of reference samples is determined based on motion information indicated by a respective candidate. Then, the plurality of candidates of motion information is reordered based on the template matching cost.