JVET Intra Prediction Template Matching Without Explicit Mode Signaling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies, such as JVET, face challenges in efficiently decoding intra prediction modes without explicit indication in the bitstream, leading to increased overhead and reduced coding efficiency.
Innovation Solution
Implementing a template matching scheme within the decoder to determine intra prediction modes by calculating matching costs between candidate templates and CU templates based on pixel values in a defined search window, allowing the decoder to select the optimal prediction mode without explicit signaling.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If explicit indication of intra prediction modes is transmitted in the bitstream, then decoding accuracy is improved, but bitstream overhead increases
Solution Approach 1:
The patent uses template matching where the decoder creates candidate prediction templates by copying and processing pixel values from search windows in the decoded area. The decoder generates multiple candidate templates using different intra prediction modes and selects the best match without receiving explicit mode indication, thus reducing bitstream overhead while maintaining decoding accuracy
Solution Approach 2:
The decoder performs self-service by autonomously determining the intra prediction mode through template matching operations. The decoder defines CU templates, generates candidate prediction templates, calculates matching costs, and selects the optimal mode independently, eliminating the need for explicit mode signaling in the bitstream
2Productivity
If template matching is implemented in the decoder, then coding efficiency is improved, but device complexity increases
Solution Approach 1:
The patent segments the template matching process into distinct operational stages: defining CU templates from decoded areas, defining search windows, generating candidate prediction templates using different intra prediction modes, calculating matching costs between templates, and selecting the optimal mode. This segmentation organizes the complex decoder operations into manageable steps, improving implementability while maintaining coding efficiency
Solution Approach 2:
The decoder performs preliminary actions by pre-defining CU templates and search windows before generating candidate prediction templates. The search windows are established within decoded areas, and candidate templates are pre-generated using various intra prediction modes before the matching cost calculation, streamlining the overall decoding process
Data Source
AI summary
A method of decoding JVET video, comprising defining a coding unit (CU) template within a decoded area of a video frame, the CU template being positioned above and/or to the left of a current decoding position for which data was intra predicted, defining a search window within the decoded area, the search window being adjacent to the CU template, generating a plurality of candidate prediction templates based on pixel values in the search window, each of the plurality of candidate prediction templates being generated using different intra prediction modes, calculating a matching cost between the CU template and each of the plurality of candidate prediction templates, selecting an intra prediction mode that generated the candidate prediction template that had the lowest matching cost relative to the CU template, and generating a prediction CU for the current decoding position based on the intra prediction mode.