Variable Block Video Codec Motion Vector Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional video codecs struggle with high-resolution video compression and decompression due to fixed block sizes, inefficiencies in handling varying resolutions, and artifacts in uniform motion regions, leading to increased computational complexity and visual distortions.
Innovation Solution
A codec system that compresses video data using blocks of variable sizes, adapts motion vectors on a frame-by-frame basis, and operates in the RGB color space, balancing distortion and rate to minimize artifacts and support efficient decompression across different resolutions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If conventional video codecs use fixed block sizes for compression, then the decompression process becomes simpler, but the system cannot efficiently handle varying resolutions and produces artifacts in uniform motion regions
Solution Approach 1:
The patent applies dynamics by transitioning from fixed block sizes to variable block sizes that adapt to the content characteristics. The block size is dynamically adjusted based on motion vector magnitude and region uniformity, allowing the system to handle varying resolutions and motion patterns efficiently while maintaining computational feasibility through controlled adaptation.
Solution Approach 2:
The patent implements local quality by dividing the video frame into multiple blocks with different sizes according to local content characteristics. Regions with uniform motion receive larger blocks while regions with complex motion receive smaller blocks, optimizing compression efficiency and reducing artifacts without uniformly increasing complexity across the entire frame.
2Manufacturing precision
If motion vectors are not adapted on a frame-by-frame basis, then the compression process is faster, but artifacts appear in uniform motion regions and playback quality deteriorates
Solution Approach 1:
The patent applies preliminary action by pre-processing the motion vector field to identify uniform motion regions before final compression. The system analyzes motion vector continuity and magnitude in advance to determine block boundaries and compression parameters, ensuring high playback quality while maintaining efficient processing speeds through proactive optimization.
3Quantity of substance
If the codec transforms to luminance/chrominance color space, then the number of bits per frame is reduced, but additional computation is required at the decompressor and hardware complexity increases with resolution
Solution Approach 1:
The patent applies parameter changes by adjusting the color space transformation parameters and block size parameters dynamically. The system modifies the transformation characteristics based on the specific video content and resolution requirements, reducing bits per frame when possible while adapting the decompression complexity to match the compression complexity, thereby avoiding hardware complexity increases with resolution.
Data Source
AI summary
A codec, systems, and methods for compressing video data includes selecting a current video frame of the video data, dividing the current video frame into multiple blocks, wherein each block has M×N pixels, approximating the blocks of the current frame based on motion vectors associated with corresponding blocks from the previous frame, further refining the blocks of the current frame by determining optimal motion vectors for the blocks of the current frame based on the motion vectors provided (i) by the corresponding blocks from the previous frame, (ii) by the surrounding blocks in the current frame, and (iii) from successively smaller blocks within the current frame, wherein the optimal motion vectors for the blocks of the current frame are optimized to balance distortion and rate and wherein the optimal motion vectors are represented by codewords generated from Huffman tables.