Template Matching Prediction for Video Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video compression technologies face challenges in efficiently handling intra prediction, particularly with template matching prediction, due to varying numbers of comparisons per pixel across different block sizes, which increases complexity and limits parallel processing opportunities.
Innovation Solution
Implementing a method for video encoding and decoding that uses a fixed number of comparisons per pixel independent of block dimension, and modifies the search range to enable parallel processing, such as wave-front parallel processing, by limiting the search range to the reconstructed frame part and using partial templates when necessary.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Extent of automation
If template matching prediction uses a search range that allows full parallel processing, then parallel processing capability is improved, but the number of comparisons per pixel varies with block size increasing complexity
Solution Approach 1:
The patent changes the parameter of search range from a fixed large area to a dynamically adjusted range that ensures a constant number of comparisons per pixel. This is achieved by calculating the search range based on the block size and a scaling factor, ensuring that the template search area adapts to different block dimensions while maintaining consistent computational complexity per pixel.
Solution Approach 2:
The search range is made dynamic rather than static, adjusting automatically based on the current block's dimensions. The patent implements this by using a scaling factor that modifies the search range proportionally to the block size, allowing the system to maintain optimal parallel processing characteristics across varying block sizes while keeping the comparison count per pixel constant.
2Device complexity
If template matching prediction uses a fixed search range, then device complexity is reduced, but parallel processing capability is limited due to varying comparisons per pixel
Solution Approach 1:
The patent introduces a scaling factor parameter that transforms the search range calculation from a fixed value to a proportional relationship with block size. This ensures that the search range scales appropriately with different block dimensions, maintaining a constant number of comparisons per pixel and enabling efficient parallel processing across various block sizes.
3Manufacturing precision
If the search range is increased to improve prediction accuracy, then coding efficiency is improved, but the number of comparisons per pixel increases complexity
Solution Approach 1:
The patent adjusts the search range parameter proportionally to block size using a scaling factor, allowing larger search ranges for larger blocks to maintain prediction accuracy. This proportional adjustment ensures that the number of comparisons per pixel remains constant, preventing complexity from increasing even as the absolute search range expands to improve prediction quality.
Data Source
AI summary
A method, apparatus or system for processing video information can involve determining a prediction block for a current block of picture information based on a comparison of a template associated with the current block to at least one other template associated with at least one other block in an area of decoded picture information, wherein the comparison is based on a constant number of comparisons per pixel independent of a size of the current block; and decoding/encoding the current block based on the prediction block.