Geometric Partition Mode With Template Matching to Reduce Coding Complexity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face challenges in efficiently applying geometric partitioning mode (GPM) due to high computational complexity, hardware dependency, and pipeline latency issues, particularly in the Versatile Video Coding Standard (VVC).
Innovation Solution
Implement adaptive reordering of merge candidates with template matching (ARMC-TM) to derive GPM inter candidate lists, enable GPM for all-intra coding units, utilize inter and intra template costs in intra-prediction modes, and use neighboring reconstructed samples and edge criteria to generate partitioning candidates, reducing complexity and latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If geometric partitioning mode (GPM) is applied in video coding, then coding performance is improved, but computational complexity increases
Solution Approach 1:
The patent divides the coding unit into two triangular partitions using geometric partitioning, allowing independent prediction for each partition. This segmentation enables better adaptation to different regions while managing complexity through structured division of the prediction process
Solution Approach 2:
The patent performs preliminary actions by deriving candidate lists and templates before final prediction, pre-computing potential partition configurations and motion candidates to reduce the search space and computational burden during actual encoding
2Productivity
If geometric partitioning mode (GPM) is applied in video coding, then compression efficiency is improved, but hardware dependency increases
Solution Approach 1:
The patent designs the GPM implementation to be universally applicable across different hardware platforms by using software-based template matching and candidate derivation that can run on general-purpose processors, eliminating the need for specialized hardware circuits
Solution Approach 2:
The patent replaces hardware-based geometric partitioning mechanisms with software algorithms that perform template matching and candidate list derivation, substituting mechanical/hardware systems with flexible software implementations that achieve the same function without hardware dependency
3Measurement precision
If geometric partitioning mode (GPM) is applied in video coding, then coding accuracy is improved, but pipeline latency increases
Solution Approach 1:
The patent performs preliminary derivation of candidate lists and template matching results before the actual prediction step, pre-computing potential solutions to reduce the time required during the critical prediction path, thereby minimizing pipeline latency while maintaining accuracy
Solution Approach 2:
The patent implements dynamic candidate list management where the number and type of candidates are adaptively determined based on available reference pictures and coding conditions, allowing the system to optimize between accuracy and latency by adjusting the amount of computation based on real-time constraints
Data Source
AI summary
Methods related to the geometric partition mode (GPM) in video coding are described. The proposed methods include: applying adaptive ordering of merge candidates with template matching (ARMC-TM) to derive GPM inter candidate lists, candidates list applying merge motion vector differences in GPM, enabling GPM for all-intra coding units (CUs), using inter and intra template costs in intra-prediction modes of GPM, using GPM partitions to generate templates in template matching, and using neighboring reconstructed samples and an edge criterion to derive top and left-edge intercepts to generate partitioning candidates.