Adaptive Motion Vector Candidate Ordering for Video Coding Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video encoding standards, such as MPEG-4 AVC, inefficiently utilize bits for transmitting motion vector predictor indices due to limited information-based ordering, leading to increased overhead.
Innovation Solution
Adaptive motion vector candidate ordering is implemented based on common characteristics available at both encoder and decoder, including selection frequency, block type, consistency, fidelity, reference index, and predictor index, to reduce the overhead bits required for motion vector predictor indices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If motion vector predictor indices are transmitted using fixed ordering, then the encoding process is simple, but the overhead bits increase and coding efficiency deteriorates
Solution Approach 1:
The patent applies dynamics by making the motion vector candidate ordering adaptive rather than fixed. The encoder and decoder dynamically adjust the ordering based on characteristics available at both sides (such as block type, reference frame type, and motion vector characteristics), allowing the system to optimize the ordering for each coding block without requiring complex explicit signaling
Solution Approach 2:
The patent changes the ordering parameter of motion vector candidates based on available characteristics. By selecting different ordering strategies (e.g., spatial order, temporal order, gradient-based order) according to the coding context, the system reduces overhead bits while maintaining coding efficiency without increasing overall system complexity
2Loss of information
If adaptive motion vector candidate ordering is implemented, then overhead bits for motion vector predictor indices are reduced, but the device complexity increases
Solution Approach 1:
The patent implements self-service by using characteristics that are already available at both encoder and decoder sides (such as block type, reference frame information, and neighboring motion vectors) to determine the candidate ordering. This eliminates the need for additional signaling or complex coordination between encoder and decoder, reducing overhead bits without proportionally increasing device complexity
Solution Approach 2:
The patent performs preliminary ordering of motion vector candidates based on available characteristics before the actual motion compensation process. By pre-establishing the candidate order using information already present in the coding context, the system avoids complex runtime decisions and reduces the computational burden during encoding and decoding
3Productivity
If motion vector competition with multiple candidates is used, then coding efficiency improves, but the number of bits required to transmit the predictor index increases
Solution Approach 1:
The patent applies local quality by using different candidate ordering strategies for different coding contexts (e.g., different block types, different reference frame types, different motion characteristics). This context-specific ordering allows the system to maintain high coding efficiency with multiple candidates while minimizing the bits required for index transmission by making the most likely candidate appear first in the ordered list
Data Source
AI summary
Methods and apparatus are provided for adaptive motion vector candidate ordering for video encoding and decoding. An apparatus includes a video encoder (100) for encoding a block in a picture by selecting an order of motion vector predictor candidates for the block responsive to a characteristic available at both the video encoder and a corresponding decoder. The characteristic excludes a mode in which the block is partitioned.