Motion Vector Candidate Lists for Lower-Bitrate Video Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video encoding technologies face challenges in managing code amount due to inappropriate configuration of motion vector prediction information, leading to increased bitstream size and processing complexity.
Innovation Solution
An encoder and decoder system that generates a motion vector candidate list based on partition size and shape, adjusting the maximum list size and order of candidates to optimize the selection of motion vectors, thereby reducing the code amount.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If motion vector information is configured using conventional methods, then encoding compatibility is maintained, but code amount increases and encoding efficiency decreases
Solution Approach 1:
The patent changes the parameters of motion vector candidate lists by making the maximum list size and candidate order dependent on partition size and shape. This allows the encoding system to adapt the motion vector information configuration to different partition characteristics, reducing unnecessary data transmission while maintaining decoding compatibility.
Solution Approach 2:
The patent introduces dynamic configuration of motion vector candidate lists where the list characteristics vary based on partition properties. Instead of using a fixed configuration, the system dynamically adjusts the candidate list parameters according to the specific partition being encoded, optimizing the balance between code amount and encoding efficiency.
2Ease of manufacture
If a fixed maximum list size is used for motion vector candidates, then encoding simplicity is maintained, but code amount increases due to inappropriate configuration
Solution Approach 1:
The patent modifies the maximum list size parameter based on partition size and shape characteristics. By establishing a relationship between partition properties and list configuration parameters, the system achieves adaptive optimization without requiring complex manual configuration, maintaining encoding simplicity while reducing code amount.
3Ease of operation
If motion vector candidates are ordered in a fixed sequence, then decoding process is simplified, but encoding efficiency decreases due to suboptimal candidate selection
Solution Approach 1:
The patent changes the ordering parameter of motion vector candidates by making the candidate order dependent on partition size and shape. This allows the most relevant candidates to be positioned optimally in the list based on partition characteristics, improving encoding efficiency while maintaining a systematic ordering that simplifies the decoding process.
Data Source
AI summary
An encoder which includes circuitry and memory. Using the memory, the circuitry generates a list which includes candidates for a first motion vector for a first partition. The list has a maximum list size and an order of the candidates, and at least one of the maximum list size or the order of the candidates is dependent on at least one of a partition size or a partition shape of the first partition. The circuitry selects the first motion vector from the candidates included in the list; encodes an index indicating the first motion vector among the candidates in the list into the bitstream based on the maximum list size; and generates the predicted image for the first partition using the first motion vector.