Intra TMP Search Region Segmentation for Faster Video Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Common search strategies in Intra Template Matching Prediction (Intra TMP) technologies suffer from high computational complexity, reducing the efficiency and performance of encoding and decoding processes.
Innovation Solution
Implement a method where both the encoder and decoder determine a first template for a current block and a preset search region based on this template, using a first parameter to control the search process, allowing early termination or continuation based on a matching cost threshold.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If common search strategies are used in Intra TMP, then the search can be performed, but the computational complexity becomes high
Solution Approach 1:
The search region is divided into multiple sub-regions, and the template matching search is performed separately in each sub-region. This segmentation reduces the computational complexity of the overall search while maintaining matching accuracy by limiting the search scope in each sub-region.
Solution Approach 2:
The search region is pre-divided into sub-regions before performing the template matching search. This preliminary action of dividing the search space reduces the computational burden during the actual matching process, as the search is confined to smaller sub-regions rather than the entire search region.
2Measurement precision
If common search strategies are used in Intra TMP, then the search can be performed, but the encoding and decoding efficiency is reduced
Solution Approach 1:
The search region is divided into multiple sub-regions, and the template matching search is performed separately in each sub-region. This segmentation reduces the computational complexity of the overall search while maintaining matching accuracy by limiting the search scope in each sub-region.
Solution Approach 2:
The search region is pre-divided into sub-regions before performing the template matching search. This preliminary action of dividing the search space reduces the computational burden during the actual matching process, as the search is confined to smaller sub-regions rather than the entire search region.
3Measurement precision
If common search strategies are used in Intra TMP, then the search can be performed, but the performance of encoding and decoding is reduced
Solution Approach 1:
The search region is divided into multiple sub-regions, and the template matching search is performed separately in each sub-region. This segmentation reduces the computational complexity of the overall search while maintaining matching accuracy by limiting the search scope in each sub-region.
Solution Approach 2:
The search region is pre-divided into sub-regions before performing the template matching search. This preliminary action of dividing the search space reduces the computational burden during the actual matching process, as the search is confined to smaller sub-regions rather than the entire search region.
Data Source
AI summary
An encoding/decoding method, a code stream, an encoder, a decoder, and a storage medium are provided. The decoding method includes that: a first template for a current block is determined, and a preset search region is determined according to the first template; a search in the preset search region is performed according to a first parameter for the current block, and a block vector of the current block is determined, the first parameter is used for controlling the searching process; and prediction values of the current block are determined according to the block vector of the current block.


