Block Vector Search Region Selection for Intra Template Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing Intra Template Matching Prediction (Intra TMP) technologies require more effective reference information for higher prediction accuracy, leading to increased encoding complexity and reduced efficiency and performance.
Innovation Solution
Determine a first template corresponding to a current block, and select a fully reconstructed and/or undetermined reconstructed search region to limit the search range, utilizing available samples in the undetermined region while reducing complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If more effective reference information is acquired to achieve higher prediction accuracy, then prediction accuracy is improved, but encoding complexity increases
Solution Approach 1:
The search region is divided into multiple sub-regions, and template matching is performed separately in each sub-region. This segmentation allows the algorithm to explore more reference information systematically while managing computational complexity through divided processing steps.
Solution Approach 2:
Different search strategies are applied to different sub-regions based on their characteristics. The algorithm adapts the search process to local properties of each sub-region, improving prediction accuracy by focusing computational resources where they are most effective while avoiding unnecessary computations in other areas.
2Measurement precision
If more effective reference information is acquired to achieve higher prediction accuracy, then prediction accuracy is improved, but encoding and decoding efficiency decreases
Solution Approach 1:
By segmenting the search region into sub-regions, the algorithm can perform template matching in a structured manner that improves prediction accuracy through comprehensive search while maintaining efficiency through organized processing that avoids redundant computations.
Solution Approach 2:
The adaptive search strategy applies different processing to different sub-regions, improving prediction accuracy by utilizing available reference information effectively while maintaining encoding and decoding efficiency by avoiding uniform exhaustive search across the entire region.
3Device complexity
If the search range is limited to reduce complexity, then encoding complexity is reduced, but prediction accuracy may deteriorate
Solution Approach 1:
The search region is divided into multiple sub-regions, allowing the algorithm to perform template matching in a structured manner that reduces computational complexity through divided processing while maintaining prediction accuracy by ensuring comprehensive coverage of the search space.
Solution Approach 2:
Different search strategies are applied to different sub-regions based on their characteristics, reducing overall encoding complexity by adapting processing to local properties while maintaining prediction accuracy by focusing computational resources where they are most effective.
Data Source
Figure 1~2
Figure 3(a)~4
Figure 5~6
AI summary
The embodiments of the present application disclose an encoding method, a decoding method, a code stream, an encoder, a decoder and a storage medium. The encoding/decoding method comprises: an encoder/decoder determining a first template corresponding to the current block; according to the first template, determining a fully reconstructed search area and/or an undetermined reconstructed search area, wherein the fully reconstructed search area comprises reconstructed sampling points, and the undetermined reconstructed search area comprises reconstructed sampling points and/or unreconstructed sampling points; performing area selection on the basis of the fully reconstructed search area and/or the undetermined reconstructed search area, and determining a selected fully reconstructed search area and/or a selected undetermined reconstructed search area, wherein the selected fully reconstructed search area is smaller than or equal to the fully reconstructed search area, and the selected undetermined reconstructed search area is smaller than or equal to the undetermined reconstructed search area; and respectively searching in the selected fully reconstructed search area and/or the selected undetermined reconstructed search area to determine one or more block vectors of the current block.