Motion Vector Candidate Lists Using Global Motion in Video Frames
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video compression technologies face inefficiencies in encoding and decoding processes due to the complex interplay between video quality, data usage, encoding complexity, sensitivity to errors, and the need for effective motion compensation, particularly in handling global and local motion within video frames.
Innovation Solution
Implementing a decoder that utilizes global motion vector candidates signaled in headers to construct a motion vector candidate list, reducing computational complexity and improving compression efficiency by adaptively selecting and signaling global motion vectors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If motion compensation is used to predict video frames, then compression efficiency is improved, but computational complexity increases
Solution Approach 1:
The patent pre-calculates and stores global motion vectors in a lookup table during encoding, so that during decoding, the motion compensation can be performed using pre-prepared data, reducing real-time computational complexity while maintaining compression efficiency
Solution Approach 2:
The system uses previously decoded motion information from adjacent blocks to generate motion vector candidates for current blocks, allowing the decoding process to leverage its own past computations rather than requiring external or redundant calculations
2Measurement precision
If more motion vector candidates are included in the candidate list, then prediction accuracy is improved, but bitrate increases
Solution Approach 1:
The patent dynamically adjusts the number and type of motion vector candidates included in the candidate list based on scene characteristics and motion complexity, using fewer candidates for simple scenes and more for complex scenes, thereby optimizing the balance between prediction accuracy and bitrate
Solution Approach 2:
The patent introduces a motion vector candidate list as an intermediary structure that selectively stores only the most relevant motion vectors, acting as a filter between the full set of possible motion vectors and the final prediction, thus reducing bitrate while maintaining accuracy
3Ease of manufacture
If global motion vectors are signaled in headers, then encoding complexity is reduced, but precision of local motion representation may be lost
Solution Approach 1:
The patent segments motion representation into two parts: global motion vectors signaled in headers for overall scene motion, and local motion vector candidates derived from adjacent blocks for fine-grained local motion details, allowing both simplicity and precision to coexist
Data Source
AI summary
A decoder includes circuitry configured to receive a bitstream; determine, for a current block and using the bitstream, a global motion vector candidate utilized by an adjacent block; construct a motion vector candidate list including adding the determined global motion vector candidate to the motion vector candidate list; and reconstruct pixel data of the current block and using the motion vector candidate list. Related apparatus, systems, techniques and articles are also described.


