Motion Vector Prediction Merge Mode for Video Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional video coding techniques are computationally inefficient and limited in compressing and decompressing video data, leading to high resource consumption and time requirements.
Innovation Solution
The technology populates a list of motion vector prediction information with candidate motion vector prediction data, including default motion vector prediction data, and decodes a merge flag to determine merge candidates for efficient encoding and decoding of video data, ensuring at least one merge candidate is available for motion information prediction.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional video coding techniques are used, then video compression and decompression can be performed, but computing resource consumption and processing time are high
Solution Approach 1:
The patent applies preliminary action by pre-populating a list of motion vector prediction information with candidate motion vector prediction data before actual video encoding/decoding operations. This pre-computation of motion vector candidates reduces the computational burden during real-time processing, thereby improving encoding/decoding speed while reducing computing resource consumption.
Solution Approach 2:
The patent implements self-service by ensuring that the motion vector prediction system uses its own previously computed candidate data from the populated list, rather than requiring external computational assistance. The default motion vector prediction data and merge candidates serve the system's own prediction needs, reducing dependency on additional computing resources.
2Productivity
If traditional motion prediction methods are used, then video data can be compressed, but processing complexity increases when no valid merge candidates are available
Solution Approach 1:
The patent applies beforehand cushioning by pre-populating the motion vector prediction list with default motion vector prediction data and ensuring at least one merge candidate is always available. This preparatory measure cushions against the scenario where no valid merge candidates would otherwise be available, preventing processing complexity from increasing during actual video compression operations.
Solution Approach 2:
The patent uses parameter changes by modifying the state of motion vector prediction data from undefined or empty to a populated list containing candidate data and default values. This parameter change ensures that the system always has valid merge candidates to work with, maintaining compression efficiency without requiring complex fallback processing.
3Measurement precision
If comprehensive motion vector prediction data is collected, then prediction accuracy improves, but data processing time and memory usage increase
Solution Approach 1:
The patent applies the taking out principle by extracting only the essential candidate motion vector prediction data needed for accurate prediction, rather than processing all possible motion vector information. The system selectively populates the prediction list with relevant candidates and default data, achieving good prediction accuracy while minimizing data processing time and memory usage.
Data Source
AI summary
Disclosed herein are representative embodiments of processing digital image data. In one exemplary embodiment disclosed herein, for a current block of a first frame of digital image data, a list of motion vector prediction information for the current block is populated with candidate motion vector prediction data that includes default motion vector prediction data. In another exemplary embodiment disclosed herein, at least a portion of a coded video bitstream is received and a merge flag for a current block in a current frame is decoded. After the merge flag is decoded, at least one merge candidate for the current block is determined.