String Video Coding With Matching-Pattern Pixel Prediction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing video coding processes face inefficiencies in string prediction due to misalignment in bit estimation and insufficient string vector candidates, which affect the compression rate.
Innovation Solution
A method for video encoding that involves determining a current string in a coding unit, identifying reference matching pixels, and adjusting pixel positions using various flip patterns to enhance string prediction accuracy, along with encoding based on target predictions and costs analysis.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If string prediction is used in video coding, then compression rate can be improved, but bit estimation becomes misaligned and string vector candidates become insufficient
Solution Approach 1:
The patent segments the string prediction process into multiple stages: first identifying candidate string vectors from neighboring blocks, then filtering and ranking them based on prediction accuracy metrics. This segmentation allows systematic exploration of multiple candidates while maintaining efficient bit estimation through hierarchical evaluation.
Solution Approach 2:
The patent performs preliminary actions by pre-calculating and storing candidate string vectors from neighboring blocks before the actual prediction process. This preliminary preparation ensures that sufficient candidates are available for selection while maintaining alignment in bit estimation through pre-established mapping relationships.
2Productivity
If string prediction is used in video coding, then compression rate can be improved, but the accuracy of selected string vector candidates deteriorates
Solution Approach 1:
The patent applies local quality by evaluating different string vector candidates based on their specific characteristics and positions. Each candidate is assessed individually using local prediction accuracy metrics, allowing the selection of the most suitable candidate for each specific coding context rather than using a uniform selection criterion.
Solution Approach 2:
The patent implements feedback mechanisms where the selection of string vector candidates is continuously refined based on prediction accuracy measurements. The system uses feedback from prediction residuals and cost functions to iteratively improve the selection process, ensuring high accuracy in string vector selection while maintaining compression efficiency.
Data Source
AI summary
The present disclosure relates to systems and methods for video encoding. The systems may determine a current string in a coding unit (CU) of an image frame. The current string may include one or more pixels. The systems may determine, based on a first pixel in the current string, a reference matching pixel of the first pixel by searching a searching area. The searching area may include a plurality of matching pixels The systems may determine, based on the reference matching pixel and matching patterns, a count of matching pixels in each of a plurality of groups, corresponding to the matching patterns, of the current string. The systems may further determine, based on counts of matching pixels in the plurality of groups corresponding to the matching patterns, a target prediction of the current string.