Inter Prediction Merge Estimation Parallel Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing video coding technologies, such as HEVC, face challenges in parallel processing of coding blocks due to the reliance on square partition patterns, which are not compatible with the non-square partition modes in VVC, leading to degraded coding performance and restricted parallelism in merge estimation.
Innovation Solution
An apparatus and method for inter prediction that dynamically marks candidate blocks as unavailable based on specific coordinate conditions within an extended merge estimation region, allowing parallel processing of coding blocks by excluding motion data from adjacent blocks, thereby breaking dependencies and enabling efficient parallel processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If merge candidate lists are constructed using spatial candidates from adjacent blocks, then motion estimation accuracy is improved, but parallel processing capability is restricted due to data dependencies
Solution Approach 1:
The patent divides the picture into multiple independent merge estimation regions (MERs), where each MER can construct its merge candidate list independently without relying on motion data from other regions. This segmentation breaks the data dependencies that prevent parallel processing, allowing multiple PUs within the same MER to be processed simultaneously while maintaining motion estimation accuracy through proper candidate selection within each region.
2Productivity
If parallel merge estimation level is increased to enable more parallel processing, then processing speed is improved, but the number of available merge candidates is reduced
Solution Approach 1:
The patent applies different merge candidate construction strategies to different regions based on their specific characteristics. Within each MER, the patent selectively includes spatial candidates from adjacent PUs that are available in parallel processing order, while excluding candidates that would create dependencies. This local adaptation allows each region to have optimal candidate availability tailored to its position and the parallel processing constraints, rather than applying a uniform restriction across the entire picture.
3Productivity
If merge candidates from non-adjacent blocks are used, then coding efficiency is improved, but reliability of parallel processing is compromised due to potential data unavailability
Solution Approach 1:
The patent establishes a predetermined parallel processing order for PUs and pre-determines which spatial candidates will be available at each processing step. By planning the candidate selection in advance based on the processing order, the patent ensures that only PUs with guaranteed available motion data are included as candidates, eliminating the need for runtime availability checks and ensuring reliable parallel processing execution.
Data Source
AI summary
Parallel processing of inter prediction of a current coding block and preceding coding blocks depending on the partition depth of the current coding block is disclosed. An apparatus comprises a processing circuitry configured for: obtaining a value of a parameter for the current coding block, wherein the value of the parameter indicates a partition depth of the current coding block, and performing an inter prediction process for the current coding block; wherein no Motion Vector Predictor candidate comprising a motion vector of a coded block of the picture that is not spatially adjacent to the current coding block for the current coding block is used in the inter prediction process or a merge mode inter prediction process comprised in the inter prediction process, when the value of the parameter for the current coding block is greater than a threshold.


