Function-Based Video Block Matching for Encoding Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional video codecs face inefficiencies in exact block matching, particularly in real-time encoding scenarios, leading to resource-intensive and time-consuming processes that result in lower compression ratios and video quality, especially when dealing with uniform content like screen-sharing.
Innovation Solution
A function-based block matching technique generates representative values for video blocks, allowing for faster matching by comparing these values rather than individual pixels, thereby reducing the need for lengthy searches through hash tables and improving resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If pixel-for-pixel block matching is performed, then matching accuracy is improved, but encoding speed and resource efficiency deteriorate
Solution Approach 1:
The patent divides a video block into multiple sub-blocks and performs block matching on each sub-block independently. This segmentation allows the encoder to process smaller units with higher accuracy while maintaining overall encoding efficiency, as the computational complexity is distributed across multiple smaller operations rather than one large pixel-for-pixel comparison
Solution Approach 2:
The patent performs preliminary processing by dividing blocks into sub-blocks and preparing reference data before the actual matching process. This preliminary segmentation and organization of data structures enables faster access and comparison during the matching phase, improving both speed and accuracy
2Speed
If hash table lookup is used for block matching, then search speed is improved, but resource consumption and complexity increase
Solution Approach 1:
The patent extracts and processes only the necessary sub-block portions that are relevant to matching, rather than processing entire blocks or maintaining complex hash table structures for all possible block variations. This selective extraction reduces memory requirements and structural complexity while maintaining matching speed
Solution Approach 2:
The patent uses simplified reference copies of sub-blocks from previously decoded frames or neighboring blocks, rather than maintaining complex hash table entries for every possible block configuration. These copied references enable fast comparison with minimal storage overhead and structural complexity
3Loss of information
If exhaustive block matching is performed, then compression ratio is improved, but encoding time increases
Solution Approach 1:
The patent performs block matching on partial sub-blocks rather than exhaustive full-block comparisons. By applying matching to smaller sub-blocks selectively, the encoder achieves sufficient compression quality without the time cost of examining every possible block position and configuration in detail
Solution Approach 2:
By segmenting blocks into sub-blocks, the patent enables parallel processing and early termination of matching operations. When sub-block matches are found, the encoder can proceed without performing exhaustive searches on the entire block, reducing encoding time while maintaining acceptable compression ratios
Data Source
AI summary
A technique for encoding a video signal includes generating a representative value for each block of one or more video frames by applying a predetermined function to the pixels of the respective block. To perform a block matching operation for a current block, the technique applies the predetermined function to the current block and interrogates representative values of blocks at specified locations in a spatial and/or temporal vicinity of the current block to find a matching block whose representative value matches the one generated for the current block.