Video Encoding Bit Rate Reduction via Motion Vector Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Video telephony systems face high bandwidth consumption due to the existing methods' inability to effectively reduce bit rates, particularly in scenarios with multiple simultaneous users, as they do not efficiently differentiate between moving and static image components for optimized compression.
Innovation Solution
The method involves maintaining a running average of motion vectors for video blocks over a threshold number of frames and adjusting quantization parameters accordingly, applying finer quantization to moving blocks and coarser quantization to static blocks, thereby reducing bit rates by optimizing compression across inter-coded and intra-coded frames.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If uniform quantization parameter is used for all blocks, then encoding simplicity is maintained, but bit rate reduction efficiency is limited
Solution Approach 1:
The patent applies different quantization parameters to different blocks based on their motion characteristics. Blocks with low motion activity (static backgrounds) use coarser quantization to reduce bit rate, while blocks with high motion activity (moving subjects) use finer quantization to preserve image quality. This local differentiation resolves the contradiction by optimizing bit rate without uniformly compromising encoding simplicity.
Solution Approach 2:
The patent dynamically adjusts quantization parameters based on running averages of motion vectors calculated over multiple frames. This dynamic adaptation allows the encoder to respond to changing motion patterns in real-time, optimizing bit rate reduction while maintaining encoding efficiency through automated parameter selection.
2Quantity of substance
If coarser quantization is applied to reduce bit rate, then bandwidth consumption is reduced, but image quality degrades
Solution Approach 1:
The patent preserves image quality in regions requiring it (moving subjects) by applying finer quantization to high-motion blocks, while allowing quality degradation only in less critical regions (static backgrounds) through coarser quantization. This spatially selective approach reduces overall bandwidth consumption without significantly impacting perceived image quality.
Solution Approach 2:
The patent changes the quantization parameter based on motion characteristics, using a threshold-based mechanism to select between fine and coarse quantization. This parameter adaptation allows the system to optimize the trade-off between bandwidth consumption and image quality by adjusting quantization strength according to local motion activity.
3Quantity of substance
If different quantization parameters are used for different blocks, then bit rate optimization is improved, but encoding complexity increases
Solution Approach 1:
The patent performs preliminary calculations of running motion vector averages over multiple frames before the actual encoding process. This pre-computation of motion characteristics allows the encoder to make informed quantization parameter selections without adding significant complexity during the main encoding loop, as the motion analysis is prepared in advance.
Solution Approach 2:
The patent uses the motion vector information already generated during standard H.264 encoding processes to determine quantization parameters. By reusing existing motion analysis data and adding only simple threshold-based comparisons, the system achieves bit rate optimization without requiring complex additional processing or external information.
Data Source
Figure 1~2
Figure 3~4
Figure 5~7
AI summary
Method and apparatus for encoding video is described. In one example, average of motion vectors for each of a plurality of blocks is maintained over a threshold number of inter-coded frames in the video. The running average of motion vectors for each of the plurality of blocks is compared to a threshold value. Each of the plurality of blocks the running average of which does not satisfy the threshold value is encoded using a first quantization parameter. Each of the plurality of blocks the running average of which satisfies the threshold value is encoded using a second quantization parameter. The second quantization parameter results in a coarser quantization of transformed coefficients than the first quantization parameter.