Representative Motion Information for Block-Based Temporal Prediction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional video coding techniques are computationally inefficient and limited in compressing and decompressing video, consuming significant computing resources and time.
Innovation Solution
Storing and using representative motion information during video encoding and decoding, such as buffering representative motion-vector and reference-frame index information for groups of blocks, to reduce memory requirements and improve efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional video coding techniques are used to compress and decompress video, then video compression and decompression functions are achieved, but computing resources and processing time are significantly consumed
Solution Approach 1:
The patent divides the video frame into multiple blocks and further into sub-blocks, processing motion information at different hierarchical levels. By segmenting the motion estimation process into block-level and sub-block-level operations, the system reduces computational complexity while maintaining compression efficiency through selective processing of motion vectors and reference frame indices.
Solution Approach 2:
The patent applies partial action by processing only the motion information necessary for each block rather than processing the entire frame uniformly. It uses representative motion-vector information and representative reference-frame index information for groups of blocks, performing computation only where needed and avoiding redundant processing across all blocks.
2Reliability
If motion information is stored for all blocks in a reference frame, then complete motion data is available for decoding, but memory requirements increase significantly
Solution Approach 1:
The patent extracts only the essential motion information needed for decoding, specifically representative motion-vector information and representative reference-frame index information for groups of blocks. It discards redundant motion data for individual blocks within groups, retaining only the representative samples that suffice for accurate video decoding while dramatically reducing memory requirements.
Solution Approach 2:
The patent uses copying by creating a simplified representation of motion information where representative motion vectors and reference frame indices are copied and reused for multiple blocks within a group. This allows the system to store a single copy of motion data that represents an entire group of blocks, reducing memory consumption while maintaining decoding capability.
3Quantity of substance
If representative motion information is buffered and used for groups of blocks, then memory consumption is reduced, but processing complexity increases
Solution Approach 1:
The patent merges the processing of multiple blocks by using representative motion information from a single block to decode an entire group of blocks. It combines the motion estimation results for a representative block with the decoding process for all blocks in the group, simplifying the overall processing architecture while reducing memory requirements through shared motion data.
Data Source
AI summary
Disclosed herein are representative embodiments of generating representative motion information that can be used during processing of a video frame. In one exemplary embodiment disclosed herein, a reference frame comprising a group of blocks is processed, and motion information for the group of blocks is compressed at least by buffering representative motion-vector information and representative reference-frame index information for the group of blocks. The representative reference-frame index information comprises reference-frame index information of a representative block of the group of blocks, and the representative reference-frame index information represents reference-frame index information for the group of blocks during processing of a current frame.