Block Partition Motion Vector Signaling for Efficient Video Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face inefficiencies in predicting motion vectors, particularly in scenarios where block partitions require different motion vectors, leading to increased data requirements and reduced compression efficiency.
Innovation Solution
Implementing a geometry partition mode (GPM) and merge mode with motion vector difference (MMVD) signaling, which utilizes angle, edge, distance, and direction indexes to determine offset values for motion vectors in block partitions, allowing for more precise motion vector prediction and reduced data requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If traditional motion vector prediction is used for block partitions, then coding simplicity is maintained, but compression efficiency deteriorates due to increased data requirements when different motion vectors are needed for different partitions
Solution Approach 1:
The current block is divided into two triangular partitions using geometry partition mode (GPM) with angle indexes and edge indexes. Each partition can have its own motion vector, allowing independent motion representation for different regions while maintaining efficient coding through the standardized GPM framework.
Solution Approach 2:
Different motion vectors are applied to different spatial partitions (first and second parts) of the current block based on their local motion characteristics. This allows each partition to have optimized motion compensation tailored to its specific motion pattern, improving overall prediction accuracy.
2Measurement precision
If separate motion vectors are used for different block partitions, then motion prediction accuracy is improved, but bitrate increases due to additional data requirements
Solution Approach 1:
The merge mode with motion vector difference (MMVD) signaling combines the advantages of merge mode (using candidate motion vectors from neighboring blocks) with precise motion vector differences. This allows accurate motion representation while efficiently encoding the differences rather than transmitting full motion vectors for each partition.
Solution Approach 2:
The motion vector for each partition is represented as a difference (offset) from a reference motion vector obtained through merge mode. By encoding the parameter change (MVD) rather than the absolute motion vector, the bitrate is reduced while maintaining prediction accuracy.
3Productivity
If geometry partition mode with MMVD signaling is implemented, then compression efficiency is improved through reduced data requirements, but device complexity increases due to additional processing steps
Solution Approach 1:
The GPM partitioning and MMVD candidate selection are performed in advance during the encoding/decoding process. The angle indexes, edge indexes, and motion vector difference candidates are prepared and signaled in the bitstream, allowing the actual motion compensation to use pre-computed values and reducing real-time processing complexity.
Solution Approach 2:
The motion vector difference (MVD) acts as an intermediary between the reference motion vector (from merge mode) and the final partition-specific motion vector. This intermediary representation simplifies the relationship between different motion vectors and enables efficient differential encoding.
4Manufacturing precision
If motion vector differences are signaled for GPM partitions, then coding precision is improved, but loss of time increases due to additional decoding steps
Solution Approach 1:
The decoder uses self-service by deriving the final motion vectors from the signaled GPM parameters (angle indexes, edge indexes) and MMVD candidates using standardized formulas. This self-contained derivation process eliminates the need for additional signaling or complex external computations, reducing decoding time while maintaining precision.
Data Source
AI summary
In a method of encoding performed in an encoder, a block is partitioned into a first part and a second part based on a geometry partition mode (GPM). Inter prediction is performed on the first part and the second part of the block based on merge mode with motion vector difference (MMVD). Whether a first motion vector (MV) for the first part is identical to a second MV for the second part is determined based on a first distance index and a first direction index and a second distance index and a second direction index. The block is encoded in a bitstream based on the first MV and the second MV when the first MV is not identical to the second MV, and based on the first MV and a third MV for the second part of the block when the first MV is identical to the second MV.


